./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:01:25,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:01:25,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:01:25,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:01:25,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:01:25,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:01:25,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:01:25,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:01:25,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:01:25,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:01:25,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:01:25,783 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:01:25,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:01:25,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:01:25,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:01:25,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:01:25,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:01:25,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:01:25,784 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:01:25,784 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 [2025-01-10 07:01:26,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:01:26,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:01:26,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:01:26,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:01:26,020 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:01:26,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-01-10 07:01:27,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11b8d577/c58fa3f5eb8d41169f70a008cc3b0585/FLAG8397f2a6d [2025-01-10 07:01:27,442 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:01:27,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2025-01-10 07:01:27,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11b8d577/c58fa3f5eb8d41169f70a008cc3b0585/FLAG8397f2a6d [2025-01-10 07:01:27,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11b8d577/c58fa3f5eb8d41169f70a008cc3b0585 [2025-01-10 07:01:27,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:01:27,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:01:27,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:27,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:01:27,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:01:27,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fada8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27, skipping insertion in model container [2025-01-10 07:01:27,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:01:27,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:27,902 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:01:27,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:01:27,919 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:01:27,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27 WrapperNode [2025-01-10 07:01:27,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:01:27,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:27,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:01:27,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:01:27,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,937 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2025-01-10 07:01:27,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:01:27,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:01:27,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:01:27,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:01:27,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,949 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:01:27,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:01:27,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:01:27,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:01:27,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:01:27,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (1/1) ... [2025-01-10 07:01:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:01:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:27,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:01:27,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:01:28,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:01:28,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:01:28,051 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:01:28,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:01:28,093 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-10 07:01:28,094 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:01:28,100 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:01:28,102 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:01:28,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:28 BoogieIcfgContainer [2025-01-10 07:01:28,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:01:28,103 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:01:28,103 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:01:28,107 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:01:28,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:28,108 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:01:27" (1/3) ... [2025-01-10 07:01:28,109 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@692707f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:28, skipping insertion in model container [2025-01-10 07:01:28,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:28,110 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:01:27" (2/3) ... [2025-01-10 07:01:28,110 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@692707f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:01:28, skipping insertion in model container [2025-01-10 07:01:28,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:01:28,110 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:01:28" (3/3) ... [2025-01-10 07:01:28,112 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2025-01-10 07:01:28,155 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:01:28,156 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:01:28,156 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:01:28,156 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:01:28,156 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:01:28,157 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:01:28,157 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:01:28,157 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:01:28,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:01:28,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:28,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:28,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:28,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:01:28,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:01:28,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:01:28,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:28,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:28,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:28,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:01:28,180 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:28,181 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:01:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355130923] [2025-01-10 07:01:28,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:28,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1159, now seen corresponding path program 1 times [2025-01-10 07:01:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250788747] [2025-01-10 07:01:28,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250788747] [2025-01-10 07:01:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250788747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:01:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:01:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:01:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605608171] [2025-01-10 07:01:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:01:28,317 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:28,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:01:28,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:01:28,337 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:28,359 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-01-10 07:01:28,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-01-10 07:01:28,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:01:28,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 5 states and 6 transitions. [2025-01-10 07:01:28,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:01:28,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:01:28,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2025-01-10 07:01:28,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:28,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:01:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2025-01-10 07:01:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2025-01-10 07:01:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-01-10 07:01:28,379 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:01:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:01:28,382 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-01-10 07:01:28,383 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:01:28,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-01-10 07:01:28,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:01:28,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:28,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:28,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:28,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:01:28,384 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:28,384 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:28,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:01:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058767812] [2025-01-10 07:01:28,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:28,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:28,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:28,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 35879, now seen corresponding path program 1 times [2025-01-10 07:01:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043267288] [2025-01-10 07:01:28,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:28,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:28,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:28,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043267288] [2025-01-10 07:01:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043267288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460207346] [2025-01-10 07:01:28,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:01:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:28,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:28,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:01:28,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:01:28,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:01:28,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:28,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:01:28,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460207346] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:28,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-01-10 07:01:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663354951] [2025-01-10 07:01:28,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:28,486 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:01:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:01:28,487 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:28,510 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2025-01-10 07:01:28,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2025-01-10 07:01:28,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:01:28,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:01:28,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:01:28,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:01:28,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-01-10 07:01:28,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:28,511 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:01:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-01-10 07:01:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:01:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:01:28,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:01:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:01:28,514 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:01:28,515 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:01:28,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-01-10 07:01:28,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:01:28,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:28,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:28,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:28,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 1, 1] [2025-01-10 07:01:28,516 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:28,516 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:28,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2025-01-10 07:01:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964604943] [2025-01-10 07:01:28,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:01:28,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:28,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1068821639, now seen corresponding path program 2 times [2025-01-10 07:01:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545860563] [2025-01-10 07:01:28,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:01:28,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:28,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545860563] [2025-01-10 07:01:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545860563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577568525] [2025-01-10 07:01:28,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:28,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:28,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:28,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:01:28,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:01:28,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:01:28,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:01:28,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:28,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:01:28,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577568525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:28,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:28,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 07:01:28,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339820217] [2025-01-10 07:01:28,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:28,770 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:28,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 07:01:28,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 07:01:28,770 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:28,799 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-01-10 07:01:28,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2025-01-10 07:01:28,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-01-10 07:01:28,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 07:01:28,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-01-10 07:01:28,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-01-10 07:01:28,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2025-01-10 07:01:28,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:28,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 07:01:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2025-01-10 07:01:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 07:01:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 07:01:28,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 07:01:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:01:28,804 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 07:01:28,804 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:01:28,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2025-01-10 07:01:28,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-01-10 07:01:28,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:28,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:28,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:28,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 1, 1] [2025-01-10 07:01:28,805 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:28,805 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2025-01-10 07:01:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953415837] [2025-01-10 07:01:28,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:01:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:01:28,811 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,811 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:01:28,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:28,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:28,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:28,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:28,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:28,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1955776647, now seen corresponding path program 3 times [2025-01-10 07:01:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216171453] [2025-01-10 07:01:28,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:28,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-01-10 07:01:28,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:01:28,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:01:28,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:29,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216171453] [2025-01-10 07:01:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216171453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813937057] [2025-01-10 07:01:29,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:01:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:29,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:29,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 07:01:29,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-01-10 07:01:29,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:01:29,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:01:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:29,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:01:29,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:29,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813937057] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:29,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-01-10 07:01:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429873731] [2025-01-10 07:01:29,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:29,284 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:29,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 07:01:29,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 07:01:29,285 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 2 Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:29,338 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-01-10 07:01:29,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2025-01-10 07:01:29,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-01-10 07:01:29,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2025-01-10 07:01:29,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-01-10 07:01:29,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-01-10 07:01:29,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2025-01-10 07:01:29,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:29,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-01-10 07:01:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2025-01-10 07:01:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-10 07:01:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-01-10 07:01:29,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-01-10 07:01:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:01:29,341 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-01-10 07:01:29,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:01:29,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2025-01-10 07:01:29,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-01-10 07:01:29,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:29,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:29,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:29,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 1, 1] [2025-01-10 07:01:29,343 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:29,343 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2025-01-10 07:01:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014943740] [2025-01-10 07:01:29,343 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:01:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:29,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:29,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:29,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:29,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:29,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:29,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:29,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:29,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:29,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:29,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 361726087, now seen corresponding path program 4 times [2025-01-10 07:01:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502121036] [2025-01-10 07:01:29,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:01:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:29,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-10 07:01:29,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:01:29,379 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:01:29,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502121036] [2025-01-10 07:01:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502121036] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738534677] [2025-01-10 07:01:29,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:01:29,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:29,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:29,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 07:01:29,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-10 07:01:29,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:01:29,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:01:29,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:29,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:01:29,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:29,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:30,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738534677] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:30,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:30,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-01-10 07:01:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039933865] [2025-01-10 07:01:30,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:30,534 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:30,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 07:01:30,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 07:01:30,536 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 2 Second operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:30,609 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-01-10 07:01:30,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2025-01-10 07:01:30,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-01-10 07:01:30,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2025-01-10 07:01:30,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-01-10 07:01:30,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-01-10 07:01:30,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2025-01-10 07:01:30,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:30,611 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-01-10 07:01:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2025-01-10 07:01:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 07:01:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-01-10 07:01:30,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-01-10 07:01:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:01:30,617 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-01-10 07:01:30,617 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:01:30,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2025-01-10 07:01:30,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2025-01-10 07:01:30,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:30,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:30,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:30,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [46, 1, 1] [2025-01-10 07:01:30,619 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:30,619 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:30,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2025-01-10 07:01:30,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:30,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276689869] [2025-01-10 07:01:30,619 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:01:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:30,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:30,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:30,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:01:30,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:30,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:30,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:30,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:30,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:30,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:30,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1837953159, now seen corresponding path program 5 times [2025-01-10 07:01:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951476356] [2025-01-10 07:01:30,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:01:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:30,631 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-01-10 07:01:30,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:01:30,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:01:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951476356] [2025-01-10 07:01:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951476356] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702562475] [2025-01-10 07:01:31,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:01:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:31,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 07:01:31,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 24 equivalence classes. [2025-01-10 07:01:31,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:01:31,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:01:31,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:31,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:01:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:31,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702562475] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:33,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-01-10 07:01:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765088586] [2025-01-10 07:01:33,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:33,875 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:33,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 07:01:33,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 07:01:33,879 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 2 Second operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:33,988 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2025-01-10 07:01:33,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2025-01-10 07:01:33,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-01-10 07:01:33,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2025-01-10 07:01:33,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-01-10 07:01:33,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-01-10 07:01:33,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2025-01-10 07:01:33,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:33,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-01-10 07:01:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2025-01-10 07:01:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-10 07:01:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2025-01-10 07:01:33,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-01-10 07:01:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 07:01:33,994 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2025-01-10 07:01:33,994 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:01:33,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2025-01-10 07:01:33,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2025-01-10 07:01:33,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:33,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:33,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:33,996 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 1, 1] [2025-01-10 07:01:33,996 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:33,996 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:33,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2025-01-10 07:01:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420192917] [2025-01-10 07:01:33,997 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:01:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:33,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:33,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:33,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:34,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1114124153, now seen corresponding path program 6 times [2025-01-10 07:01:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007248810] [2025-01-10 07:01:34,000 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:01:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:34,006 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-01-10 07:01:34,058 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 07:01:34,058 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-01-10 07:01:34,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:37,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007248810] [2025-01-10 07:01:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007248810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378060344] [2025-01-10 07:01:37,369 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:01:37,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:37,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:37,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 07:01:37,395 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 96 statements into 48 equivalence classes. [2025-01-10 07:01:37,430 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 07:01:37,430 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-01-10 07:01:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:37,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 07:01:37,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:37,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:01:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378060344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:01:44,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:01:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-01-10 07:01:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207369627] [2025-01-10 07:01:44,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:01:44,328 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:01:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:01:44,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 07:01:44,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 07:01:44,337 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 2 Second operand has 192 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:01:44,591 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2025-01-10 07:01:44,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2025-01-10 07:01:44,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-01-10 07:01:44,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2025-01-10 07:01:44,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2025-01-10 07:01:44,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2025-01-10 07:01:44,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2025-01-10 07:01:44,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:01:44,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-01-10 07:01:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2025-01-10 07:01:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-10 07:01:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:01:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2025-01-10 07:01:44,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-01-10 07:01:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 07:01:44,601 INFO L432 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2025-01-10 07:01:44,601 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:01:44,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2025-01-10 07:01:44,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 192 [2025-01-10 07:01:44,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:01:44,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:01:44,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:01:44,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [190, 1, 1] [2025-01-10 07:01:44,603 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:01:44,603 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:01:44,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2025-01-10 07:01:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:44,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156945685] [2025-01-10 07:01:44,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:01:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:44,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:44,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:44,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:01:44,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:01:44,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:01:44,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:01:44,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:01:44,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:01:44,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:01:44,611 INFO L85 PathProgramCache]: Analyzing trace with hash 502108295, now seen corresponding path program 7 times [2025-01-10 07:01:44,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:01:44,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479561275] [2025-01-10 07:01:44,611 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:01:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:01:44,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 07:01:44,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 07:01:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:01:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479561275] [2025-01-10 07:01:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479561275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:01:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512610639] [2025-01-10 07:01:56,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:01:56,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:01:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:01:56,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:01:56,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 07:01:56,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 07:01:56,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 07:01:56,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:01:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:01:56,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 07:01:56,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:01:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:01:56,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512610639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:23,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-01-10 07:02:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128550206] [2025-01-10 07:02:23,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:23,471 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:02:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:23,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 07:02:23,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 07:02:23,492 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. cyclomatic complexity: 2 Second operand has 384 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:24,748 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2025-01-10 07:02:24,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 387 transitions. [2025-01-10 07:02:24,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-01-10 07:02:24,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 387 transitions. [2025-01-10 07:02:24,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2025-01-10 07:02:24,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2025-01-10 07:02:24,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 387 transitions. [2025-01-10 07:02:24,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:02:24,753 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-01-10 07:02:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 387 transitions. [2025-01-10 07:02:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-01-10 07:02:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.0025906735751295) internal successors, (387), 385 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2025-01-10 07:02:24,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-01-10 07:02:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-01-10 07:02:24,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 386 states and 387 transitions. [2025-01-10 07:02:24,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:02:24,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 387 transitions. [2025-01-10 07:02:24,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 384 [2025-01-10 07:02:24,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:24,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:24,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:24,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [382, 1, 1] [2025-01-10 07:02:24,772 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-01-10 07:02:24,772 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);main_~x1~0#1 := 1 + main_~x1~0#1;" [2025-01-10 07:02:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2025-01-10 07:02:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432378983] [2025-01-10 07:02:24,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:02:24,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:24,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:24,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:24,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:24,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -543616889, now seen corresponding path program 8 times [2025-01-10 07:02:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334411568] [2025-01-10 07:02:24,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:24,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 384 statements into 2 equivalence classes. [2025-01-10 07:02:25,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 384 of 384 statements. [2025-01-10 07:02:25,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:25,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat