./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 48c9605d 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/float-benchs/interpolation.c -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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:34:54,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:34:54,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:34:54,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:34:54,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:34:54,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:34:54,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:34:54,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:34:54,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:34:54,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:34:54,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:34:54,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:34:54,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:34:54,252 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:34:54,252 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:34:54,252 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:34:54,252 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:34:54,252 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:34:54,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:34:54,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:34:54,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:34:54,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:34:54,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:34:54,255 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:34:54,255 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-02-08 14:34:54,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:34:54,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:34:54,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:34:54,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:34:54,559 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:34:54,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-02-08 14:34:55,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c06bd6bd/6e1b535209874e499644e56610e6100d/FLAGcbc612160 [2025-02-08 14:34:56,024 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:34:56,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-02-08 14:34:56,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c06bd6bd/6e1b535209874e499644e56610e6100d/FLAGcbc612160 [2025-02-08 14:34:56,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c06bd6bd/6e1b535209874e499644e56610e6100d [2025-02-08 14:34:56,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:34:56,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:34:56,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:34:56,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:34:56,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:34:56,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa6ef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56, skipping insertion in model container [2025-02-08 14:34:56,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:34:56,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:34:56,192 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:34:56,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:34:56,216 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:34:56,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56 WrapperNode [2025-02-08 14:34:56,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:34:56,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:34:56,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:34:56,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:34:56,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,245 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-02-08 14:34:56,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:34:56,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:34:56,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:34:56,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:34:56,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,261 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-02-08 14:34:56,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:34:56,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:34:56,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:34:56,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:34:56,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (1/1) ... [2025-02-08 14:34:56,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:56,310 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-02-08 14:34:56,316 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-02-08 14:34:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:34:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:34:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:34:56,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-08 14:34:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:34:56,393 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:34:56,395 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:34:56,517 INFO L1324 $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-02-08 14:34:56,528 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-08 14:34:56,528 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:34:56,536 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:34:56,536 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:34:56,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:34:56 BoogieIcfgContainer [2025-02-08 14:34:56,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:34:56,537 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:34:56,537 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:34:56,541 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:34:56,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:34:56,542 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:34:56" (1/3) ... [2025-02-08 14:34:56,542 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530fd67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:34:56, skipping insertion in model container [2025-02-08 14:34:56,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:34:56,543 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:34:56" (2/3) ... [2025-02-08 14:34:56,543 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@530fd67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:34:56, skipping insertion in model container [2025-02-08 14:34:56,543 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:34:56,543 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:34:56" (3/3) ... [2025-02-08 14:34:56,543 INFO L363 chiAutomizerObserver]: Analyzing ICFG interpolation.c [2025-02-08 14:34:56,574 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:34:56,574 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:34:56,574 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:34:56,574 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:34:56,574 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:34:56,574 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:34:56,574 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:34:56,575 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:34:56,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-02-08 14:34:56,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:34:56,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:34:56,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:34:56,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:34:56,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:34:56,590 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:34:56,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-02-08 14:34:56,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:34:56,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:34:56,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:34:56,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:34:56,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:34:56,595 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#2(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real#2(~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#1(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real#1(~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#2(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-02-08 14:34:56,595 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < 5;call main_#t~mem8#1 := read~real#1(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-02-08 14:34:56,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash 46728142, now seen corresponding path program 1 times [2025-02-08 14:34:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:34:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417592077] [2025-02-08 14:34:56,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:34:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:34:56,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:34:56,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:34:56,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:34:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:34:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:34:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417592077] [2025-02-08 14:34:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417592077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:34:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:34:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:34:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556612083] [2025-02-08 14:34:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:34:56,812 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:34:56,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-02-08 14:34:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:34:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326563049] [2025-02-08 14:34:56,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:34:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:34:56,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:34:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:34:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:56,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:34:56,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:34:56,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:34:56,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:56,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:56,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:34:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:34:56,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:34:56,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:34:56,964 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-02-08 14:34:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:34:56,987 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-02-08 14:34:56,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2025-02-08 14:34:56,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:34:56,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 7 transitions. [2025-02-08 14:34:56,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:34:56,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:34:56,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2025-02-08 14:34:56,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:34:56,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-02-08 14:34:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2025-02-08 14:34:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-08 14:34:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 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-02-08 14:34:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-02-08 14:34:57,018 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-02-08 14:34:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:34:57,022 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-02-08 14:34:57,022 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:34:57,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2025-02-08 14:34:57,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:34:57,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:34:57,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:34:57,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:34:57,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:34:57,024 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#2(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real#2(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real#2(~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#1(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real#1(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real#1(~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#2(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#1(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-02-08 14:34:57,024 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 % 4294967296 < 5;call main_#t~mem8#1 := read~real#1(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-02-08 14:34:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 46698351, now seen corresponding path program 1 times [2025-02-08 14:34:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:34:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021762992] [2025-02-08 14:34:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:34:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:34:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:34:57,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:34:57,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:57,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:34:57,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:34:57,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:34:57,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:57,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:34:57,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:57,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 2 times [2025-02-08 14:34:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:34:57,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488287624] [2025-02-08 14:34:57,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:34:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:34:57,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:34:57,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:34:57,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:34:57,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:34:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:34:57,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:34:57,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:34:57,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1927442702, now seen corresponding path program 1 times [2025-02-08 14:34:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:34:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7531157] [2025-02-08 14:34:57,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:34:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:34:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:34:57,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:34:57,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:57,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:34:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:34:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:34:57,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:57,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:34:57,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:34:57,601 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:34:57,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:34:57,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:34:57,602 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:34:57,603 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:34:57,603 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:57,603 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:34:57,603 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:34:57,603 INFO L132 ssoRankerPreferences]: Filename of dumped script: interpolation.c_Iteration2_Lasso [2025-02-08 14:34:57,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:34:57,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:34:57,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:57,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:34:58,172 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:34:58,175 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:34:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,178 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-02-08 14:34:58,180 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-02-08 14:34:58,182 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-02-08 14:34:58,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:34:58,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:34:58,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:34:58,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:34:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,207 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-02-08 14:34:58,209 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-02-08 14:34:58,210 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-02-08 14:34:58,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:34:58,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:34:58,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,230 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-02-08 14:34:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,232 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-02-08 14:34:58,233 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-02-08 14:34:58,234 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-02-08 14:34:58,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:34:58,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:34:58,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:34:58,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,253 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-02-08 14:34:58,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,255 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-02-08 14:34:58,256 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-02-08 14:34:58,257 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-02-08 14:34:58,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:34:58,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:34:58,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,278 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-02-08 14:34:58,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,281 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-02-08 14:34:58,282 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-02-08 14:34:58,284 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-02-08 14:34:58,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:34:58,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:34:58,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:34:58,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,311 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-02-08 14:34:58,313 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-02-08 14:34:58,314 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-02-08 14:34:58,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:34:58,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:34:58,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:34:58,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:34:58,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,338 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-02-08 14:34:58,338 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-02-08 14:34:58,341 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-02-08 14:34:58,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:34:58,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:34:58,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:34:58,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:34:58,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:34:58,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:34:58,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:34:58,388 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-08 14:34:58,391 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-08 14:34:58,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:34:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:34:58,396 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-02-08 14:34:58,397 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-02-08 14:34:58,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:34:58,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:34:58,409 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:34:58,410 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-02-08 14:34:58,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:34:58,442 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-02-08 14:34:58,450 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#max~0!offset [2025-02-08 14:34:58,450 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:34:58,451 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:34:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:34:58,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:34:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:34:58,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:34:58,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:34:58,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:34:58,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:34:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:34:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:34:58,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:34:58,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:34:58,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:34:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:34:58,513 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-02-08 14:34:58,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 14:34:58,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 states and 10 transitions. Complement of second has 4 states. [2025-02-08 14:34:58,538 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-02-08 14:34:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 14:34:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-08 14:34:58,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-08 14:34:58,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:34:58,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-08 14:34:58,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:34:58,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:34:58,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:34:58,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2025-02-08 14:34:58,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:34:58,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:34:58,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:34:58,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:34:58,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:34:58,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:34:58,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:34:58,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:34:58,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:34:58 BoogieIcfgContainer [2025-02-08 14:34:58,547 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:34:58,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:34:58,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:34:58,548 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:34:58,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:34:56" (3/4) ... [2025-02-08 14:34:58,549 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:34:58,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:34:58,550 INFO L158 Benchmark]: Toolchain (without parser) took 2503.37ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 84.8MB in the end (delta: 69.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2025-02-08 14:34:58,550 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:34:58,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.18ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 142.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:34:58,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.50ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 141.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:34:58,551 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 140.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:34:58,551 INFO L158 Benchmark]: IcfgBuilder took 258.72ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 127.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:34:58,551 INFO L158 Benchmark]: BuchiAutomizer took 2009.81ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 84.9MB in the end (delta: 42.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-02-08 14:34:58,552 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 201.3MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:34:58,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.18ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 142.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.50ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 141.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 140.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 258.72ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 127.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2009.81ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 84.9MB in the end (delta: 42.3MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 201.3MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 39.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.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. 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, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 20 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: 18ms 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-02-08 14:34:58,564 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-02-08 14:34:58,765 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 Result: TRUE