./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-lit/mine2017-ex4.8.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:35:13,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:35:13,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:35:13,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:35:13,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:35:13,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:35:13,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:35:13,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:35:13,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:35:13,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:35:13,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:35:13,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:35:13,688 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:35:13,688 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:35:13,688 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:35:13,688 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:35:13,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:35:13,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:35:13,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:35:13,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:35:13,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:35:13,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:35:13,691 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:35:13,691 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 [2025-01-10 07:35:13,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:35:14,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:35:14,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:35:14,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:35:14,007 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:35:14,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2025-01-10 07:35:15,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6bc9c1e/1e770e92cb674647b33ec73b1952c018/FLAG92892fd7c [2025-01-10 07:35:15,560 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:35:15,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2025-01-10 07:35:15,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6bc9c1e/1e770e92cb674647b33ec73b1952c018/FLAG92892fd7c [2025-01-10 07:35:15,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6bc9c1e/1e770e92cb674647b33ec73b1952c018 [2025-01-10 07:35:15,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:35:15,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:35:15,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:15,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:35:15,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:35:15,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:15" (1/1) ... [2025-01-10 07:35:15,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31956f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:15, skipping insertion in model container [2025-01-10 07:35:15,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:15" (1/1) ... [2025-01-10 07:35:15,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:35:16,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:16,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:35:16,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:16,066 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:35:16,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16 WrapperNode [2025-01-10 07:35:16,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:16,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:16,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:35:16,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:35:16,073 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:35:16" (1/1) ... [2025-01-10 07:35:16,079 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:35:16" (1/1) ... [2025-01-10 07:35:16,089 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 36 [2025-01-10 07:35:16,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:16,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:35:16,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:35:16,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:35:16,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 07:35:16,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:35:16,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:35:16,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:35:16,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:35:16,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (1/1) ... [2025-01-10 07:35:16,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,145 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:35:16,149 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:35:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:35:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:35:16,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:35:16,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:35:16,226 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:35:16,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:35:16,323 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-10 07:35:16,324 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:35:16,332 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:35:16,333 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:35:16,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:16 BoogieIcfgContainer [2025-01-10 07:35:16,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:35:16,334 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:35:16,334 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:35:16,339 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:35:16,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:16,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:35:15" (1/3) ... [2025-01-10 07:35:16,341 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eaa6a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:16, skipping insertion in model container [2025-01-10 07:35:16,341 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:16,341 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:16" (2/3) ... [2025-01-10 07:35:16,342 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eaa6a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:16, skipping insertion in model container [2025-01-10 07:35:16,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:16,342 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:16" (3/3) ... [2025-01-10 07:35:16,343 INFO L363 chiAutomizerObserver]: Analyzing ICFG mine2017-ex4.8.i [2025-01-10 07:35:16,387 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:35:16,388 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:35:16,388 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:35:16,388 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:35:16,388 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:35:16,389 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:35:16,389 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:35:16,389 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:35:16,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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:35:16,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-01-10 07:35:16,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:16,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:16,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:16,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:35:16,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:35:16,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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:35:16,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2025-01-10 07:35:16,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:16,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:16,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:16,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:35:16,426 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" [2025-01-10 07:35:16,426 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume 0 == main_~v~0#1;main_~v~0#1 := 1;" [2025-01-10 07:35:16,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:16,432 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:35:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021673853] [2025-01-10 07:35:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:16,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:16,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash -144907773, now seen corresponding path program 1 times [2025-01-10 07:35:16,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:16,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447271768] [2025-01-10 07:35:16,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:16,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:16,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:16,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:16,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:16,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash 545653701, now seen corresponding path program 1 times [2025-01-10 07:35:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300570656] [2025-01-10 07:35:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:16,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:16,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:16,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:16,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:16,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:16,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:16,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:16,780 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:16,780 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:16,780 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:16,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:16,781 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:16,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:16,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:16,782 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2025-01-10 07:35:16,785 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:16,785 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:16,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:16,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:16,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:16,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:16,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:16,864 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:16,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,870 INFO L229 MonitoredProcess]: Starting monitored process 2 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:35:16,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:35:16,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:16,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:16,889 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:35:16,889 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:35:16,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:35:16,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,903 INFO L229 MonitoredProcess]: Starting monitored process 3 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:35:16,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:35:16,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:16,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:16,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:35:16,928 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:35:16,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:35:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,939 INFO L229 MonitoredProcess]: Starting monitored process 4 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:35:16,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:35:16,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:16,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:16,953 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:35:16,953 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:35:16,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:35:16,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,962 INFO L229 MonitoredProcess]: Starting monitored process 5 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:35:16,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:35:16,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:16,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:16,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:16,984 INFO L229 MonitoredProcess]: Starting monitored process 6 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:35:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:35:16,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:16,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:16,999 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:17,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:35:17,008 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:17,008 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:17,008 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:17,008 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:17,008 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:17,008 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,008 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:17,008 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:17,008 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2025-01-10 07:35:17,008 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:17,008 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:17,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:17,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:17,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:17,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:17,052 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:17,056 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:17,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:17,060 INFO L229 MonitoredProcess]: Starting monitored process 7 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:35:17,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:35:17,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:35:17,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:17,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:17,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:17,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:17,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:17,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:17,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:17,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:17,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:35:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:17,095 INFO L229 MonitoredProcess]: Starting monitored process 8 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:35:17,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:35:17,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:35:17,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:17,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:17,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:17,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:17,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:17,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:17,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:17,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:17,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:35:17,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:17,120 INFO L229 MonitoredProcess]: Starting monitored process 9 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:35:17,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:35:17,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:35:17,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:17,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:17,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:17,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:17,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:17,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:17,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:17,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:17,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:17,145 INFO L229 MonitoredProcess]: Starting monitored process 10 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:35:17,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:35:17,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:35:17,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:17,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:17,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:17,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:17,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:17,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:17,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:17,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:17,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:17,165 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:17,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:17,169 INFO L229 MonitoredProcess]: Starting monitored process 11 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:35:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:35:17,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:17,172 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:17,172 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:17,172 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v~0#1) = -2*ULTIMATE.start_main_~v~0#1 + 1 Supporting invariants [] [2025-01-10 07:35:17,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:35:17,183 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:17,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:17,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:17,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:17,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:17,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:17,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:17,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:17,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:17,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:17,280 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:35:17,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:17,310 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:35:17,350 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Result 53 states and 70 transitions. Complement of second has 6 states. [2025-01-10 07:35:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:35:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-01-10 07:35:17,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 2 letters. Loop has 8 letters. [2025-01-10 07:35:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 10 letters. Loop has 8 letters. [2025-01-10 07:35:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 2 letters. Loop has 16 letters. [2025-01-10 07:35:17,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:17,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 70 transitions. [2025-01-10 07:35:17,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:17,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 21 states and 24 transitions. [2025-01-10 07:35:17,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:35:17,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:35:17,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2025-01-10 07:35:17,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:17,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 07:35:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2025-01-10 07:35:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-01-10 07:35:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 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:35:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-01-10 07:35:17,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-01-10 07:35:17,405 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-01-10 07:35:17,405 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:35:17,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2025-01-10 07:35:17,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:17,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:17,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:17,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:35:17,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:35:17,406 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-01-10 07:35:17,406 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-01-10 07:35:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:35:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870869885] [2025-01-10 07:35:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:17,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:35:17,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:17,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:17,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:17,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:17,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 446677629, now seen corresponding path program 1 times [2025-01-10 07:35:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273622490] [2025-01-10 07:35:17,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:17,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:17,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:17,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:17,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash -264604385, now seen corresponding path program 1 times [2025-01-10 07:35:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024606736] [2025-01-10 07:35:17,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:17,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:17,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:17,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024606736] [2025-01-10 07:35:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024606736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:35:17,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:35:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:35:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778049651] [2025-01-10 07:35:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:35:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:17,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:35:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:35:17,648 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:35:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:17,662 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-01-10 07:35:17,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2025-01-10 07:35:17,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:17,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 29 transitions. [2025-01-10 07:35:17,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:35:17,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:35:17,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2025-01-10 07:35:17,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:17,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 07:35:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2025-01-10 07:35:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-10 07:35:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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:35:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-10 07:35:17,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 07:35:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:35:17,669 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-10 07:35:17,670 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:35:17,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2025-01-10 07:35:17,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-01-10 07:35:17,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:17,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:17,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:35:17,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:35:17,671 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume 0 == main_~v~0#1;main_~v~0#1 := 1;" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-01-10 07:35:17,671 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;" "assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" "havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-01-10 07:35:17,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -264604447, now seen corresponding path program 2 times [2025-01-10 07:35:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544900057] [2025-01-10 07:35:17,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:35:17,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:17,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:17,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:17,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:17,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:17,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:17,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash 446677629, now seen corresponding path program 2 times [2025-01-10 07:35:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865859561] [2025-01-10 07:35:17,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:17,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:17,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:35:17,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:17,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:35:17,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:35:17,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -284731555, now seen corresponding path program 1 times [2025-01-10 07:35:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092780322] [2025-01-10 07:35:17,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:17,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:35:17,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:35:17,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:17,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:35:17,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:35:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:17,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:18,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:18,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:18,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:18,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:18,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:35:18,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:35:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:18,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:35:18 BoogieIcfgContainer [2025-01-10 07:35:18,054 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:35:18,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:35:18,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:35:18,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:35:18,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:16" (3/4) ... [2025-01-10 07:35:18,057 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:35:18,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:35:18,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:35:18,083 INFO L158 Benchmark]: Toolchain (without parser) took 2199.93ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 64.1MB in the end (delta: 49.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-01-10 07:35:18,084 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:18,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.52ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:35:18,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.37ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 972.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:18,085 INFO L158 Benchmark]: Boogie Preprocessor took 21.45ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:18,085 INFO L158 Benchmark]: RCFGBuilder took 221.41ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 91.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:35:18,085 INFO L158 Benchmark]: BuchiAutomizer took 1720.03ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 67.6MB in the end (delta: 23.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-01-10 07:35:18,086 INFO L158 Benchmark]: Witness Printer took 27.41ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 64.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:18,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.52ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.37ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 972.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.45ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.41ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 91.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1720.03ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 67.6MB in the end (delta: 23.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 27.41ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 64.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -2 * v) + 1) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 22 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:35:18,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)