./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/termination-memory-alloca/a.10-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 5993f8ca278f17db67b0d89d60473315dd1639b7ed95b3e55f223aad0ab4864f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:07:15,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:07:15,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:07:15,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:07:15,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:07:15,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:07:15,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:07:15,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:07:15,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:07:15,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:07:15,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:07:15,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:07:15,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:07:15,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:07:15,451 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:07:15,452 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:07:15,452 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:07:15,452 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:07:15,453 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:07:15,453 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:07:15,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:07:15,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:07:15,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:07:15,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:07:15,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:07:15,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:07:15,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:07:15,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:07:15,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:07:15,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:07:15,460 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:07:15,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:07:15,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:07:15,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:07:15,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:07:15,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:07:15,464 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:07:15,465 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5993f8ca278f17db67b0d89d60473315dd1639b7ed95b3e55f223aad0ab4864f [2024-11-17 08:07:15,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:07:15,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:07:15,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:07:15,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:07:15,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:07:15,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2024-11-17 08:07:17,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:07:17,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:07:17,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.10-alloca.i [2024-11-17 08:07:17,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516fb2493/4058e3a8d7d8474db09c139602b50e80/FLAGd53e89c38 [2024-11-17 08:07:17,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516fb2493/4058e3a8d7d8474db09c139602b50e80 [2024-11-17 08:07:17,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:07:17,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:07:17,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:07:17,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:07:17,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:07:17,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:07:17" (1/1) ... [2024-11-17 08:07:17,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd64cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:17, skipping insertion in model container [2024-11-17 08:07:17,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:07:17" (1/1) ... [2024-11-17 08:07:17,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:07:18,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:07:18,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:07:18,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:07:18,176 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:07:18,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18 WrapperNode [2024-11-17 08:07:18,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:07:18,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:07:18,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:07:18,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:07:18,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,214 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-17 08:07:18,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:07:18,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:07:18,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:07:18,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:07:18,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,240 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2024-11-17 08:07:18,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:07:18,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:07:18,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:07:18,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:07:18,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (1/1) ... [2024-11-17 08:07:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:18,292 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) [2024-11-17 08:07:18,298 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 [2024-11-17 08:07:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:07:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:07:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:07:18,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:07:18,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:07:18,624 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;havoc main_#t~ret14#1; [2024-11-17 08:07:18,624 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc test_fun_#t~mem11#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2024-11-17 08:07:18,635 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-17 08:07:18,635 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:07:18,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:07:18,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:07:18,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:18 BoogieIcfgContainer [2024-11-17 08:07:18,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:07:18,650 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:07:18,650 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:07:18,653 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:07:18,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:18,654 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:07:17" (1/3) ... [2024-11-17 08:07:18,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d5832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:07:18, skipping insertion in model container [2024-11-17 08:07:18,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:18,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:07:18" (2/3) ... [2024-11-17 08:07:18,656 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d5832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:07:18, skipping insertion in model container [2024-11-17 08:07:18,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:07:18,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:18" (3/3) ... [2024-11-17 08:07:18,657 INFO L332 chiAutomizerObserver]: Analyzing ICFG a.10-alloca.i [2024-11-17 08:07:18,729 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:07:18,730 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:07:18,730 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:07:18,730 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:07:18,730 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:07:18,730 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:07:18,730 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:07:18,732 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:07:18,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:18,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:18,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:18,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:18,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:07:18,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:07:18,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:07:18,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:18,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:18,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:18,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:18,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:07:18,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:07:18,770 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3#L555true [2024-11-17 08:07:18,771 INFO L747 eck$LassoCheckResult]: Loop: 3#L555true assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 9#L555-1true assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 7#L556true assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3#L555true [2024-11-17 08:07:18,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2024-11-17 08:07:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026523782] [2024-11-17 08:07:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:18,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:18,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:18,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 42663, now seen corresponding path program 1 times [2024-11-17 08:07:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722699380] [2024-11-17 08:07:18,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:19,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:19,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:19,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 43865224, now seen corresponding path program 1 times [2024-11-17 08:07:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:19,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667838087] [2024-11-17 08:07:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:19,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:19,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:19,788 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:19,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:19,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:19,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:19,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:07:19,790 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:19,790 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:19,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:19,791 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration1_Lasso [2024-11-17 08:07:19,792 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:19,792 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:19,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:19,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:19,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:19,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:20,726 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:20,730 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:07:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,734 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) [2024-11-17 08:07:20,736 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 [2024-11-17 08:07:20,737 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 [2024-11-17 08:07:20,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:20,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:20,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:20,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,769 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 [2024-11-17 08:07:20,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,772 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) [2024-11-17 08:07:20,773 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 [2024-11-17 08:07:20,774 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 [2024-11-17 08:07:20,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:20,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:20,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:20,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:20,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,808 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) [2024-11-17 08:07:20,810 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 [2024-11-17 08:07:20,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 [2024-11-17 08:07:20,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:07:20,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:07:20,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:07:20,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:07:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,842 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) [2024-11-17 08:07:20,843 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 [2024-11-17 08:07:20,844 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 [2024-11-17 08:07:20,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:20,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:20,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:20,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,881 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) [2024-11-17 08:07:20,883 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 [2024-11-17 08:07:20,884 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 [2024-11-17 08:07:20,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:20,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:20,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:07:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,919 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) [2024-11-17 08:07:20,920 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 [2024-11-17 08:07:20,921 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 [2024-11-17 08:07:20,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:20,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:20,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:20,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:20,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:20,965 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) [2024-11-17 08:07:20,966 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 [2024-11-17 08:07:20,967 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 [2024-11-17 08:07:20,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:20,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:20,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:20,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:20,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:20,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:20,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:21,007 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 [2024-11-17 08:07:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:21,009 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) [2024-11-17 08:07:21,010 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 [2024-11-17 08:07:21,012 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 [2024-11-17 08:07:21,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:21,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:21,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:21,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:21,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:21,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:21,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:07:21,054 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:07:21,054 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:07:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:21,058 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2024-11-17 08:07:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:07:21,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:07:21,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:07:21,075 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:07:21,075 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 Supporting invariants [] [2024-11-17 08:07:21,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:21,165 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2024-11-17 08:07:21,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 08:07:21,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-17 08:07:21,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-17 08:07:21,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 08:07:21,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 08:07:21,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-17 08:07:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:21,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:07:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:21,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:07:21,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:21,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:07:21,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:21,398 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 [2024-11-17 08:07:21,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2024-11-17 08:07:21,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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) Result 25 states and 31 transitions. Complement of second has 8 states. [2024-11-17 08:07:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2024-11-17 08:07:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2024-11-17 08:07:21,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-17 08:07:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-17 08:07:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-17 08:07:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:21,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2024-11-17 08:07:21,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:21,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 11 states and 14 transitions. [2024-11-17 08:07:21,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-17 08:07:21,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-17 08:07:21,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-17 08:07:21,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:21,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-17 08:07:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-17 08:07:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-11-17 08:07:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-17 08:07:21,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:21,498 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-17 08:07:21,498 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:07:21,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-17 08:07:21,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:21,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:21,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:21,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:07:21,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:07:21,500 INFO L745 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 171#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 172#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 169#L555-1 assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 173#L556 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 165#L555 [2024-11-17 08:07:21,500 INFO L747 eck$LassoCheckResult]: Loop: 165#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 166#L555-1 assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 175#L556 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 165#L555 [2024-11-17 08:07:21,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash 43865225, now seen corresponding path program 1 times [2024-11-17 08:07:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:21,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267706933] [2024-11-17 08:07:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:21,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:21,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 42663, now seen corresponding path program 2 times [2024-11-17 08:07:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:21,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485497693] [2024-11-17 08:07:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:21,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:21,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1118872863, now seen corresponding path program 1 times [2024-11-17 08:07:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111114032] [2024-11-17 08:07:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:21,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:21,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111114032] [2024-11-17 08:07:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111114032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:07:21,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026017809] [2024-11-17 08:07:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:21,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:07:21,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:21,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:07:21,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 08:07:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:22,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 08:07:22,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:22,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-17 08:07:22,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-17 08:07:22,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 08:07:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:22,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:07:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026017809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:07:22,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:07:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-17 08:07:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862899856] [2024-11-17 08:07:22,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:07:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 08:07:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 08:07:22,299 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:22,409 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2024-11-17 08:07:22,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2024-11-17 08:07:22,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:22,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2024-11-17 08:07:22,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-17 08:07:22,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-17 08:07:22,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-17 08:07:22,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:22,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-17 08:07:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-17 08:07:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2024-11-17 08:07:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-17 08:07:22,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-17 08:07:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:07:22,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-17 08:07:22,416 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:07:22,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-11-17 08:07:22,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:22,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:22,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:22,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:07:22,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:07:22,419 INFO L745 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 255#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 256#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 251#L555-1 [2024-11-17 08:07:22,419 INFO L747 eck$LassoCheckResult]: Loop: 251#L555-1 assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 257#L556 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 250#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 251#L555-1 [2024-11-17 08:07:22,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 45645, now seen corresponding path program 1 times [2024-11-17 08:07:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67911920] [2024-11-17 08:07:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 41584, now seen corresponding path program 1 times [2024-11-17 08:07:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81898430] [2024-11-17 08:07:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1359821988, now seen corresponding path program 2 times [2024-11-17 08:07:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787047973] [2024-11-17 08:07:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:22,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:23,019 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:07:23,019 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:07:23,019 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:07:23,019 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:07:23,019 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:07:23,019 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:23,019 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:07:23,019 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:07:23,019 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.10-alloca.i_Iteration3_Lasso [2024-11-17 08:07:23,019 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:07:23,019 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:07:23,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:07:23,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:07:23,703 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:07:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:23,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:23,705 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2024-11-17 08:07:23,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:07:23,707 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 [2024-11-17 08:07:23,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:23,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:23,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:07:23,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:23,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:07:23,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:07:23,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:07:23,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:23,760 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-11-17 08:07:23,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:07:23,763 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 [2024-11-17 08:07:23,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:07:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:07:23,774 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:07:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:07:23,788 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:07:23,788 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:07:23,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:07:23,866 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:07:23,866 INFO L444 ModelExtractionUtils]: 1 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-17 08:07:23,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:07:23,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:23,868 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2024-11-17 08:07:23,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:07:23,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:07:23,881 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-17 08:07:23,881 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:07:23,882 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem5#1, ULTIMATE.start_test_fun_#t~mem6#1) = -1*ULTIMATE.start_test_fun_#t~mem5#1 + 1*ULTIMATE.start_test_fun_#t~mem6#1 Supporting invariants [1*ULTIMATE.start_test_fun_#t~mem6#1 + 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 - 1*ULTIMATE.start_test_fun_#t~mem5#1 >= 0] [2024-11-17 08:07:23,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:07:23,947 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2024-11-17 08:07:23,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-11-17 08:07:23,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem5 [2024-11-17 08:07:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:24,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:07:24,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:24,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:07:24,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:24,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-11-17 08:07:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:24,076 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:07:24,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4 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) [2024-11-17 08:07:24,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 4. 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) Result 18 states and 21 transitions. Complement of second has 7 states. [2024-11-17 08:07:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:07:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2024-11-17 08:07:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2024-11-17 08:07:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2024-11-17 08:07:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2024-11-17 08:07:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2024-11-17 08:07:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:07:24,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2024-11-17 08:07:24,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:24,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 11 states and 12 transitions. [2024-11-17 08:07:24,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-17 08:07:24,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-17 08:07:24,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-11-17 08:07:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:07:24,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:07:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-11-17 08:07:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2024-11-17 08:07:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:07:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-17 08:07:24,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-17 08:07:24,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-17 08:07:24,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:07:24,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-17 08:07:24,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:07:24,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:07:24,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:07:24,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2024-11-17 08:07:24,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:07:24,132 INFO L745 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 417#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~ret14#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet12#1, main_#t~nondet13#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#2(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 412#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 413#L555-1 assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 420#L556 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem9#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem9#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 414#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 415#L555-1 [2024-11-17 08:07:24,133 INFO L747 eck$LassoCheckResult]: Loop: 415#L555-1 assume !!!(test_fun_#t~mem5#1 == test_fun_#t~mem6#1);havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 418#L556 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1;call test_fun_#t~mem10#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem10#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 419#L555 assume true;call test_fun_#t~mem5#1 := read~int#2(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 415#L555-1 [2024-11-17 08:07:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1359821957, now seen corresponding path program 2 times [2024-11-17 08:07:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274377070] [2024-11-17 08:07:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:24,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:24,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 41584, now seen corresponding path program 2 times [2024-11-17 08:07:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779117640] [2024-11-17 08:07:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:24,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:07:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:07:24,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:07:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:07:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 324396908, now seen corresponding path program 2 times [2024-11-17 08:07:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:07:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104598639] [2024-11-17 08:07:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:07:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:07:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:07:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:07:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104598639] [2024-11-17 08:07:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104598639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:07:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128200462] [2024-11-17 08:07:24,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:07:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:07:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:07:24,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:07:24,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 08:07:24,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:07:24,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:07:24,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 08:07:24,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:07:24,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-17 08:07:24,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-17 08:07:24,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 08:07:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:24,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:07:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:07:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128200462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:07:24,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:07:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-17 08:07:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890170003] [2024-11-17 08:07:24,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:07:24,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:07:24,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 08:07:24,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-17 08:07:24,705 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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) [2024-11-17 08:07:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:07:24,756 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2024-11-17 08:07:24,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 10 transitions. [2024-11-17 08:07:24,756 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:07:24,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2024-11-17 08:07:24,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:07:24,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:07:24,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:07:24,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:07:24,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:24,757 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:07:24,758 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:07:24,758 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:07:24,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:07:24,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:07:24,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:07:24,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:07:24 BoogieIcfgContainer [2024-11-17 08:07:24,764 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:07:24,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:07:24,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:07:24,765 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:07:24,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:07:18" (3/4) ... [2024-11-17 08:07:24,768 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:07:24,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:07:24,769 INFO L158 Benchmark]: Toolchain (without parser) took 7002.66ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 125.0MB in the beginning and 164.3MB in the end (delta: -39.2MB). Peak memory consumption was 224.9kB. Max. memory is 16.1GB. [2024-11-17 08:07:24,769 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:24,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 172.0MB. Free memory was 124.3MB in the beginning and 106.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 08:07:24,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 172.0MB. Free memory was 106.2MB in the beginning and 104.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:24,770 INFO L158 Benchmark]: Boogie Preprocessor took 33.69ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:07:24,774 INFO L158 Benchmark]: IcfgBuilder took 398.98ms. Allocated memory is still 172.0MB. Free memory was 102.7MB in the beginning and 130.6MB in the end (delta: -27.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 08:07:24,775 INFO L158 Benchmark]: BuchiAutomizer took 6114.63ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 130.6MB in the beginning and 164.3MB in the end (delta: -33.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-17 08:07:24,775 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 211.8MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:07:24,776 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.19ms. Allocated memory is still 100.7MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.84ms. Allocated memory is still 172.0MB. Free memory was 124.3MB in the beginning and 106.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 172.0MB. Free memory was 106.2MB in the beginning and 104.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.69ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 398.98ms. Allocated memory is still 172.0MB. Free memory was 102.7MB in the beginning and 130.6MB in the end (delta: -27.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6114.63ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 130.6MB in the beginning and 164.3MB in the end (delta: -33.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 211.8MB. Free memory is still 164.3MB. 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: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 15 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax108 hnf100 lsp92 ukn71 mio100 lsp24 div100 bol100 ite100 ukn100 eq168 hnf89 smp100 dnf126 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 123ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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! [2024-11-17 08:07:24,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:25,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:07:25,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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