./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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-crafted/4BitCounterPointer.c -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 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:12:36,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:12:36,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:12:36,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:12:36,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:12:36,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:12:36,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:12:36,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:12:36,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:12:36,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:12:36,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:12:36,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:12:36,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:12:36,574 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:12:36,574 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:12:36,575 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:12:36,575 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:12:36,575 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:12:36,577 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:12:36,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:12:36,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:12:36,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:12:36,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:12:36,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:12:36,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:12:36,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:12:36,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:12:36,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:12:36,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:12:36,581 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:12:36,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:12:36,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:12:36,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:12:36,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:12:36,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:12:36,583 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:12:36,583 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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2024-11-19 14:12:36,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:12:36,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:12:36,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:12:36,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:12:36,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:12:36,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-19 14:12:38,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:12:38,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:12:38,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-19 14:12:38,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89fe5154/6edb4bbdcc974d228b99cb21f4283d5b/FLAG7acd47dbd [2024-11-19 14:12:38,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89fe5154/6edb4bbdcc974d228b99cb21f4283d5b [2024-11-19 14:12:38,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:12:38,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:12:38,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:12:38,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:12:38,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:12:38,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f06432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38, skipping insertion in model container [2024-11-19 14:12:38,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:12:38,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:12:38,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:12:38,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:12:38,426 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:12:38,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38 WrapperNode [2024-11-19 14:12:38,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:12:38,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:12:38,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:12:38,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:12:38,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,449 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-11-19 14:12:38,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:12:38,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:12:38,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:12:38,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:12:38,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,467 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 3, 3, 2]. [2024-11-19 14:12:38,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:12:38,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:12:38,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:12:38,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:12:38,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (1/1) ... [2024-11-19 14:12:38,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:38,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:38,501 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-19 14:12:38,503 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-19 14:12:38,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:12:38,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:12:38,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:12:38,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 14:12:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:12:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:12:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:12:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:12:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:12:38,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 14:12:38,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:12:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:12:38,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:12:38,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:12:38,749 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 14:12:38,749 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:12:38,762 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:12:38,762 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:12:38,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:12:38 BoogieIcfgContainer [2024-11-19 14:12:38,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:12:38,764 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:12:38,764 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:12:38,767 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:12:38,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:12:38,767 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:12:38" (1/3) ... [2024-11-19 14:12:38,768 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@238f52f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:12:38, skipping insertion in model container [2024-11-19 14:12:38,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:12:38,769 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:12:38" (2/3) ... [2024-11-19 14:12:38,769 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@238f52f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:12:38, skipping insertion in model container [2024-11-19 14:12:38,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:12:38,770 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:12:38" (3/3) ... [2024-11-19 14:12:38,770 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-11-19 14:12:38,808 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:12:38,809 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:12:38,809 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:12:38,809 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:12:38,809 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:12:38,810 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:12:38,810 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:12:38,810 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:12:38,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:38,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:12:38,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:38,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:38,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:12:38,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:12:38,832 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:12:38,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:38,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:12:38,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:38,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:38,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:12:38,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:12:38,839 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2024-11-19 14:12:38,839 INFO L747 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 8#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 2#L16true assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2024-11-19 14:12:38,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:12:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:38,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638307066] [2024-11-19 14:12:38,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:38,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:39,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-11-19 14:12:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529367801] [2024-11-19 14:12:39,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:39,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:39,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-11-19 14:12:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229494491] [2024-11-19 14:12:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:39,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:39,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:40,195 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:12:40,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:12:40,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:12:40,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:12:40,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:12:40,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:40,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:12:40,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:12:40,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-11-19 14:12:40,197 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:12:40,197 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:12:40,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:40,917 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:12:40,920 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:12:40,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:40,923 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-19 14:12:40,928 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-19 14:12:40,929 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-19 14:12:40,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:40,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:40,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:40,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:40,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:40,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:40,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:40,970 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-19 14:12:40,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:40,976 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-19 14:12:40,977 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-19 14:12:40,978 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-19 14:12:40,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:40,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:40,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:40,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:40,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:40,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:40,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,004 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-19 14:12:41,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,006 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-19 14:12:41,007 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-19 14:12:41,008 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-19 14:12:41,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,035 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-19 14:12:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,037 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-19 14:12:41,038 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-19 14:12:41,039 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-19 14:12:41,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:12:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,069 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-19 14:12:41,070 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-19 14:12:41,070 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-19 14:12:41,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:12:41,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,096 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-19 14:12:41,097 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-19 14:12:41,098 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-19 14:12:41,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,125 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-19 14:12:41,126 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-19 14:12:41,127 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-19 14:12:41,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,151 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-19 14:12:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,153 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-19 14:12:41,154 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-19 14:12:41,155 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-19 14:12:41,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,180 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-19 14:12:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,183 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-19 14:12:41,184 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-19 14:12:41,185 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-19 14:12:41,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,218 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-19 14:12:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,220 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-19 14:12:41,221 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-19 14:12:41,222 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-19 14:12:41,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,248 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-19 14:12:41,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,250 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-19 14:12:41,251 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-19 14:12:41,252 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-19 14:12:41,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:12:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,280 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-19 14:12:41,280 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-19 14:12:41,281 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-19 14:12:41,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,305 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-19 14:12:41,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,307 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-19 14:12:41,307 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-19 14:12:41,308 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-19 14:12:41,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,335 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-19 14:12:41,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,337 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-19 14:12:41,338 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-19 14:12:41,339 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-19 14:12:41,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:41,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:12:41,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,365 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-19 14:12:41,366 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-19 14:12:41,367 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-19 14:12:41,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:41,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:41,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:41,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:41,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:41,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:41,383 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:12:41,390 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-19 14:12:41,390 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-19 14:12:41,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:41,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:41,417 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-19 14:12:41,418 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-19 14:12:41,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:12:41,429 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:12:41,430 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:12:41,430 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-11-19 14:12:41,441 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-19 14:12:41,528 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-11-19 14:12:41,534 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:12:41,534 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:12:41,534 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-19 14:12:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:41,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:12:41,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:41,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:12:41,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:41,599 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-19 14:12:41,622 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-19 14:12:41,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:41,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 33 transitions. Complement of second has 8 states. [2024-11-19 14:12:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:12:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-11-19 14:12:41,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-19 14:12:41,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:41,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-19 14:12:41,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:41,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-19 14:12:41,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:41,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-11-19 14:12:41,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:12:41,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:12:41,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-11-19 14:12:41,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-19 14:12:41,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:12:41,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-19 14:12:41,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:41,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-19 14:12:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-19 14:12:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:12:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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-19 14:12:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-19 14:12:41,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-19 14:12:41,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-19 14:12:41,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:12:41,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-19 14:12:41,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:12:41,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:41,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:41,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:12:41,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:12:41,725 INFO L745 eck$LassoCheckResult]: Stem: 222#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 224#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 221#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 214#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-19 14:12:41,726 INFO L747 eck$LassoCheckResult]: Loop: 215#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 218#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 219#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 226#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-19 14:12:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2024-11-19 14:12:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928812819] [2024-11-19 14:12:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:41,878 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-19 14:12:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928812819] [2024-11-19 14:12:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928812819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:12:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:12:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:12:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326969183] [2024-11-19 14:12:41,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:12:41,882 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:12:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2024-11-19 14:12:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136536195] [2024-11-19 14:12:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:41,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:41,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:12:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:12:42,005 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:42,027 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-19 14:12:42,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-19 14:12:42,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:12:42,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-11-19 14:12:42,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:12:42,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:12:42,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-19 14:12:42,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:42,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-19 14:12:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-19 14:12:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-19 14:12:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-19 14:12:42,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:12:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:12:42,034 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:12:42,035 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:12:42,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-19 14:12:42,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:12:42,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:42,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:42,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-11-19 14:12:42,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-11-19 14:12:42,037 INFO L745 eck$LassoCheckResult]: Stem: 263#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 260#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 261#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 258#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 259#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 262#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 269#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-19 14:12:42,038 INFO L747 eck$LassoCheckResult]: Loop: 266#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 267#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 265#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 256#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 257#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 270#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 271#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-19 14:12:42,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2024-11-19 14:12:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006977062] [2024-11-19 14:12:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2024-11-19 14:12:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157106714] [2024-11-19 14:12:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:42,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 1 times [2024-11-19 14:12:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:42,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275730247] [2024-11-19 14:12:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:42,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:42,963 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:12:42,963 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:12:42,963 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:12:42,963 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:12:42,963 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:12:42,963 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:42,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:12:42,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:12:42,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-11-19 14:12:42,963 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:12:42,963 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:12:42,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:42,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:42,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:43,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:43,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:43,668 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:12:43,669 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:12:43,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,670 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-19 14:12:43,671 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-19 14:12:43,672 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-19 14:12:43,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:43,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:43,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:43,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,694 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-19 14:12:43,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,695 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-19 14:12:43,696 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-19 14:12:43,697 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-19 14:12:43,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:43,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:43,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:43,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,719 INFO L229 MonitoredProcess]: Starting monitored process 20 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-19 14:12:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:12:43,720 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-19 14:12:43,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:43,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,744 INFO L229 MonitoredProcess]: Starting monitored process 21 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-19 14:12:43,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:12:43,746 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-19 14:12:43,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,773 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-19 14:12:43,774 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-19 14:12:43,775 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-19 14:12:43,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,805 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-19 14:12:43,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,806 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-19 14:12:43,807 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-19 14:12:43,808 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-19 14:12:43,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,831 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-19 14:12:43,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,832 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-19 14:12:43,833 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-19 14:12:43,833 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-19 14:12:43,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,858 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-19 14:12:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,859 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-19 14:12:43,860 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-19 14:12:43,860 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-19 14:12:43,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 14:12:43,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,890 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-19 14:12:43,891 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-19 14:12:43,893 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-19 14:12:43,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,921 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-19 14:12:43,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,922 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-19 14:12:43,923 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-19 14:12:43,924 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-19 14:12:43,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:43,949 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-19 14:12:43,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,950 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-19 14:12:43,951 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-19 14:12:43,951 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-19 14:12:43,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:43,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:43,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:43,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:43,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:43,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:43,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:12:43,973 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:12:43,973 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-19 14:12:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:43,974 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-19 14:12:43,975 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-19 14:12:43,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:12:43,985 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:12:43,985 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:12:43,986 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2024-11-19 14:12:43,996 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-19 14:12:44,082 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2024-11-19 14:12:44,084 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-11-19 14:12:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:44,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:12:44,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:44,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:12:44,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:44,165 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 11 treesize of output 7 [2024-11-19 14:12:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 14:12:44,187 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-19 14:12:44,187 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:44,196 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 41 transitions. Complement of second has 5 states. [2024-11-19 14:12:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:12:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-19 14:12:44,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-11-19 14:12:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:44,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-19 14:12:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:44,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-11-19 14:12:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:44,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-19 14:12:44,199 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:12:44,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-11-19 14:12:44,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:12:44,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:12:44,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-11-19 14:12:44,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:44,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-19 14:12:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-11-19 14:12:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-19 14:12:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 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-19 14:12:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-19 14:12:44,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-19 14:12:44,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-19 14:12:44,205 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:12:44,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-19 14:12:44,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:12:44,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:44,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:44,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:12:44,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:12:44,206 INFO L745 eck$LassoCheckResult]: Stem: 523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 525#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 521#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 518#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 519#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 522#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 537#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 536#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 517#L24-2 [2024-11-19 14:12:44,206 INFO L747 eck$LassoCheckResult]: Loop: 517#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 520#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 516#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 517#L24-2 [2024-11-19 14:12:44,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2024-11-19 14:12:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146007069] [2024-11-19 14:12:44,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:44,224 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:12:44,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:44,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:44,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2024-11-19 14:12:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286186540] [2024-11-19 14:12:44,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:44,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:12:44,237 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:44,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:44,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:44,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 3 times [2024-11-19 14:12:44,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:44,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811457844] [2024-11-19 14:12:44,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:12:44,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:44,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:12:44,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:44,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:44,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:44,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:12:45,401 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:12:45,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:12:45,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:12:45,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:12:45,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:12:45,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:45,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:12:45,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:12:45,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-11-19 14:12:45,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:12:45,402 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:12:45,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:45,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:45,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:45,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:45,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:45,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:46,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:12:46,000 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:12:46,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,002 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-19 14:12:46,003 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-19 14:12:46,004 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-19 14:12:46,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:46,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:46,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:46,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,026 INFO L229 MonitoredProcess]: Starting monitored process 31 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-19 14:12:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:12:46,027 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-19 14:12:46,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:46,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:46,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:46,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,050 INFO L229 MonitoredProcess]: Starting monitored process 32 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-19 14:12:46,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:12:46,052 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-19 14:12:46,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,076 INFO L229 MonitoredProcess]: Starting monitored process 33 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-19 14:12:46,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:12:46,078 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-19 14:12:46,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,102 INFO L229 MonitoredProcess]: Starting monitored process 34 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-19 14:12:46,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:12:46,104 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-19 14:12:46,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,129 INFO L229 MonitoredProcess]: Starting monitored process 35 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-19 14:12:46,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:12:46,131 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-19 14:12:46,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:12:46,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,158 INFO L229 MonitoredProcess]: Starting monitored process 36 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-19 14:12:46,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:12:46,159 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-19 14:12:46,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,184 INFO L229 MonitoredProcess]: Starting monitored process 37 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-19 14:12:46,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:12:46,185 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-19 14:12:46,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,209 INFO L229 MonitoredProcess]: Starting monitored process 38 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-19 14:12:46,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:12:46,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:12:46,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,237 INFO L229 MonitoredProcess]: Starting monitored process 39 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-19 14:12:46,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:12:46,238 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-19 14:12:46,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,262 INFO L229 MonitoredProcess]: Starting monitored process 40 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-19 14:12:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:12:46,263 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-19 14:12:46,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,287 INFO L229 MonitoredProcess]: Starting monitored process 41 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-19 14:12:46,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:12:46,288 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-19 14:12:46,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-19 14:12:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,316 INFO L229 MonitoredProcess]: Starting monitored process 42 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-19 14:12:46,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:12:46,318 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-19 14:12:46,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,350 INFO L229 MonitoredProcess]: Starting monitored process 43 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-19 14:12:46,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:12:46,352 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-19 14:12:46,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,376 INFO L229 MonitoredProcess]: Starting monitored process 44 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-19 14:12:46,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:12:46,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-19 14:12:46,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-19 14:12:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,404 INFO L229 MonitoredProcess]: Starting monitored process 45 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-19 14:12:46,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:12:46,405 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-19 14:12:46,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,428 INFO L229 MonitoredProcess]: Starting monitored process 46 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-19 14:12:46,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-19 14:12:46,430 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-19 14:12:46,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:46,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,457 INFO L229 MonitoredProcess]: Starting monitored process 47 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-19 14:12:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-19 14:12:46,459 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-19 14:12:46,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:46,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:46,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:46,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:46,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:46,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:46,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:12:46,481 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:12:46,481 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-19 14:12:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:46,482 INFO L229 MonitoredProcess]: Starting monitored process 48 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-19 14:12:46,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-19 14:12:46,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:12:46,494 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:12:46,494 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:12:46,494 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) 0)_2 + 1 Supporting invariants [] [2024-11-19 14:12:46,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:46,572 INFO L156 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2024-11-19 14:12:46,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:12:46,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:12:46,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-19 14:12:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:46,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:12:46,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:46,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:12:46,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:46,656 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-19 14:12:46,657 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-19 14:12:46,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:46,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 8 states. [2024-11-19 14:12:46,692 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-19 14:12:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-19 14:12:46,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-19 14:12:46,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:46,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-19 14:12:46,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:46,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-19 14:12:46,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:46,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-19 14:12:46,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:12:46,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-11-19 14:12:46,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-19 14:12:46,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 14:12:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-11-19 14:12:46,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:46,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-19 14:12:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-11-19 14:12:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-19 14:12:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 46 states have internal predecessors, (60), 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-19 14:12:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-19 14:12:46,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-19 14:12:46,701 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-19 14:12:46,701 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:12:46,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-11-19 14:12:46,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-19 14:12:46,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:46,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:46,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:12:46,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-19 14:12:46,703 INFO L745 eck$LassoCheckResult]: Stem: 819#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 820#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 823#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 822#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 812#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 813#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 845#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 844#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 842#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-19 14:12:46,703 INFO L747 eck$LassoCheckResult]: Loop: 843#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 854#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 853#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 852#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 839#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 851#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 837#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 838#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-19 14:12:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2024-11-19 14:12:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368875920] [2024-11-19 14:12:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:46,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-19 14:12:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 14:12:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368875920] [2024-11-19 14:12:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368875920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:12:46,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:12:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:12:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464526523] [2024-11-19 14:12:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:12:46,778 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:12:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2024-11-19 14:12:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570298493] [2024-11-19 14:12:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:46,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:46,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:12:47,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:12:47,011 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-19 14:12:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:47,024 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-19 14:12:47,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-11-19 14:12:47,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-19 14:12:47,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-11-19 14:12:47,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:12:47,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:12:47,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-11-19 14:12:47,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:47,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-19 14:12:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-11-19 14:12:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 14:12:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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-19 14:12:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-19 14:12:47,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-19 14:12:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:12:47,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-19 14:12:47,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:12:47,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-19 14:12:47,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-19 14:12:47,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:47,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:47,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-11-19 14:12:47,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:12:47,033 INFO L745 eck$LassoCheckResult]: Stem: 914#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 915#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 919#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 940#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 938#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 936#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 933#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 920#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 921#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 908#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 909#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 917#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 918#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 922#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 907#L24-2 [2024-11-19 14:12:47,033 INFO L747 eck$LassoCheckResult]: Loop: 907#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 941#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 906#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 907#L24-2 [2024-11-19 14:12:47,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 4 times [2024-11-19 14:12:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858448908] [2024-11-19 14:12:47,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:12:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:47,045 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:12:47,046 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:12:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 14:12:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858448908] [2024-11-19 14:12:47,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858448908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:12:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515353193] [2024-11-19 14:12:47,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:12:47,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:12:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:47,148 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:12:47,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-19 14:12:47,216 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:12:47,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:12:47,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:12:47,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:47,222 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 11 treesize of output 7 [2024-11-19 14:12:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 14:12:47,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 14:12:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515353193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:12:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 14:12:47,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-19 14:12:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111780433] [2024-11-19 14:12:47,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:12:47,243 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:12:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2024-11-19 14:12:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913895671] [2024-11-19 14:12:47,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:12:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:47,246 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:12:47,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:47,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:12:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:12:47,295 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:12:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:47,316 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-19 14:12:47,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-11-19 14:12:47,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:12:47,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-11-19 14:12:47,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:12:47,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:12:47,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-11-19 14:12:47,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:47,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-19 14:12:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-11-19 14:12:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-19 14:12:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-19 14:12:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-19 14:12:47,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-19 14:12:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:12:47,320 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-19 14:12:47,320 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:12:47,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-11-19 14:12:47,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:12:47,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:47,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:47,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-19 14:12:47,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-19 14:12:47,323 INFO L745 eck$LassoCheckResult]: Stem: 1043#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1045#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1037#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1038#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1041#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1062#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1061#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1060#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1055#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1057#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1053#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1054#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1050#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-19 14:12:47,323 INFO L747 eck$LassoCheckResult]: Loop: 1049#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1048#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1039#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1035#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1036#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1064#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1063#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1046#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1047#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1059#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1058#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1056#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1051#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1052#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-19 14:12:47,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 5 times [2024-11-19 14:12:47,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263960904] [2024-11-19 14:12:47,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:12:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:47,340 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 14:12:47,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:47,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:47,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -97586480, now seen corresponding path program 1 times [2024-11-19 14:12:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663917544] [2024-11-19 14:12:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 569106656, now seen corresponding path program 1 times [2024-11-19 14:12:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491987551] [2024-11-19 14:12:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:47,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:48,997 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:12:48,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:12:48,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:12:48,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:12:48,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:12:48,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:48,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:12:48,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:12:48,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-11-19 14:12:48,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:12:48,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:12:48,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:49,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:49,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:49,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:49,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:12:49,702 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:12:49,702 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:12:49,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,703 INFO L229 MonitoredProcess]: Starting monitored process 50 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-19 14:12:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-19 14:12:49,704 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-19 14:12:49,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:49,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:49,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:49,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:49,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:49,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:49,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:49,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:49,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,726 INFO L229 MonitoredProcess]: Starting monitored process 51 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-19 14:12:49,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:12:49,727 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-19 14:12:49,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:49,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:49,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:49,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:49,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:49,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:49,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:49,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:49,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-19 14:12:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,749 INFO L229 MonitoredProcess]: Starting monitored process 52 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-19 14:12:49,750 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-19 14:12:49,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:12:49,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:49,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:12:49,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:49,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:49,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:49,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:12:49,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:12:49,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:49,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-19 14:12:49,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,772 INFO L229 MonitoredProcess]: Starting monitored process 53 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-19 14:12:49,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:12:49,773 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-19 14:12:49,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:49,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:49,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:49,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:49,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:49,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:49,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:12:49,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,800 INFO L229 MonitoredProcess]: Starting monitored process 54 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-19 14:12:49,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-19 14:12:49,802 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-19 14:12:49,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:12:49,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:12:49,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:12:49,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:12:49,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:12:49,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:12:49,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:12:49,824 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:12:49,824 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:12:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:12:49,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:49,826 INFO L229 MonitoredProcess]: Starting monitored process 55 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-19 14:12:49,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-19 14:12:49,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:12:49,838 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:12:49,838 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:12:49,839 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-11-19 14:12:49,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:49,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-19 14:12:49,938 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-11-19 14:12:49,939 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 14:12:49,939 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 14:12:49,939 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-19 14:12:49,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:49,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:12:49,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:49,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:12:49,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:50,012 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 30 treesize of output 18 [2024-11-19 14:12:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:12:50,056 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-19 14:12:50,056 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-19 14:12:50,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 65 states and 77 transitions. Complement of second has 7 states. [2024-11-19 14:12:50,079 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-19 14:12:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-19 14:12:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-19 14:12:50,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-11-19 14:12:50,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:50,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-11-19 14:12:50,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:50,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-11-19 14:12:50,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:12:50,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-11-19 14:12:50,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-19 14:12:50,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-11-19 14:12:50,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-19 14:12:50,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-19 14:12:50,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-11-19 14:12:50,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:50,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-19 14:12:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-11-19 14:12:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 14:12:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 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-19 14:12:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-11-19 14:12:50,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-19 14:12:50,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-19 14:12:50,087 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:12:50,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-11-19 14:12:50,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-19 14:12:50,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:50,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:50,090 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:12:50,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-19 14:12:50,091 INFO L745 eck$LassoCheckResult]: Stem: 1403#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1409#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1407#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1408#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1443#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1442#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1441#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1440#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1401#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1402#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1398#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1399#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1448#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1430#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1431#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1414#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1415#L24-2 [2024-11-19 14:12:50,091 INFO L747 eck$LassoCheckResult]: Loop: 1415#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1449#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1447#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1445#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1446#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1444#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1410#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1411#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1405#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1406#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1451#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1452#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1450#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1426#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1427#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1415#L24-2 [2024-11-19 14:12:50,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash -141984138, now seen corresponding path program 1 times [2024-11-19 14:12:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466528332] [2024-11-19 14:12:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:12:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:12:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466528332] [2024-11-19 14:12:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466528332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:12:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:12:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:12:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596608814] [2024-11-19 14:12:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:12:50,156 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:12:50,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1365622390, now seen corresponding path program 2 times [2024-11-19 14:12:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973339612] [2024-11-19 14:12:50,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:12:50,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:50,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:12:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:12:50,511 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-19 14:12:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:50,524 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-19 14:12:50,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-11-19 14:12:50,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-19 14:12:50,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-11-19 14:12:50,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-19 14:12:50,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-19 14:12:50,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-11-19 14:12:50,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:50,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-19 14:12:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-11-19 14:12:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-19 14:12:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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-19 14:12:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-19 14:12:50,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-19 14:12:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:12:50,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-19 14:12:50,535 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:12:50,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-19 14:12:50,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-19 14:12:50,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:50,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:50,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-11-19 14:12:50,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:12:50,537 INFO L745 eck$LassoCheckResult]: Stem: 1562#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1565#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1589#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1556#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1557#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1591#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1594#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1593#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1592#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1590#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1584#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1585#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1581#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1580#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1573#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1571#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1572#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1579#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1625#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-19 14:12:50,537 INFO L747 eck$LassoCheckResult]: Loop: 1620#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1623#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1619#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-19 14:12:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 693278934, now seen corresponding path program 2 times [2024-11-19 14:12:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065311440] [2024-11-19 14:12:50,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,559 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:12:50,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:50,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2024-11-19 14:12:50,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141295550] [2024-11-19 14:12:50,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:12:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,580 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:12:50,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:12:50,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:50,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1024996556, now seen corresponding path program 3 times [2024-11-19 14:12:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301959677] [2024-11-19 14:12:50,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:12:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,598 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:12:50,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:12:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 14:12:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301959677] [2024-11-19 14:12:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301959677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:12:50,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:12:50,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:12:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81327703] [2024-11-19 14:12:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:12:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:12:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:12:50,697 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-19 14:12:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:50,709 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-19 14:12:50,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-11-19 14:12:50,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-19 14:12:50,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-11-19 14:12:50,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-19 14:12:50,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-19 14:12:50,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-11-19 14:12:50,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:12:50,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-19 14:12:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-11-19 14:12:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-19 14:12:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 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-19 14:12:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-19 14:12:50,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-19 14:12:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:12:50,714 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-19 14:12:50,714 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:12:50,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-11-19 14:12:50,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-19 14:12:50,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:12:50,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:12:50,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-11-19 14:12:50,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-11-19 14:12:50,715 INFO L745 eck$LassoCheckResult]: Stem: 1725#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1728#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1751#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1750#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1749#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1748#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1747#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1746#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1723#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1724#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1719#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1720#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1743#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1737#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1735#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1733#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1734#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1742#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1759#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1757#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1755#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1752#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1729#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1721#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1722#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1727#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1758#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1756#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1753#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1754#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1731#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1732#L24-2 [2024-11-19 14:12:50,715 INFO L747 eck$LassoCheckResult]: Loop: 1732#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1760#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1783#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1781#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1779#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1777#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1775#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1773#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1771#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1717#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1718#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1767#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1765#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1744#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1745#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1761#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1784#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1782#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1780#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1778#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1776#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1774#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1772#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1770#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1769#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1768#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1766#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1764#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1763#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1762#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1732#L24-2 [2024-11-19 14:12:50,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1450650533, now seen corresponding path program 1 times [2024-11-19 14:12:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18915580] [2024-11-19 14:12:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:50,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1011439773, now seen corresponding path program 1 times [2024-11-19 14:12:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257018556] [2024-11-19 14:12:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:12:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:12:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:12:50,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:12:50,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:12:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 783342599, now seen corresponding path program 2 times [2024-11-19 14:12:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:12:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795200740] [2024-11-19 14:12:50,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:12:50,789 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:12:50,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:12:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 203 proven. 48 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-19 14:12:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:12:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795200740] [2024-11-19 14:12:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795200740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:12:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150902605] [2024-11-19 14:12:51,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:12:51,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:12:51,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:12:51,011 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:12:51,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-19 14:12:51,136 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:12:51,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:12:51,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:12:51,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:12:51,143 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 11 treesize of output 7 [2024-11-19 14:12:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-19 14:12:51,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:12:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-19 14:12:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150902605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:12:51,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:12:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-11-19 14:12:51,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422810560] [2024-11-19 14:12:51,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:12:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:12:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:12:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:12:53,020 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-19 14:12:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:12:53,048 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-19 14:12:53,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-11-19 14:12:53,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:12:53,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-11-19 14:12:53,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:12:53,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:12:53,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:12:53,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:12:53,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:12:53,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:12:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:12:53,049 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:12:53,049 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:12:53,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:12:53,049 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:12:53,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:12:53,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:12:53 BoogieIcfgContainer [2024-11-19 14:12:53,055 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:12:53,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:12:53,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:12:53,055 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:12:53,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:12:38" (3/4) ... [2024-11-19 14:12:53,057 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:12:53,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:12:53,058 INFO L158 Benchmark]: Toolchain (without parser) took 14801.00ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 114.2MB in the beginning and 87.9MB in the end (delta: 26.4MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-11-19 14:12:53,058 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:12:53,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.62ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 102.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:12:53,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.75ms. Allocated memory is still 182.5MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:12:53,059 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 182.5MB. Free memory was 100.8MB in the beginning and 98.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:12:53,059 INFO L158 Benchmark]: RCFGBuilder took 283.54ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 150.7MB in the end (delta: -52.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-19 14:12:53,059 INFO L158 Benchmark]: BuchiAutomizer took 14290.92ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 150.7MB in the beginning and 88.9MB in the end (delta: 61.8MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2024-11-19 14:12:53,059 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 264.2MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:12:53,060 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.48ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.62ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 102.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.75ms. Allocated memory is still 182.5MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 182.5MB. Free memory was 100.8MB in the beginning and 98.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.54ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 150.7MB in the end (delta: -52.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 14290.92ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 150.7MB in the beginning and 88.9MB in the end (delta: 61.8MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 264.2MB. Free memory is still 87.9MB. 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#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[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - 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[~x0~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[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.2s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 90 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq165 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 2 VariablesLoop: 2 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-19 14:12:53,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:53,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:12:53,480 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