./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/float-benchs/interpolation.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:59:42,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:59:42,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:59:42,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:59:42,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:59:42,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:59:42,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:59:42,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:59:42,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:59:42,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:59:42,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:59:42,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:59:42,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:59:42,259 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:59:42,259 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:59:42,259 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:59:42,259 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:59:42,260 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:59:42,260 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:59:42,260 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:59:42,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:59:42,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:59:42,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:59:42,261 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:59:42,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:59:42,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:59:42,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:59:42,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:59:42,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:59:42,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:59:42,263 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:59:42,264 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/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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-03-04 15:59:42,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:59:42,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:59:42,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:59:42,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:59:42,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:59:42,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-03-04 15:59:43,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b5e973c/bf4a48998f06453e9e7425c4cb9c1db8/FLAGcc751fb3d [2025-03-04 15:59:43,868 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:59:43,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-03-04 15:59:43,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b5e973c/bf4a48998f06453e9e7425c4cb9c1db8/FLAGcc751fb3d [2025-03-04 15:59:43,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b5e973c/bf4a48998f06453e9e7425c4cb9c1db8 [2025-03-04 15:59:43,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:59:43,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:59:43,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:59:43,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:59:43,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:59:43,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:59:43" (1/1) ... [2025-03-04 15:59:43,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:43, skipping insertion in model container [2025-03-04 15:59:43,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:59:43" (1/1) ... [2025-03-04 15:59:43,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:59:44,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:59:44,023 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:59:44,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:59:44,050 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:59:44,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44 WrapperNode [2025-03-04 15:59:44,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:59:44,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:59:44,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:59:44,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:59:44,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,069 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-04 15:59:44,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:59:44,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:59:44,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:59:44,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:59:44,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,082 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 15:59:44,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:59:44,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:59:44,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:59:44,089 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:59:44,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (1/1) ... [2025-03-04 15:59:44,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:44,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:44,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:59:44,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:59:44,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:59:44,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 15:59:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:59:44,187 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:59:44,188 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:59:44,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#min~0#1.base, main_~#min~0#1.offset);havoc main_~#min~0#1.base, main_~#min~0#1.offset;call ULTIMATE.dealloc(main_~#max~0#1.base, main_~#max~0#1.offset);havoc main_~#max~0#1.base, main_~#max~0#1.offset; [2025-03-04 15:59:44,298 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 15:59:44,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:59:44,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:59:44,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:59:44,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:44 BoogieIcfgContainer [2025-03-04 15:59:44,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:59:44,306 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:59:44,306 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:59:44,310 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:59:44,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:59:44,311 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:59:43" (1/3) ... [2025-03-04 15:59:44,312 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29db3bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:59:44, skipping insertion in model container [2025-03-04 15:59:44,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:59:44,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:59:44" (2/3) ... [2025-03-04 15:59:44,313 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29db3bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:59:44, skipping insertion in model container [2025-03-04 15:59:44,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:59:44,313 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:44" (3/3) ... [2025-03-04 15:59:44,314 INFO L363 chiAutomizerObserver]: Analyzing ICFG interpolation.c [2025-03-04 15:59:44,349 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:59:44,349 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:59:44,349 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:59:44,349 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:59:44,349 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:59:44,349 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:59:44,349 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:59:44,350 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:59:44,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-03-04 15:59:44,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:59:44,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:59:44,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:59:44,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:59:44,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:59:44,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:59:44,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-03-04 15:59:44,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:59:44,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:59:44,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:59:44,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:59:44,374 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:59:44,379 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(16, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real#1(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(150), main_~#min~0#1.base, 16 + main_~#min~0#1.offset, 4);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real#2(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(300), main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);havoc main_#t~nondet4#1;main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~real#1(main_~#min~0#1.base, main_~#min~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem5#1);" "assume !main_#t~short7#1;" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0;" [2025-03-04 15:59:44,379 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < 5;call main_#t~mem8#1 := read~real#2(main_~#max~0#1.base, main_~#max~0#1.offset + 4 * main_~i~0#1, 4);" "assume !~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem8#1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 15:59:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936060, now seen corresponding path program 1 times [2025-03-04 15:59:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:59:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566478820] [2025-03-04 15:59:44,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:59:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:59:44,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:59:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:59:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:59:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:59:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:59:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566478820] [2025-03-04 15:59:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566478820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:59:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:59:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:59:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105231356] [2025-03-04 15:59:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:59:44,632 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:59:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-03-04 15:59:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:59:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995998168] [2025-03-04 15:59:44,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:59:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:59:44,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:59:44,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:59:44,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:59:44,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:59:44,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:59:44,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:59:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:59:44,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:59:44,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:59:44,751 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 4 states, 4 states have (on average 1.5) 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-03-04 15:59:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:59:44,770 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-04 15:59:44,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-03-04 15:59:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:59:44,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 8 transitions. [2025-03-04 15:59:44,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:59:44,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:59:44,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 8 transitions. [2025-03-04 15:59:44,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:59:44,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-04 15:59:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 8 transitions. [2025-03-04 15:59:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 15:59:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.0) internal successors, (8), 7 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-03-04 15:59:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-04 15:59:44,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-04 15:59:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:59:44,799 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-04 15:59:44,799 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:59:44,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2025-03-04 15:59:44,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:59:44,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:59:44,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:59:44,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:59:44,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:59:44,800 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(16, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real#1(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(150), main_~#min~0#1.base, 16 + main_~#min~0#1.offset, 4);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real#2(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(300), main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);havoc main_#t~nondet4#1;main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~real#1(main_~#min~0#1.base, main_~#min~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem5#1);" "assume main_#t~short7#1;call main_#t~mem6#1 := read~real#2(main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem6#1);" "assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0;" [2025-03-04 15:59:44,800 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < 5;call main_#t~mem8#1 := read~real#2(main_~#max~0#1.base, main_~#max~0#1.offset + 4 * main_~i~0#1, 4);" "assume !~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem8#1);havoc main_#t~mem8#1;main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1;" [2025-03-04 15:59:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1566906269, now seen corresponding path program 1 times [2025-03-04 15:59:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:59:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-03-04 15:59:44,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:59:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:59:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:59:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:59:44,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:59:44,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:59:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:59:44,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:59:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 2 times [2025-03-04 15:59:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:59:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410988497] [2025-03-04 15:59:44,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:59:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:59:44,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:59:44,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:59:44,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:59:44,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:59:44,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:59:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:59:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:59:44,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1736595940, now seen corresponding path program 1 times [2025-03-04 15:59:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:59:44,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853369891] [2025-03-04 15:59:44,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:59:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:59:44,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:59:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:59:44,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:59:44,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:59:44,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:59:44,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:59:44,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:59:45,307 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:59:45,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:59:45,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:59:45,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:59:45,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:59:45,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:59:45,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:59:45,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: interpolation.c_Iteration2_Lasso [2025-03-04 15:59:45,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:59:45,309 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:59:45,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:59:45,802 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:59:45,805 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:59:45,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:59:45,811 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-03-04 15:59:45,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:59:45,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:59:45,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:59:45,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:59:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:59:45,846 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-03-04 15:59:45,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:59:45,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:59:45,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:59:45,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:59:45,875 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-03-04 15:59:45,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:59:45,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:59:45,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:59:45,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:59:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:59:45,899 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-03-04 15:59:45,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:59:45,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:59:45,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:59:45,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:59:45,928 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-03-04 15:59:45,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:59:45,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:59:45,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:59:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:59:45,959 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-03-04 15:59:45,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:59:45,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:59:45,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:59:45,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:59:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:45,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:45,983 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:45,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:59:45,984 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-03-04 15:59:45,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:59:45,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:59:45,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:59:45,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:59:45,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:59:45,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:59:46,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:59:46,024 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:59:46,027 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-04 15:59:46,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:59:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:59:46,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:59:46,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:59:46,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:59:46,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:59:46,046 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:59:46,046 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#max~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#max~0#1.base)_1) = -1*ULTIMATE.start_main_~#max~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#max~0#1.base)_1 Supporting invariants [] [2025-03-04 15:59:46,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:59:46,072 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:59:46,082 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#max~0!offset [2025-03-04 15:59:46,083 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:59:46,083 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:59:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:59:46,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:59:46,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:59:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:59:46,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:59:46,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:59:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:59:46,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:59:46,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:59:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:59:46,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:59:46,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:59:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:59:46,144 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:59:46,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03-04 15:59:46,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 8 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 10 states and 11 transitions. Complement of second has 4 states. [2025-03-04 15:59:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:59:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03-04 15:59:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:59:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:59:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:59:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 15:59:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:59:46,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:59:46,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:59:46,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-03-04 15:59:46,192 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:59:46,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2025-03-04 15:59:46,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:59:46,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:59:46,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:59:46,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:59:46,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:59:46,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:59:46,192 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:59:46,193 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:59:46,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:59:46,193 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:59:46,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:59:46,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:59:46 BoogieIcfgContainer [2025-03-04 15:59:46,198 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:59:46,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:59:46,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:59:46,198 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:59:46,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:44" (3/4) ... [2025-03-04 15:59:46,200 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:59:46,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:59:46,201 INFO L158 Benchmark]: Toolchain (without parser) took 2304.92ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 81.4MB in the end (delta: 31.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-04 15:59:46,201 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:59:46,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.33ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:59:46,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.41ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 973.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:59:46,202 INFO L158 Benchmark]: Boogie Preprocessor took 18.71ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:59:46,202 INFO L158 Benchmark]: IcfgBuilder took 216.14ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:59:46,202 INFO L158 Benchmark]: BuchiAutomizer took 1892.10ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 81.4MB in the end (delta: 4.9MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-03-04 15:59:46,202 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:59:46,204 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.33ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 101.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.41ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 973.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.71ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 216.14ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 86.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1892.10ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 81.4MB in the end (delta: 4.9MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#max~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * 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). One deterministic module has affine ranking function null and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 23 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp86 ukn86 mio100 lsp34 div202 bol100 ite100 ukn100 eq146 hnf94 smp64 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:59:46,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:59:46,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE