./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-184.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:23,585 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:23,686 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba29fddd-2600-4163-b4dc-fd222c5aff43/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:23,693 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:23,693 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:23,724 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:23,725 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:23,726 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:23,727 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:23,727 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:23,729 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:23,729 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:23,729 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:23,729 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:23,729 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:23,729 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:23,730 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:23,730 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:23,730 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:23,731 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:23,731 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:23,731 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:23,731 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:23,731 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:23,731 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:23,732 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:23,732 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:24,087 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:24,098 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:24,102 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:24,103 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:24,105 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:24,106 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba29fddd-2600-4163-b4dc-fd222c5aff43/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-184.smt2
[2025-04-28 21:21:24,109 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:24,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:24,614 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba29fddd-2600-4163-b4dc-fd222c5aff43/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-184.smt2
[2025-04-28 21:21:24,618 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:24,620 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:24,621 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:24,621 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:24,622 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:24,625 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,686 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24 Unit
[2025-04-28 21:21:24,687 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:24,690 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:24,690 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:24,690 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:24,708 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,708 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,751 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,752 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,765 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,766 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,773 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,775 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,780 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,809 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:24,810 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:24,810 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:24,810 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:24,812 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (1/1) ...
[2025-04-28 21:21:24,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:24,836 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:24,851 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:24,855 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:24,872 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:24,873 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:24,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:24,873 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-04-28 21:21:24,873 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-04-28 21:21:24,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-04-28 21:21:24,873 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,873 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__42_43_0
[2025-04-28 21:21:24,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__42_43_0
[2025-04-28 21:21:24,873 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,874 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,874 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,874 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_f__42_43_0
[2025-04-28 21:21:24,874 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_f_41_43_0 given in one single declaration
[2025-04-28 21:21:24,874 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_f_41_43_0
[2025-04-28 21:21:24,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_f_41_43_0
[2025-04-28 21:21:24,875 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_while_header_f_34_43_0 given in one single declaration
[2025-04-28 21:21:24,875 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_while_header_f_34_43_0
[2025-04-28 21:21:24,875 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_while_header_f_34_43_0
[2025-04-28 21:21:24,875 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_f_41_43_0 given in one single declaration
[2025-04-28 21:21:24,875 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_f_41_43_0
[2025-04-28 21:21:24,875 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_f_41_43_0
[2025-04-28 21:21:24,875 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_while_header_f_26_43_0 given in one single declaration
[2025-04-28 21:21:24,875 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_while_header_f_26_43_0
[2025-04-28 21:21:24,875 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_while_header_f_26_43_0
[2025-04-28 21:21:24,875 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_while_body_f_25_43_0 given in one single declaration
[2025-04-28 21:21:24,875 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_while_body_f_25_43_0
[2025-04-28 21:21:24,876 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_while_body_f_25_43_0
[2025-04-28 21:21:24,876 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_while_body_f_33_43_0 given in one single declaration
[2025-04-28 21:21:24,876 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_while_body_f_33_43_0
[2025-04-28 21:21:24,876 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_while_body_f_33_43_0
[2025-04-28 21:21:24,876 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_f_41_43_0 given in one single declaration
[2025-04-28 21:21:24,876 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_f_41_43_0
[2025-04-28 21:21:24,876 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_f_41_43_0
[2025-04-28 21:21:24,876 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_5_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,876 INFO  L130     BoogieDeclarations]: Found specification of procedure block_5_function_f__42_43_0
[2025-04-28 21:21:24,876 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_5_function_f__42_43_0
[2025-04-28 21:21:24,876 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_return_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,877 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_return_function_f__42_43_0
[2025-04-28 21:21:24,877 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_return_function_f__42_43_0
[2025-04-28 21:21:24,877 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f__42_43_0 given in one single declaration
[2025-04-28 21:21:24,879 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f__42_43_0
[2025-04-28 21:21:24,879 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f__42_43_0
[2025-04-28 21:21:24,879 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,879 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_Simple_43_0
[2025-04-28 21:21:24,879 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,880 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_17_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,880 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_17_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_17_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_19_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,880 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_19_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_19_Simple_43_0
[2025-04-28 21:21:24,880 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_18_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,881 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_18_Simple_43_0
[2025-04-28 21:21:24,881 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_18_Simple_43_0
[2025-04-28 21:21:24,881 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_20_Simple_43_0 given in one single declaration
[2025-04-28 21:21:24,881 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_20_Simple_43_0
[2025-04-28 21:21:24,881 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_20_Simple_43_0
[2025-04-28 21:21:24,881 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:24,881 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:24,881 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:25,090 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:25,092 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:25,431 INFO  L?                        ?]: Removed 139 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:25,431 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:25,450 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:25,450 INFO  L312             CfgBuilder]: Removed 8 assume(true) statements.
[2025-04-28 21:21:25,451 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:25 BoogieIcfgContainer
[2025-04-28 21:21:25,451 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:25,454 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:25,456 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:25,460 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:25,460 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:24" (1/3) ...
[2025-04-28 21:21:25,461 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391fac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:25, skipping insertion in model container
[2025-04-28 21:21:25,461 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:24" (2/3) ...
[2025-04-28 21:21:25,462 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391fac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:25, skipping insertion in model container
[2025-04-28 21:21:25,462 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:25" (3/3) ...
[2025-04-28 21:21:25,463 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:25,480 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:25,483 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 23 procedures, 92 locations, 135 edges, 23 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:25,553 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:25,573 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cc86e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:25,574 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:25,578 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 92 states, 40 states have (on average 1.125) internal successors, (45), 45 states have internal predecessors, (45), 28 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (30), 24 states have call predecessors, (30), 28 states have call successors, (30)
[2025-04-28 21:21:25,595 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-04-28 21:21:25,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,596 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:25,597 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,603 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 768903076, now seen corresponding path program 1 times
[2025-04-28 21:21:25,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,614 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335853620]
[2025-04-28 21:21:25,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,721 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-04-28 21:21:25,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-04-28 21:21:25,880 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:26,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,845 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335853620]
[2025-04-28 21:21:26,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335853620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:26,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604285335]
[2025-04-28 21:21:26,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,907 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:26,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,956 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:26,957 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:26,960 INFO  L87              Difference]: Start difference. First operand  has 92 states, 40 states have (on average 1.125) internal successors, (45), 45 states have internal predecessors, (45), 28 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (30), 24 states have call predecessors, (30), 28 states have call successors, (30) Second operand  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:27,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,123 INFO  L93              Difference]: Finished difference Result 92 states and 105 transitions.
[2025-04-28 21:21:27,125 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,127 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 59
[2025-04-28 21:21:27,128 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,139 INFO  L225             Difference]: With dead ends: 92
[2025-04-28 21:21:27,139 INFO  L226             Difference]: Without dead ends: 92
[2025-04-28 21:21:27,141 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,145 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,146 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:27,162 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-04-28 21:21:27,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-04-28 21:21:27,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 28 states have call successors, (30), 22 states have call predecessors, (30), 23 states have return successors, (31), 25 states have call predecessors, (31), 28 states have call successors, (31)
[2025-04-28 21:21:27,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions.
[2025-04-28 21:21:27,202 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 59
[2025-04-28 21:21:27,203 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,203 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 105 transitions.
[2025-04-28 21:21:27,203 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-04-28 21:21:27,203 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions.
[2025-04-28 21:21:27,206 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-04-28 21:21:27,207 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,207 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,207 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:27,207 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,208 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -1771975969, now seen corresponding path program 1 times
[2025-04-28 21:21:27,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,208 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683151733]
[2025-04-28 21:21:27,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-04-28 21:21:27,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-04-28 21:21:27,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:27,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,441 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683151733]
[2025-04-28 21:21:27,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683151733] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:27,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259461484]
[2025-04-28 21:21:27,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,444 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:27,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:27,446 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,447 INFO  L87              Difference]: Start difference. First operand 92 states and 105 transitions. Second operand  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-04-28 21:21:27,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,486 INFO  L93              Difference]: Finished difference Result 96 states and 109 transitions.
[2025-04-28 21:21:27,486 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:27,486 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 67
[2025-04-28 21:21:27,487 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,488 INFO  L225             Difference]: With dead ends: 96
[2025-04-28 21:21:27,488 INFO  L226             Difference]: Without dead ends: 92
[2025-04-28 21:21:27,488 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:27,489 INFO  L437           NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,489 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:27,493 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-04-28 21:21:27,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90.
[2025-04-28 21:21:27,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 40 states have (on average 1.075) internal successors, (43), 43 states have internal predecessors, (43), 26 states have call successors, (28), 22 states have call predecessors, (28), 23 states have return successors, (29), 24 states have call predecessors, (29), 26 states have call successors, (29)
[2025-04-28 21:21:27,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions.
[2025-04-28 21:21:27,511 INFO  L79                 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 67
[2025-04-28 21:21:27,511 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,511 INFO  L485      AbstractCegarLoop]: Abstraction has 90 states and 100 transitions.
[2025-04-28 21:21:27,511 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18)
[2025-04-28 21:21:27,512 INFO  L278                IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions.
[2025-04-28 21:21:27,515 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-04-28 21:21:27,515 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,516 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,518 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:27,518 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,518 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 594154203, now seen corresponding path program 1 times
[2025-04-28 21:21:27,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,519 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046202709]
[2025-04-28 21:21:27,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,570 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-04-28 21:21:27,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-04-28 21:21:27,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:27,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:27,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,836 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046202709]
[2025-04-28 21:21:27,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046202709] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:27,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826222244]
[2025-04-28 21:21:27,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,837 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:27,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:27,838 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:27,838 INFO  L87              Difference]: Start difference. First operand 90 states and 100 transitions. Second operand  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-04-28 21:21:27,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:27,916 INFO  L93              Difference]: Finished difference Result 95 states and 106 transitions.
[2025-04-28 21:21:27,917 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:27,917 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18) Word has length 67
[2025-04-28 21:21:27,918 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:27,921 INFO  L225             Difference]: With dead ends: 95
[2025-04-28 21:21:27,921 INFO  L226             Difference]: Without dead ends: 95
[2025-04-28 21:21:27,922 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:27,922 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:27,923 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:27,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2025-04-28 21:21:27,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2025-04-28 21:21:27,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 27 states have call successors, (29), 22 states have call predecessors, (29), 25 states have return successors, (32), 27 states have call predecessors, (32), 27 states have call successors, (32)
[2025-04-28 21:21:27,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions.
[2025-04-28 21:21:27,941 INFO  L79                 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 67
[2025-04-28 21:21:27,941 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:27,942 INFO  L485      AbstractCegarLoop]: Abstraction has 95 states and 106 transitions.
[2025-04-28 21:21:27,942 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 4 states have call successors, (18)
[2025-04-28 21:21:27,942 INFO  L278                IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions.
[2025-04-28 21:21:27,943 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-04-28 21:21:27,944 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:27,944 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:27,944 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:27,944 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:27,944 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:27,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -788284563, now seen corresponding path program 1 times
[2025-04-28 21:21:27,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:27,948 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537277126]
[2025-04-28 21:21:27,948 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:27,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:27,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-04-28 21:21:28,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-04-28 21:21:28,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:28,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,489 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537277126]
[2025-04-28 21:21:28,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537277126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:28,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959654160]
[2025-04-28 21:21:28,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,491 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:28,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,492 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:28,492 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:28,492 INFO  L87              Difference]: Start difference. First operand 95 states and 106 transitions. Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20)
[2025-04-28 21:21:28,568 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,568 INFO  L93              Difference]: Finished difference Result 97 states and 108 transitions.
[2025-04-28 21:21:28,568 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:28,569 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 75
[2025-04-28 21:21:28,569 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,571 INFO  L225             Difference]: With dead ends: 97
[2025-04-28 21:21:28,571 INFO  L226             Difference]: Without dead ends: 97
[2025-04-28 21:21:28,571 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:28,574 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,575 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:28,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-04-28 21:21:28,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2025-04-28 21:21:28,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 27 states have call successors, (29), 22 states have call predecessors, (29), 26 states have return successors, (33), 28 states have call predecessors, (33), 27 states have call successors, (33)
[2025-04-28 21:21:28,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions.
[2025-04-28 21:21:28,593 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 75
[2025-04-28 21:21:28,593 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,593 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 108 transitions.
[2025-04-28 21:21:28,593 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20)
[2025-04-28 21:21:28,593 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions.
[2025-04-28 21:21:28,596 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-04-28 21:21:28,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,596 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,596 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:28,596 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,597 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 10326191, now seen corresponding path program 1 times
[2025-04-28 21:21:28,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,597 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479148595]
[2025-04-28 21:21:28,597 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,644 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-04-28 21:21:28,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-04-28 21:21:28,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:29,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,512 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479148595]
[2025-04-28 21:21:29,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479148595] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,512 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028918251]
[2025-04-28 21:21:29,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,520 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,525 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:29,528 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-04-28 21:21:30,047 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-04-28 21:21:30,047 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,047 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,054 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:30,063 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:30,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:30,296 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:32,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:32,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028918251] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:32,804 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:32,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17
[2025-04-28 21:21:32,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926401519]
[2025-04-28 21:21:32,804 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,805 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:32,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:32,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:32,808 INFO  L87              Difference]: Start difference. First operand 97 states and 108 transitions. Second operand  has 17 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (29), 2 states have call predecessors, (29), 11 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33)
[2025-04-28 21:21:33,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,223 INFO  L93              Difference]: Finished difference Result 117 states and 130 transitions.
[2025-04-28 21:21:33,223 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:21:33,224 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (29), 2 states have call predecessors, (29), 11 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 83
[2025-04-28 21:21:33,224 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,225 INFO  L225             Difference]: With dead ends: 117
[2025-04-28 21:21:33,225 INFO  L226             Difference]: Without dead ends: 117
[2025-04-28 21:21:33,226 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:33,226 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 11 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,227 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1296 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:33,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-04-28 21:21:33,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2025-04-28 21:21:33,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 56 states have internal predecessors, (56), 27 states have call successors, (29), 22 states have call predecessors, (29), 36 states have return successors, (45), 38 states have call predecessors, (45), 27 states have call successors, (45)
[2025-04-28 21:21:33,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions.
[2025-04-28 21:21:33,242 INFO  L79                 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 83
[2025-04-28 21:21:33,243 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,243 INFO  L485      AbstractCegarLoop]: Abstraction has 117 states and 130 transitions.
[2025-04-28 21:21:33,245 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (29), 2 states have call predecessors, (29), 11 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33)
[2025-04-28 21:21:33,245 INFO  L278                IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions.
[2025-04-28 21:21:33,247 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-04-28 21:21:33,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,247 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,255 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:33,448 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:33,448 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,449 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 850460760, now seen corresponding path program 2 times
[2025-04-28 21:21:33,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,449 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078828224]
[2025-04-28 21:21:33,449 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,493 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes.
[2025-04-28 21:21:33,552 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements.
[2025-04-28 21:21:33,552 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2025-04-28 21:21:34,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078828224]
[2025-04-28 21:21:34,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078828224] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967354488]
[2025-04-28 21:21:34,346 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:34,346 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,351 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,353 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:34,357 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,660 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes.
[2025-04-28 21:21:34,944 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements.
[2025-04-28 21:21:34,944 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:34,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,954 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,967 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:35,053 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2025-04-28 21:21:40,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967354488] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,667 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15
[2025-04-28 21:21:40,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217666161]
[2025-04-28 21:21:40,667 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,668 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:40,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,669 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:40,669 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:40,670 INFO  L87              Difference]: Start difference. First operand 117 states and 130 transitions. Second operand  has 15 states, 9 states have (on average 6.111111111111111) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (31), 2 states have call predecessors, (31), 9 states have return successors, (36), 9 states have call predecessors, (36), 10 states have call successors, (36)
[2025-04-28 21:21:40,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,835 INFO  L93              Difference]: Finished difference Result 125 states and 138 transitions.
[2025-04-28 21:21:40,836 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:40,836 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 9 states have (on average 6.111111111111111) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (31), 2 states have call predecessors, (31), 9 states have return successors, (36), 9 states have call predecessors, (36), 10 states have call successors, (36) Word has length 123
[2025-04-28 21:21:40,837 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,839 INFO  L225             Difference]: With dead ends: 125
[2025-04-28 21:21:40,843 INFO  L226             Difference]: Without dead ends: 125
[2025-04-28 21:21:40,843 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 241 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:40,844 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,844 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 986 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2025-04-28 21:21:40,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2025-04-28 21:21:40,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 27 states have call successors, (29), 22 states have call predecessors, (29), 40 states have return successors, (49), 42 states have call predecessors, (49), 27 states have call successors, (49)
[2025-04-28 21:21:40,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions.
[2025-04-28 21:21:40,866 INFO  L79                 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 123
[2025-04-28 21:21:40,866 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,866 INFO  L485      AbstractCegarLoop]: Abstraction has 125 states and 138 transitions.
[2025-04-28 21:21:40,867 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 9 states have (on average 6.111111111111111) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (31), 2 states have call predecessors, (31), 9 states have return successors, (36), 9 states have call predecessors, (36), 10 states have call successors, (36)
[2025-04-28 21:21:40,867 INFO  L278                IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions.
[2025-04-28 21:21:40,870 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-04-28 21:21:40,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,871 INFO  L218           NwaCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,879 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:41,075 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,075 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,076 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 40296054, now seen corresponding path program 1 times
[2025-04-28 21:21:41,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,076 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336535549]
[2025-04-28 21:21:41,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:41,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-04-28 21:21:41,165 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-04-28 21:21:41,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:41,166 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 178 backedges. 67 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2025-04-28 21:21:42,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:42,117 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336535549]
[2025-04-28 21:21:42,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336535549] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,118 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685429190]
[2025-04-28 21:21:42,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:42,118 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,120 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:42,122 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:42,127 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:42,484 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-04-28 21:21:42,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-04-28 21:21:42,755 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:42,755 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,766 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:42,772 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:42,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 178 backedges. 56 proven. 29 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:42,872 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:51,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 178 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-04-28 21:21:51,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685429190] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:51,504 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:51,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 18
[2025-04-28 21:21:51,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786687630]
[2025-04-28 21:21:51,505 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,506 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:51,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:51,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:51,507 INFO  L87              Difference]: Start difference. First operand 125 states and 138 transitions. Second operand  has 18 states, 11 states have (on average 5.545454545454546) internal successors, (61), 18 states have internal predecessors, (61), 11 states have call successors, (32), 2 states have call predecessors, (32), 11 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44)
[2025-04-28 21:21:51,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,665 INFO  L93              Difference]: Finished difference Result 133 states and 146 transitions.
[2025-04-28 21:21:51,666 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:51,667 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 11 states have (on average 5.545454545454546) internal successors, (61), 18 states have internal predecessors, (61), 11 states have call successors, (32), 2 states have call predecessors, (32), 11 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44) Word has length 139
[2025-04-28 21:21:51,667 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,669 INFO  L225             Difference]: With dead ends: 133
[2025-04-28 21:21:51,669 INFO  L226             Difference]: Without dead ends: 133
[2025-04-28 21:21:51,670 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 271 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:51,670 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,674 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 895 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-04-28 21:21:51,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-04-28 21:21:51,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 64 states have internal predecessors, (64), 27 states have call successors, (29), 22 states have call predecessors, (29), 44 states have return successors, (53), 46 states have call predecessors, (53), 27 states have call successors, (53)
[2025-04-28 21:21:51,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions.
[2025-04-28 21:21:51,693 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 139
[2025-04-28 21:21:51,693 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,694 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 146 transitions.
[2025-04-28 21:21:51,694 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 11 states have (on average 5.545454545454546) internal successors, (61), 18 states have internal predecessors, (61), 11 states have call successors, (32), 2 states have call predecessors, (32), 11 states have return successors, (44), 11 states have call predecessors, (44), 11 states have call successors, (44)
[2025-04-28 21:21:51,694 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions.
[2025-04-28 21:21:51,696 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2025-04-28 21:21:51,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,696 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,704 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:51,900 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,900 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,900 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -1262229032, now seen corresponding path program 3 times
[2025-04-28 21:21:51,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,901 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096239174]
[2025-04-28 21:21:51,901 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:51,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,940 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 7 equivalence classes.
[2025-04-28 21:21:52,054 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 147 of 155 statements.
[2025-04-28 21:21:52,054 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:52,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 294 backedges. 106 proven. 35 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2025-04-28 21:21:53,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,037 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096239174]
[2025-04-28 21:21:53,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096239174] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,037 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124251452]
[2025-04-28 21:21:53,037 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:53,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,040 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,042 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:53,045 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,508 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 7 equivalence classes.
[2025-04-28 21:21:53,830 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 147 of 155 statements.
[2025-04-28 21:21:53,831 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2025-04-28 21:21:53,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,841 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,846 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:53,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 294 backedges. 106 proven. 32 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-04-28 21:21:53,932 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
