./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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/c.08-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 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:25:00,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:25:00,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:25:00,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:25:00,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:25:00,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:25:00,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:25:00,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:25:00,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:25:00,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:25:00,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:25:00,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:25:00,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:25:00,979 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:25:00,979 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:25:00,979 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:25:00,979 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:25:00,980 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:25:00,980 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:25:00,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:25:00,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:25:00,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:25:00,984 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:25:00,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:25:00,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:25:00,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:25:00,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:25:00,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:25:00,984 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:25:00,985 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 -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2024-11-09 15:25:01,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:25:01,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:25:01,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:25:01,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:25:01,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:25:01,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2024-11-09 15:25:02,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:25:02,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:25:02,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2024-11-09 15:25:02,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70863e241/4fb31dcf3888492f8daf65f47b12ca01/FLAG8477ca1b3 [2024-11-09 15:25:03,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70863e241/4fb31dcf3888492f8daf65f47b12ca01 [2024-11-09 15:25:03,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:25:03,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:25:03,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:03,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:25:03,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:25:03,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fd686c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03, skipping insertion in model container [2024-11-09 15:25:03,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:25:03,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:03,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:25:03,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:25:03,436 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:25:03,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03 WrapperNode [2024-11-09 15:25:03,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:25:03,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:03,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:25:03,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:25:03,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,467 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-09 15:25:03,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:25:03,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:25:03,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:25:03,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:25:03,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,488 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [5, 2, 5]. 42 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [3, 1, 2]. [2024-11-09 15:25:03,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:25:03,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:25:03,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:25:03,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:25:03,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (1/1) ... [2024-11-09 15:25:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:03,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:03,531 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-09 15:25:03,533 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-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:25:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:25:03,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:25:03,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:25:03,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:25:03,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:25:03,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:25:03,745 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 15:25:03,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:25:03,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:25:03,754 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:25:03,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:03 BoogieIcfgContainer [2024-11-09 15:25:03,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:25:03,755 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:25:03,756 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:25:03,758 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:25:03,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:03,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:25:03" (1/3) ... [2024-11-09 15:25:03,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55d1d296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:03, skipping insertion in model container [2024-11-09 15:25:03,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:03,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:03" (2/3) ... [2024-11-09 15:25:03,760 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55d1d296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:25:03, skipping insertion in model container [2024-11-09 15:25:03,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:25:03,760 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:03" (3/3) ... [2024-11-09 15:25:03,761 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2024-11-09 15:25:03,796 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:25:03,796 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:25:03,796 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:25:03,796 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:25:03,796 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:25:03,796 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:25:03,796 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:25:03,796 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:25:03,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-09 15:25:03,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:25:03,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:03,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:03,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:03,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:03,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:25:03,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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-09 15:25:03,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:25:03,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:03,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:03,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:03,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:25:03,820 INFO L745 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3#L555-3true [2024-11-09 15:25:03,820 INFO L747 eck$LassoCheckResult]: Loop: 3#L555-3true call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 10#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 8#L557-3true assume !true; 12#L557-4true call test_fun_#t~mem9#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3#L555-3true [2024-11-09 15:25:03,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:25:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269742729] [2024-11-09 15:25:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:03,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:03,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-11-09 15:25:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:03,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701860760] [2024-11-09 15:25:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:04,019 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-09 15:25:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701860760] [2024-11-09 15:25:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701860760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:25:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:25:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116860459] [2024-11-09 15:25:04,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:04,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:25:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:04,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:25:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:25:04,050 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-09 15:25:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:04,055 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-11-09 15:25:04,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-11-09 15:25:04,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:25:04,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2024-11-09 15:25:04,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-09 15:25:04,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-09 15:25:04,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-11-09 15:25:04,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:04,061 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-09 15:25:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-11-09 15:25:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-09 15:25:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-11-09 15:25:04,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-09 15:25:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:25:04,083 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-09 15:25:04,083 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:25:04,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-11-09 15:25:04,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:25:04,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:04,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:04,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:25:04,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:25:04,084 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 32#L555-3 [2024-11-09 15:25:04,084 INFO L747 eck$LassoCheckResult]: Loop: 32#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 33#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 36#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 38#L557-4 call test_fun_#t~mem9#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 32#L555-3 [2024-11-09 15:25:04,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:25:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103096642] [2024-11-09 15:25:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-11-09 15:25:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681007096] [2024-11-09 15:25:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:04,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2024-11-09 15:25:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879912436] [2024-11-09 15:25:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:04,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:04,713 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:04,714 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:04,714 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:04,714 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:04,714 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:04,714 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:04,714 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:04,714 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:04,714 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2024-11-09 15:25:04,714 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:04,714 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:04,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:04,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:05,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:05,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:05,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:05,399 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:05,403 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,408 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-09 15:25:05,409 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-09 15:25:05,410 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-09 15:25:05,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,438 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-09 15:25:05,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,441 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-09 15:25:05,442 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-09 15:25:05,443 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-09 15:25:05,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:25:05,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,468 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-09 15:25:05,469 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-09 15:25:05,470 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-09 15:25:05,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,493 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-09 15:25:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,495 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-09 15:25:05,499 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-09 15:25:05,504 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-09 15:25:05,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,527 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-09 15:25:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,531 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-09 15:25:05,532 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-09 15:25:05,533 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-09 15:25:05,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:05,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,560 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-09 15:25:05,561 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-09 15:25:05,562 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-09 15:25:05,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:25:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,584 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-09 15:25:05,585 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-09 15:25:05,586 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-09 15:25:05,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,612 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-09 15:25:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,613 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-09 15:25:05,614 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-09 15:25:05,615 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-09 15:25:05,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:05,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:05,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:05,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:25:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,640 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-09 15:25:05,641 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-09 15:25:05,642 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-09 15:25:05,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:05,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,675 INFO L229 MonitoredProcess]: Starting monitored process 11 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-09 15:25:05,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:25:05,677 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-09 15:25:05,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:05,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,704 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-09 15:25:05,704 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-09 15:25:05,705 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-09 15:25:05,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,729 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-09 15:25:05,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,731 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-09 15:25:05,732 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-09 15:25:05,733 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-09 15:25:05,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,761 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-09 15:25:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,762 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-09 15:25:05,763 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-09 15:25:05,764 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-09 15:25:05,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:05,788 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-09 15:25:05,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,789 INFO L229 MonitoredProcess]: Starting monitored process 15 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-09 15:25:05,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:25:05,791 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-09 15:25:05,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:05,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:05,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:05,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:05,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:05,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:05,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:05,825 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 15:25:05,826 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:25:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:05,832 INFO L229 MonitoredProcess]: Starting monitored process 16 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-09 15:25:05,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:25:05,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:05,848 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:05,848 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:05,849 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1 + 1 Supporting invariants [] [2024-11-09 15:25:05,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:05,913 INFO L156 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2024-11-09 15:25:05,924 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:25:05,924 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:25:05,925 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-11-09 15:25:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:05,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:25:05,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:05,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:25:05,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:06,031 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-09 15:25:06,034 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-09 15:25:06,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:06,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 15 transitions. Complement of second has 6 states. [2024-11-09 15:25:06,078 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-09 15:25:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-09 15:25:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2024-11-09 15:25:06,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2024-11-09 15:25:06,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:06,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2024-11-09 15:25:06,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:06,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2024-11-09 15:25:06,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:06,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 14 transitions. [2024-11-09 15:25:06,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-09 15:25:06,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-09 15:25:06,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-09 15:25:06,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:06,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-09 15:25:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-09 15:25:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-09 15:25:06,084 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-09 15:25:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-09 15:25:06,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-09 15:25:06,085 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-09 15:25:06,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:25:06,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-09 15:25:06,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:06,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:06,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:06,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:25:06,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:06,086 INFO L745 eck$LassoCheckResult]: Stem: 187#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 183#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 185#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 189#L557-3 [2024-11-09 15:25:06,087 INFO L747 eck$LassoCheckResult]: Loop: 189#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 190#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 189#L557-3 [2024-11-09 15:25:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:06,091 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-11-09 15:25:06,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:06,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036120324] [2024-11-09 15:25:06,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:06,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:06,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-11-09 15:25:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277883757] [2024-11-09 15:25:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-11-09 15:25:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344685482] [2024-11-09 15:25:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:06,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:06,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:06,815 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:06,816 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:06,816 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:06,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:06,816 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:06,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:06,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:06,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:06,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2024-11-09 15:25:06,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:06,816 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:06,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:06,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:07,233 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:07,233 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:07,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:07,235 INFO L229 MonitoredProcess]: Starting monitored process 17 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-09 15:25:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:25:07,237 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-09 15:25:07,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:07,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:25:07,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:07,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:07,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:07,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:25:07,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:25:07,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:07,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:07,259 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 15:25:07,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:25:07,269 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-09 15:25:07,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:07,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:07,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:07,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:07,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:07,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:07,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:07,290 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:25:07,290 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-09 15:25:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:07,292 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 15:25:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:25:07,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:07,305 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:07,305 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:07,305 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2, v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 Supporting invariants [] [2024-11-09 15:25:07,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:07,354 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:07,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2024-11-09 15:25:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:07,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:25:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:07,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:25:07,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:07,412 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-09 15:25:07,412 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-09 15:25:07,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-09 15:25:07,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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 28 states and 34 transitions. Complement of second has 7 states. [2024-11-09 15:25:07,433 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-09 15:25:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-09 15:25:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-09 15:25:07,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:25:07,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:07,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:25:07,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:07,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-09 15:25:07,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:07,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2024-11-09 15:25:07,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:07,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 23 transitions. [2024-11-09 15:25:07,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-09 15:25:07,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-09 15:25:07,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-09 15:25:07,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:07,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 15:25:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-09 15:25:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2024-11-09 15:25:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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-09 15:25:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-09 15:25:07,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-09 15:25:07,437 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-09 15:25:07,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:25:07,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2024-11-09 15:25:07,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:07,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:07,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:07,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:25:07,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:07,438 INFO L745 eck$LassoCheckResult]: Stem: 348#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 349#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 343#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 344#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 354#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 357#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 356#L557-4 call test_fun_#t~mem9#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 345#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 347#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 350#L557-3 [2024-11-09 15:25:07,439 INFO L747 eck$LassoCheckResult]: Loop: 350#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 351#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 350#L557-3 [2024-11-09 15:25:07,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1271569044, now seen corresponding path program 2 times [2024-11-09 15:25:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:07,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880299793] [2024-11-09 15:25:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:07,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:07,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880299793] [2024-11-09 15:25:07,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880299793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024889115] [2024-11-09 15:25:07,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:07,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:07,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:07,625 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:07,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 15:25:07,685 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:07,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:07,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:07,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:07,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:25:07,729 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-09 15:25:07,751 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 25 treesize of output 13 [2024-11-09 15:25:07,762 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-09 15:25:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:07,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:25:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024889115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:25:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:25:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-09 15:25:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352617666] [2024-11-09 15:25:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:25:07,764 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:25:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-11-09 15:25:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:07,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194644537] [2024-11-09 15:25:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:25:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 15:25:07,816 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:25:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:07,873 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-09 15:25:07,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2024-11-09 15:25:07,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:07,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 24 transitions. [2024-11-09 15:25:07,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-09 15:25:07,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-09 15:25:07,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2024-11-09 15:25:07,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:07,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 15:25:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2024-11-09 15:25:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-09 15:25:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-09 15:25:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-09 15:25:07,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 15:25:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:25:07,878 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-09 15:25:07,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:25:07,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-09 15:25:07,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:07,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:07,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:07,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:25:07,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:07,881 INFO L745 eck$LassoCheckResult]: Stem: 434#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 429#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 430#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 446#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 445#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 444#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 442#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 441#L557-4 call test_fun_#t~mem9#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 431#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 433#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 436#L557-3 [2024-11-09 15:25:07,881 INFO L747 eck$LassoCheckResult]: Loop: 436#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 437#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 436#L557-3 [2024-11-09 15:25:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2038480497, now seen corresponding path program 1 times [2024-11-09 15:25:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371862309] [2024-11-09 15:25:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:07,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 3 times [2024-11-09 15:25:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:07,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703264503] [2024-11-09 15:25:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:07,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 2 times [2024-11-09 15:25:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598163851] [2024-11-09 15:25:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:08,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:25:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:25:08,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598163851] [2024-11-09 15:25:08,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598163851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:25:08,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101115503] [2024-11-09 15:25:08,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:25:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:25:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:08,224 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:25:08,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 15:25:08,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:25:08,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:25:08,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 15:25:08,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:08,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:25:08,305 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 36 treesize of output 13 [2024-11-09 15:25:08,348 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 29 treesize of output 17 [2024-11-09 15:25:08,378 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 36 treesize of output 13 [2024-11-09 15:25:08,396 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-09 15:25:08,399 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-09 15:25:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:08,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:25:08,477 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-09 15:25:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:25:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101115503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:25:08,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:25:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2024-11-09 15:25:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833601854] [2024-11-09 15:25:08,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:25:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:25:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 15:25:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-09 15:25:08,529 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 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-09 15:25:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:25:08,646 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-09 15:25:08,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-11-09 15:25:08,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:08,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 30 transitions. [2024-11-09 15:25:08,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:25:08,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:25:08,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2024-11-09 15:25:08,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:25:08,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-09 15:25:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2024-11-09 15:25:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2024-11-09 15:25:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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-09 15:25:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 15:25:08,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 15:25:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:25:08,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 15:25:08,650 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:25:08,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-11-09 15:25:08,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:25:08,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:25:08,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:25:08,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 15:25:08,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:25:08,651 INFO L745 eck$LassoCheckResult]: Stem: 592#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_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_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#0(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#1(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 587#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 588#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 608#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 598#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 596#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 597#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 605#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 601#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 600#L557-4 call test_fun_#t~mem9#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int#2(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 589#L555-3 call test_fun_#t~mem5#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 591#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int#0(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 594#L557-3 [2024-11-09 15:25:08,651 INFO L747 eck$LassoCheckResult]: Loop: 594#L557-3 call test_fun_#t~mem7#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int#2(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 595#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 594#L557-3 [2024-11-09 15:25:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 3 times [2024-11-09 15:25:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638497960] [2024-11-09 15:25:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 4 times [2024-11-09 15:25:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120639741] [2024-11-09 15:25:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:08,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash -713568913, now seen corresponding path program 4 times [2024-11-09 15:25:08,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:25:08,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103044944] [2024-11-09 15:25:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:25:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:25:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:25:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:25:08,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:25:09,926 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:25:09,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:25:09,927 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:25:09,927 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:25:09,927 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:25:09,927 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:09,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:25:09,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:25:09,927 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration6_Lasso [2024-11-09 15:25:09,927 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:25:09,927 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:25:09,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:25:10,375 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:25:10,375 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:25:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,377 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09 15:25:10,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:25:10,379 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-09 15:25:10,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,409 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09 15:25:10,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:25:10,410 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-09 15:25:10,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,440 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09 15:25:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:25:10,444 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-09 15:25:10,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,472 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 15:25:10,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-09 15:25:10,474 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-09 15:25:10,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,498 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 15:25:10,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-09 15:25:10,499 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-09 15:25:10,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,523 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09 15:25:10,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:25:10,524 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-09 15:25:10,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,551 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 15:25:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:25:10,553 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-09 15:25:10,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:25:10,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,579 INFO L229 MonitoredProcess]: Starting monitored process 29 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-09 15:25:10,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:25:10,581 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-09 15:25:10,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:25:10,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:25:10,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:25:10,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:25:10,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:25:10,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:25:10,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:25:10,607 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:25:10,608 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:25:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:25:10,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:25:10,609 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09 15:25:10,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:25:10,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:25:10,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:25:10,624 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:25:10,624 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3, v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~j_ref~0#1.base) 0)_2 Supporting invariants [] [2024-11-09 15:25:10,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:10,671 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i_ref~0!base,]]] [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:25:10,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] [2024-11-09 15:25:10,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:10,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:25:10,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:10,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:10,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:10,757 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-09 15:25:10,758 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-09 15:25:10,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:10,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 33 states and 38 transitions. Complement of second has 8 states. [2024-11-09 15:25:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-11-09 15:25:10,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-09 15:25:10,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:10,791 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:10,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:10,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:25:10,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:10,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-09 15:25:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:10,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:10,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:10,901 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-09 15:25:10,901 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-09 15:25:10,901 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:10,933 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 33 states and 38 transitions. Complement of second has 8 states. [2024-11-09 15:25:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-11-09 15:25:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-09 15:25:10,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:10,934 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:25:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:25:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:10,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:25:10,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:25:11,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:25:11,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:25:11,022 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-09 15:25:11,022 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-09 15:25:11,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:11,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 34 states and 40 transitions. Complement of second has 7 states. [2024-11-09 15:25:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:25:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-09 15:25:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-11-09 15:25:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 2 letters. [2024-11-09 15:25:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-09 15:25:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2024-11-09 15:25:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:25:11,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2024-11-09 15:25:11,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:25:11,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:25:11,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:25:11,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:25:11,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:25:11,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:25:11,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:25:11,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:25:11,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:25:11 BoogieIcfgContainer [2024-11-09 15:25:11,073 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:25:11,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:25:11,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:25:11,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:25:11,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:03" (3/4) ... [2024-11-09 15:25:11,075 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:25:11,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:25:11,076 INFO L158 Benchmark]: Toolchain (without parser) took 8026.21ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 98.5MB in the beginning and 134.7MB in the end (delta: -36.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.08ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 134.7MB in the end (delta: -36.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.22ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 132.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: Boogie Preprocessor took 27.21ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: RCFGBuilder took 257.97ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: BuchiAutomizer took 7317.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 118.2MB in the beginning and 135.7MB in the end (delta: -17.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-09 15:25:11,077 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 134.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:25:11,078 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.35ms. Allocated memory is still 104.9MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.08ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 134.7MB in the end (delta: -36.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.22ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 132.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.21ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 130.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 257.97ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 118.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7317.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 118.2MB in the beginning and 135.7MB in the end (delta: -17.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 134.7MB in the end (delta: 1.0MB). 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[~i_ref~0!base,]]] - 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[~i_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] - 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[~i_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 39 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax108 hnf100 lsp92 ukn72 mio100 lsp25 div100 bol100 ite100 ukn100 eq168 hnf89 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:25:11,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:25:11,497 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