./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-803cd42-m [2024-11-23 02:04:28,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:04:29,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 02:04:29,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:04:29,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:04:29,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:04:29,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:04:29,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:04:29,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:04:29,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:04:29,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:04:29,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:04:29,109 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:04:29,112 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:04:29,112 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:04:29,113 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:04:29,113 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:04:29,113 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:04:29,113 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:04:29,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:04:29,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:04:29,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:04:29,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:04:29,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:04:29,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:04:29,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:04:29,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:04:29,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:04:29,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:04:29,119 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:04:29,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:04:29,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:04:29,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:04:29,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:04:29,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:04:29,120 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:04:29,120 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-23 02:04:29,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:04:29,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:04:29,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:04:29,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:04:29,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:04:29,438 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-23 02:04:30,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:04:31,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:04:31,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-23 02:04:31,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7d3a3c8/76a187d0bf5b4b0c97c1f2cb04af3340/FLAGf527dbf04 [2024-11-23 02:04:31,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7d3a3c8/76a187d0bf5b4b0c97c1f2cb04af3340 [2024-11-23 02:04:31,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:04:31,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:04:31,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:04:31,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:04:31,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:04:31,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b08c0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31, skipping insertion in model container [2024-11-23 02:04:31,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:04:31,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:04:31,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:04:31,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:04:31,646 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:04:31,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31 WrapperNode [2024-11-23 02:04:31,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:04:31,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:04:31,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:04:31,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:04:31,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,699 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-11-23 02:04:31,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:04:31,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:04:31,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:04:31,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:04:31,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,724 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 3, 4]. 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, 2, 3]. [2024-11-23 02:04:31,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:04:31,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:04:31,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:04:31,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:04:31,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (1/1) ... [2024-11-23 02:04:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:31,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:31,787 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-23 02:04:31,788 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-23 02:04:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:04:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:04:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 02:04:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 02:04:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:04:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:04:31,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:04:31,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:04:31,987 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-23 02:04:31,988 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:04:31,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:04:31,996 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-23 02:04:31,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:31 BoogieIcfgContainer [2024-11-23 02:04:31,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:04:31,997 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:04:31,997 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:04:32,000 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:04:32,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:04:32,001 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:04:31" (1/3) ... [2024-11-23 02:04:32,002 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5126a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:04:32, skipping insertion in model container [2024-11-23 02:04:32,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:04:32,002 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:31" (2/3) ... [2024-11-23 02:04:32,002 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5126a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:04:32, skipping insertion in model container [2024-11-23 02:04:32,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:04:32,002 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:31" (3/3) ... [2024-11-23 02:04:32,003 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-11-23 02:04:32,040 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:04:32,040 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:04:32,041 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:04:32,041 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:04:32,041 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:04:32,041 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:04:32,041 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:04:32,041 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:04:32,044 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-23 02:04:32,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:04:32,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:32,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:32,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:04:32,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:04:32,059 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:04:32,060 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-23 02:04:32,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:04:32,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:32,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:32,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:04:32,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:04:32,066 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2024-11-23 02:04:32,066 INFO L747 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2024-11-23 02:04:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:04:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84624046] [2024-11-23 02:04:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-11-23 02:04:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14370746] [2024-11-23 02:04:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-11-23 02:04:32,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897706117] [2024-11-23 02:04:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:32,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:33,756 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:04:33,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:04:33,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:04:33,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:04:33,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:04:33,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:33,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:04:33,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:04:33,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-11-23 02:04:33,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:04:33,762 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:04:33,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:33,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:33,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:34,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:34,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:34,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:34,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:04:34,698 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:04:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,706 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-23 02:04:34,708 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-23 02:04:34,713 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-23 02:04:34,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:34,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:34,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:34,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,736 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-23 02:04:34,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,739 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-23 02:04:34,743 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-23 02:04:34,744 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-23 02:04:34,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:34,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:34,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:34,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,768 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-23 02:04:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,770 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-23 02:04:34,771 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-23 02:04:34,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-23 02:04:34,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:34,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:34,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,800 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-23 02:04:34,801 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-23 02:04:34,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-23 02:04:34,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:34,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:34,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:34,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,830 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-23 02:04:34,830 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-23 02:04:34,832 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-23 02:04:34,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:34,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:34,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,855 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-23 02:04:34,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,857 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-23 02:04:34,858 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-23 02:04:34,861 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-23 02:04:34,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:34,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:34,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:34,884 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-23 02:04:34,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,886 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-23 02:04:34,888 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-23 02:04:34,890 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-23 02:04:34,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:34,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:34,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:34,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:34,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:34,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:34,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:04:34,931 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-23 02:04:34,931 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-23 02:04:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:34,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:34,940 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-23 02:04:34,948 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-23 02:04:34,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:04:34,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:04:34,964 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:04:34,964 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-11-23 02:04:34,974 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-23 02:04:35,184 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-11-23 02:04:35,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-23 02:04:35,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-23 02:04:35,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-23 02:04:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:35,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:04:35,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:35,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:04:35,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:35,339 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-23 02:04:35,388 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-23 02:04:35,390 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-23 02:04:35,446 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-23 02:04:35,453 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-23 02:04:35,460 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-23 02:04:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-11-23 02:04:35,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-23 02:04:35,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:35,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-23 02:04:35,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:35,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-23 02:04:35,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:35,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-11-23 02:04:35,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:04:35,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-11-23 02:04:35,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-23 02:04:35,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:04:35,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-23 02:04:35,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:35,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:04:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-23 02:04:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-23 02:04:35,521 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-23 02:04:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-23 02:04:35,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:04:35,526 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-23 02:04:35,526 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:04:35,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-23 02:04:35,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-23 02:04:35,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:35,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:35,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:04:35,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:04:35,527 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 224#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-23 02:04:35,527 INFO L747 eck$LassoCheckResult]: Loop: 215#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 218#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-23 02:04:35,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2024-11-23 02:04:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809220187] [2024-11-23 02:04:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:35,783 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-23 02:04:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809220187] [2024-11-23 02:04:35,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809220187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:04:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:04:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:04:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847124368] [2024-11-23 02:04:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:04:35,789 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:04:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2024-11-23 02:04:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270954961] [2024-11-23 02:04:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:35,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:35,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:04:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:04:35,970 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-23 02:04:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:36,003 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-23 02:04:36,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-23 02:04:36,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 02:04:36,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-11-23 02:04:36,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-23 02:04:36,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-23 02:04:36,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-23 02:04:36,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:36,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-23 02:04:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-23 02:04:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-23 02:04:36,011 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-23 02:04:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-23 02:04:36,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-23 02:04:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:36,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-23 02:04:36,015 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:04:36,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-23 02:04:36,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 02:04:36,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:36,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:36,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-11-23 02:04:36,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-11-23 02:04:36,018 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 260#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 259#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-23 02:04:36,018 INFO L747 eck$LassoCheckResult]: Loop: 266#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 267#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 257#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-23 02:04:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2024-11-23 02:04:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573970642] [2024-11-23 02:04:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2024-11-23 02:04:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:36,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935050481] [2024-11-23 02:04:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:36,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 1 times [2024-11-23 02:04:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087142362] [2024-11-23 02:04:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:36,202 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-23 02:04:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:36,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:37,110 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:04:37,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:04:37,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:04:37,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:04:37,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:04:37,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:37,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:04:37,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:04:37,111 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-11-23 02:04:37,111 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:04:37,111 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:04:37,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:37,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:37,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:37,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:37,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:38,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:04:38,082 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:04:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,084 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-23 02:04:38,085 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-23 02:04:38,086 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-23 02:04:38,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:38,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:38,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:38,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-23 02:04:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,106 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-23 02:04:38,108 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-23 02:04:38,109 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-23 02:04:38,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:38,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:38,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:38,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 02:04:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,133 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-23 02:04:38,134 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-23 02:04:38,135 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-23 02:04:38,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:38,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:38,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:38,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:38,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,159 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-23 02:04:38,160 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-23 02:04:38,161 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-23 02:04:38,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:38,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:38,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:38,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,186 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-23 02:04:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,190 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-23 02:04:38,192 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-23 02:04:38,193 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-23 02:04:38,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:38,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:38,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,231 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-23 02:04:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,233 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-23 02:04:38,234 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-23 02:04:38,235 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-23 02:04:38,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:38,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:38,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,274 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-23 02:04:38,276 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-23 02:04:38,277 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-23 02:04:38,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:38,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:38,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:04:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,319 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-23 02:04:38,320 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-23 02:04:38,325 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-23 02:04:38,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:38,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:38,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:38,358 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-23 02:04:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,361 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-23 02:04:38,362 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-23 02:04:38,363 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-23 02:04:38,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:38,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:38,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:38,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:38,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:38,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:38,380 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:04:38,390 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:04:38,390 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-23 02:04:38,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:38,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:38,393 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-23 02:04:38,393 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-23 02:04:38,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:04:38,405 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:04:38,406 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:04:38,406 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-23 02:04:38,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-23 02:04:38,579 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2024-11-23 02:04:38,584 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-11-23 02:04:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:38,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:04:38,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:38,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:04:38,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:38,700 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-23 02:04:38,724 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-23 02:04:38,725 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-23 02:04:38,725 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-23 02:04:38,736 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-23 02:04:38,737 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-23 02:04:38,737 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-23 02:04:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-23 02:04:38,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-11-23 02:04:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-23 02:04:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:38,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-11-23 02:04:38,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:38,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-23 02:04:38,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-23 02:04:38,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-11-23 02:04:38,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-23 02:04:38,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-23 02:04:38,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-11-23 02:04:38,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:38,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-23 02:04:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-11-23 02:04:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-23 02:04:38,745 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-23 02:04:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-23 02:04:38,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-23 02:04:38,747 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-23 02:04:38,747 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:04:38,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-23 02:04:38,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-23 02:04:38,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:38,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:38,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-23 02:04:38,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:04:38,749 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 525#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 519#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 517#L24-2 [2024-11-23 02:04:38,749 INFO L747 eck$LassoCheckResult]: Loop: 517#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 517#L24-2 [2024-11-23 02:04:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2024-11-23 02:04:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010303908] [2024-11-23 02:04:38,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:38,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:04:38,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:38,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:38,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:38,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2024-11-23 02:04:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102453800] [2024-11-23 02:04:38,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:38,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:04:38,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:38,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:38,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:38,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 3 times [2024-11-23 02:04:38,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:38,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355968347] [2024-11-23 02:04:38,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:04:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:38,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 02:04:38,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:38,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:38,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:38,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:04:40,233 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:04:40,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:04:40,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:04:40,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:04:40,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:04:40,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:40,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:04:40,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:04:40,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-11-23 02:04:40,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:04:40,234 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:04:40,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:40,926 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:04:40,926 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:04:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:40,928 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-23 02:04:40,931 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-23 02:04:40,931 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-23 02:04:40,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:40,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:40,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:40,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:40,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:40,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:40,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:40,953 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-23 02:04:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:40,959 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-23 02:04:40,960 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-23 02:04:40,961 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-23 02:04:40,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:40,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:40,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:40,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:40,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:40,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:40,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:40,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-23 02:04:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:40,985 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-23 02:04:40,986 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-23 02:04:40,987 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-23 02:04:40,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:40,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:40,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:40,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:40,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:40,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:41,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:41,006 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-23 02:04:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:41,012 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-23 02:04:41,035 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-23 02:04:41,036 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-23 02:04:41,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:41,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:41,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:41,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:41,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:41,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:41,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:04:41,067 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-23 02:04:41,067 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-23 02:04:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:41,072 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-23 02:04:41,074 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-23 02:04:41,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:04:41,086 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:04:41,086 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:04:41,086 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x0~0#1.base) 0)_2 + 1 Supporting invariants [] [2024-11-23 02:04:41,093 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-23 02:04:41,163 INFO L156 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2024-11-23 02:04:41,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-23 02:04:41,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-23 02:04:41,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-23 02:04:41,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:41,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:04:41,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:41,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 02:04:41,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:41,256 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-23 02:04:41,257 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-23 02:04:41,257 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-23 02:04:41,294 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-23 02:04:41,295 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-23 02:04:41,295 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-23 02:04:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-23 02:04:41,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-23 02:04:41,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:41,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-23 02:04:41,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:41,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-23 02:04:41,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:41,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-23 02:04:41,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-23 02:04:41,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-11-23 02:04:41,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-23 02:04:41,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-23 02:04:41,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-11-23 02:04:41,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:41,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-23 02:04:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-11-23 02:04:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-23 02:04:41,301 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-23 02:04:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-23 02:04:41,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-23 02:04:41,301 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-23 02:04:41,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:04:41,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-11-23 02:04:41,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-23 02:04:41,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:41,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:41,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-23 02:04:41,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-23 02:04:41,303 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 823#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 813#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-23 02:04:41,303 INFO L747 eck$LassoCheckResult]: Loop: 843#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 854#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 839#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-23 02:04:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2024-11-23 02:04:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393414630] [2024-11-23 02:04:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:41,373 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-23 02:04:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:41,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393414630] [2024-11-23 02:04:41,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393414630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:04:41,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:04:41,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:04:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713578154] [2024-11-23 02:04:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:04:41,374 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:04:41,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2024-11-23 02:04:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759274052] [2024-11-23 02:04:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:41,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:41,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:04:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:04:41,613 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-23 02:04:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:41,627 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-23 02:04:41,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-11-23 02:04:41,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-23 02:04:41,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-11-23 02:04:41,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-23 02:04:41,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-23 02:04:41,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-11-23 02:04:41,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:41,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-23 02:04:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-11-23 02:04:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-23 02:04:41,632 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-23 02:04:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-23 02:04:41,632 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-23 02:04:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:41,633 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-23 02:04:41,633 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:04:41,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-23 02:04:41,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-23 02:04:41,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:41,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:41,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-11-23 02:04:41,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:04:41,634 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 919#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 938#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 921#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 909#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 907#L24-2 [2024-11-23 02:04:41,634 INFO L747 eck$LassoCheckResult]: Loop: 907#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 907#L24-2 [2024-11-23 02:04:41,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,635 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 4 times [2024-11-23 02:04:41,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:41,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570126211] [2024-11-23 02:04:41,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:04:41,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:41,645 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:04:41,645 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:04:41,794 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-23 02:04:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570126211] [2024-11-23 02:04:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570126211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:04:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98404722] [2024-11-23 02:04:41,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:04:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:04:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:41,797 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:04:41,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-23 02:04:41,854 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:04:41,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:04:41,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:04:41,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:41,860 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-23 02:04:41,879 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-23 02:04:41,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 02:04:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98404722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:04:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 02:04:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-23 02:04:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354017793] [2024-11-23 02:04:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:04:41,880 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:04:41,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2024-11-23 02:04:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908091900] [2024-11-23 02:04:41,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:04:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:41,884 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:04:41,884 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:41,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:41,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:04:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 02:04:41,950 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-23 02:04:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:41,965 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-23 02:04:41,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-11-23 02:04:41,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-23 02:04:41,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-11-23 02:04:41,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-23 02:04:41,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-23 02:04:41,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-11-23 02:04:41,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:41,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-23 02:04:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-11-23 02:04:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-23 02:04:41,967 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-23 02:04:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-23 02:04:41,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-23 02:04:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:41,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-23 02:04:41,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:04:41,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-11-23 02:04:41,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-23 02:04:41,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:41,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:41,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-23 02:04:41,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-23 02:04:41,970 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1045#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1038#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1060#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1053#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-23 02:04:41,970 INFO L747 eck$LassoCheckResult]: Loop: 1049#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1039#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1036#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1047#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1056#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-23 02:04:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 5 times [2024-11-23 02:04:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743886822] [2024-11-23 02:04:41,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:04:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:42,002 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-23 02:04:42,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:42,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:42,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash -97586480, now seen corresponding path program 1 times [2024-11-23 02:04:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410428743] [2024-11-23 02:04:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:42,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:42,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:42,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 569106656, now seen corresponding path program 1 times [2024-11-23 02:04:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764861327] [2024-11-23 02:04:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:42,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:42,104 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-23 02:04:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:42,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:44,048 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:04:44,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:04:44,048 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:04:44,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:04:44,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:04:44,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:44,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:04:44,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:04:44,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-11-23 02:04:44,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:04:44,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:04:44,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:44,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:44,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:44,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:44,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:04:45,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:04:45,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:04:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,084 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-23 02:04:45,084 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-23 02:04:45,085 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-23 02:04:45,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:45,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:45,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:45,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,103 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-23 02:04:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,105 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-23 02:04:45,106 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-23 02:04:45,107 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-23 02:04:45,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:04:45,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:04:45,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:04:45,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,125 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-23 02:04:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,127 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-23 02:04:45,128 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-23 02:04:45,129 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-23 02:04:45,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,151 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-23 02:04:45,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,153 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-23 02:04:45,155 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-23 02:04:45,156 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-23 02:04:45,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,178 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-23 02:04:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,184 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-23 02:04:45,186 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-23 02:04:45,186 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-23 02:04:45,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,202 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:04:45,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,217 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-23 02:04:45,217 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:04:45,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,249 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-23 02:04:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,250 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-23 02:04:45,252 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-23 02:04:45,253 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-23 02:04:45,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,287 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-23 02:04:45,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,289 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-23 02:04:45,294 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-23 02:04:45,295 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-23 02:04:45,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,327 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-23 02:04:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,328 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-23 02:04:45,329 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-23 02:04:45,330 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-23 02:04:45,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-23 02:04:45,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,364 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-23 02:04:45,365 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-23 02:04:45,366 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-23 02:04:45,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,418 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-23 02:04:45,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,420 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-23 02:04:45,421 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-23 02:04:45,422 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-23 02:04:45,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,445 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-23 02:04:45,446 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-23 02:04:45,447 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-23 02:04:45,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,468 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-23 02:04:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,470 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-23 02:04:45,471 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-23 02:04:45,472 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-23 02:04:45,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,496 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-23 02:04:45,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,500 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-23 02:04:45,500 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-23 02:04:45,502 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-23 02:04:45,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:04:45,523 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-23 02:04:45,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,525 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-23 02:04:45,525 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-23 02:04:45,527 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-23 02:04:45,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:04:45,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:04:45,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:04:45,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:04:45,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:04:45,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:04:45,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:04:45,549 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-23 02:04:45,549 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-23 02:04:45,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:04:45,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:45,551 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-23 02:04:45,553 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-23 02:04:45,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:04:45,564 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:04:45,564 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:04:45,564 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-11-23 02:04:45,570 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-23 02:04:45,705 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-11-23 02:04:45,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-23 02:04:45,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-23 02:04:45,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-23 02:04:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:45,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:04:45,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:45,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:04:45,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:45,832 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-23 02:04:45,888 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-23 02:04:45,916 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-23 02:04:45,917 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-23 02:04:45,917 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-23 02:04:45,938 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-23 02:04:45,940 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-23 02:04:45,940 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-23 02:04:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-23 02:04:45,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-11-23 02:04:45,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-11-23 02:04:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:45,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-11-23 02:04:45,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:04:45,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-11-23 02:04:45,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-23 02:04:45,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-11-23 02:04:45,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-23 02:04:45,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-23 02:04:45,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-11-23 02:04:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:45,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-23 02:04:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-11-23 02:04:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-23 02:04:45,946 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-23 02:04:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-11-23 02:04:45,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-23 02:04:45,947 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-23 02:04:45,947 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:04:45,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-11-23 02:04:45,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-23 02:04:45,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:45,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:45,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-23 02:04:45,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-23 02:04:45,948 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1409#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1443#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1401#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1399#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1415#L24-2 [2024-11-23 02:04:45,948 INFO L747 eck$LassoCheckResult]: Loop: 1415#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1445#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1411#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1451#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1415#L24-2 [2024-11-23 02:04:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -141984138, now seen corresponding path program 1 times [2024-11-23 02:04:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:45,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534192507] [2024-11-23 02:04:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:04:46,033 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-23 02:04:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534192507] [2024-11-23 02:04:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534192507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:04:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:04:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:04:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035104385] [2024-11-23 02:04:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:04:46,034 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:04:46,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1365622390, now seen corresponding path program 2 times [2024-11-23 02:04:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611583039] [2024-11-23 02:04:46,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:04:46,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:46,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:46,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:04:46,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:04:46,472 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-23 02:04:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:46,495 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-23 02:04:46,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-11-23 02:04:46,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-23 02:04:46,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-11-23 02:04:46,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-23 02:04:46,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-23 02:04:46,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-11-23 02:04:46,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:46,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-23 02:04:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-11-23 02:04:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-23 02:04:46,500 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-23 02:04:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-23 02:04:46,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-23 02:04:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:46,505 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-23 02:04:46,505 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:04:46,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-23 02:04:46,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-23 02:04:46,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:46,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:46,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-11-23 02:04:46,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:04:46,506 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1565#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1557#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1592#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1585#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1572#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-23 02:04:46,506 INFO L747 eck$LassoCheckResult]: Loop: 1620#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-23 02:04:46,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 693278934, now seen corresponding path program 2 times [2024-11-23 02:04:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622949494] [2024-11-23 02:04:46,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:04:46,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:46,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2024-11-23 02:04:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14296354] [2024-11-23 02:04:46,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:04:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,551 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:04:46,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:04:46,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1024996556, now seen corresponding path program 3 times [2024-11-23 02:04:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916888519] [2024-11-23 02:04:46,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:04:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,573 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-23 02:04:46,573 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:04:46,616 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-23 02:04:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:46,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916888519] [2024-11-23 02:04:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916888519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:04:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:04:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:04:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980525669] [2024-11-23 02:04:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:04:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:04:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:04:46,675 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-23 02:04:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:46,693 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-23 02:04:46,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-11-23 02:04:46,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-23 02:04:46,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-11-23 02:04:46,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-23 02:04:46,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-23 02:04:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-11-23 02:04:46,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:04:46,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-23 02:04:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-11-23 02:04:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-23 02:04:46,699 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-23 02:04:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-23 02:04:46,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-23 02:04:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:46,700 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-23 02:04:46,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:04:46,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-11-23 02:04:46,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-23 02:04:46,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:04:46,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:04:46,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-11-23 02:04:46,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-11-23 02:04:46,702 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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1728#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1749#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1723#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1720#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1734#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1757#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1721#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1758#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1732#L24-2 [2024-11-23 02:04:46,702 INFO L747 eck$LassoCheckResult]: Loop: 1732#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1781#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1773#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1718#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1761#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1780#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1772#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1768#L24-2 call main_#t~mem4#1 := read~int#2(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#1(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#1(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#0(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#0(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#3(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#3(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#2(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1732#L24-2 [2024-11-23 02:04:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1450650533, now seen corresponding path program 1 times [2024-11-23 02:04:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086911290] [2024-11-23 02:04:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1011439773, now seen corresponding path program 1 times [2024-11-23 02:04:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002009327] [2024-11-23 02:04:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:04:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:04:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:04:46,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:04:46,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:04:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 783342599, now seen corresponding path program 2 times [2024-11-23 02:04:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:04:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416393015] [2024-11-23 02:04:46,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:04:46,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:04:46,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:04:47,098 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-23 02:04:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:04:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416393015] [2024-11-23 02:04:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416393015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:04:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370679130] [2024-11-23 02:04:47,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:04:47,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:04:47,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:04:47,104 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:04:47,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-23 02:04:47,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:04:47,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:04:47,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:04:47,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:04:47,247 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-23 02:04:47,305 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-23 02:04:47,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:04:47,342 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-23 02:04:47,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370679130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:04:47,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:04:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-23 02:04:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171821914] [2024-11-23 02:04:47,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:04:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:04:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:04:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:04:49,877 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-23 02:04:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:04:49,896 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-23 02:04:49,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-11-23 02:04:49,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:04:49,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-11-23 02:04:49,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:04:49,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:04:49,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:04:49,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:04:49,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:04:49,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:04:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:04:49,898 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:04:49,898 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:04:49,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:04:49,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:04:49,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:04:49,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:04:49 BoogieIcfgContainer [2024-11-23 02:04:49,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:04:49,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:04:49,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:04:49,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:04:49,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:31" (3/4) ... [2024-11-23 02:04:49,909 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:04:49,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:04:49,911 INFO L158 Benchmark]: Toolchain (without parser) took 18449.26ms. Allocated memory was 169.9MB in the beginning and 383.8MB in the end (delta: 213.9MB). Free memory was 98.8MB in the beginning and 190.6MB in the end (delta: -91.8MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,911 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 169.9MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:04:49,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.26ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 86.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 169.9MB. Free memory was 86.8MB in the beginning and 140.0MB in the end (delta: -53.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,912 INFO L158 Benchmark]: Boogie Preprocessor took 32.17ms. Allocated memory is still 169.9MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,912 INFO L158 Benchmark]: RCFGBuilder took 263.96ms. Allocated memory was 169.9MB in the beginning and 264.2MB in the end (delta: 94.4MB). Free memory was 138.0MB in the beginning and 223.5MB in the end (delta: -85.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,912 INFO L158 Benchmark]: BuchiAutomizer took 17908.23ms. Allocated memory was 264.2MB in the beginning and 383.8MB in the end (delta: 119.5MB). Free memory was 223.5MB in the beginning and 190.6MB in the end (delta: 32.9MB). Peak memory consumption was 152.4MB. Max. memory is 16.1GB. [2024-11-23 02:04:49,912 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 383.8MB. Free memory is still 190.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:04:49,914 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.39ms. Allocated memory is still 169.9MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.26ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 86.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 169.9MB. Free memory was 86.8MB in the beginning and 140.0MB in the end (delta: -53.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.17ms. Allocated memory is still 169.9MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 263.96ms. Allocated memory was 169.9MB in the beginning and 264.2MB in the end (delta: 94.4MB). Free memory was 138.0MB in the beginning and 223.5MB in the end (delta: -85.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 17908.23ms. Allocated memory was 264.2MB in the beginning and 383.8MB in the end (delta: 119.5MB). Free memory was 223.5MB in the beginning and 190.6MB in the end (delta: 32.9MB). Peak memory consumption was 152.4MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 383.8MB. Free memory is still 190.6MB. 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#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,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 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 16.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s 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, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 90 mSDtfsCounter, 82 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: 59ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:04:49,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-23 02:04:50,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-23 02:04:50,343 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