./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-13 16:55:03,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:55:03,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:55:03,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:55:03,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:55:03,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:55:03,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:55:03,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:55:03,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:55:03,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:55:03,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:55:03,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:55:03,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:55:03,292 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:55:03,293 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:55:03,293 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:55:03,293 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:55:03,294 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:55:03,294 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:55:03,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:55:03,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:55:03,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:55:03,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:55:03,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:55:03,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:55:03,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:55:03,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:55:03,297 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:55:03,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:55:03,297 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:55:03,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:55:03,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:55:03,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:55:03,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:55:03,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:55:03,301 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:55:03,301 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-10-13 16:55:03,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:55:03,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:55:03,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:55:03,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:55:03,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:55:03,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-10-13 16:55:05,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:55:05,202 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:55:05,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-10-13 16:55:05,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d4ba6e2/4f4ac9ee23d04c18ad5ed115357178de/FLAG8bff77883 [2024-10-13 16:55:05,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d4ba6e2/4f4ac9ee23d04c18ad5ed115357178de [2024-10-13 16:55:05,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:55:05,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:55:05,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:55:05,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:55:05,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:55:05,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6492cc03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05, skipping insertion in model container [2024-10-13 16:55:05,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:55:05,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:55:05,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:55:05,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:55:05,847 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:55:05,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05 WrapperNode [2024-10-13 16:55:05,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:55:05,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:55:05,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:55:05,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:55:05,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,876 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-10-13 16:55:05,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:55:05,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:55:05,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:55:05,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:55:05,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,903 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 3, 3, 2]. [2024-10-13 16:55:05,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:55:05,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:55:05,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:55:05,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:55:05,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (1/1) ... [2024-10-13 16:55:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:05,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:05,949 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-10-13 16:55:05,951 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-10-13 16:55:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 16:55:05,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 16:55:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 16:55:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 16:55:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:55:05,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:55:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 16:55:05,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 16:55:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 16:55:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 16:55:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 16:55:05,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 16:55:06,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:55:06,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:55:06,204 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-13 16:55:06,204 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:55:06,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:55:06,229 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:55:06,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:06 BoogieIcfgContainer [2024-10-13 16:55:06,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:55:06,231 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:55:06,231 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:55:06,239 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:55:06,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:06,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:55:05" (1/3) ... [2024-10-13 16:55:06,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75bd8d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:55:06, skipping insertion in model container [2024-10-13 16:55:06,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:06,241 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:55:05" (2/3) ... [2024-10-13 16:55:06,242 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75bd8d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:55:06, skipping insertion in model container [2024-10-13 16:55:06,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:55:06,242 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:06" (3/3) ... [2024-10-13 16:55:06,243 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-10-13 16:55:06,285 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:55:06,285 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:55:06,285 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:55:06,285 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:55:06,285 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:55:06,286 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:55:06,286 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:55:06,286 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:55:06,289 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-10-13 16:55:06,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:55:06,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:06,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:06,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:55:06,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:55:06,309 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:55:06,309 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-10-13 16:55:06,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:55:06,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:06,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:06,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:55:06,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:55:06,316 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2024-10-13 16:55:06,316 INFO L747 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 8#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2024-10-13 16:55:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:55:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110128148] [2024-10-13 16:55:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:06,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-10-13 16:55:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:06,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817675679] [2024-10-13 16:55:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:06,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-10-13 16:55:06,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:06,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942873244] [2024-10-13 16:55:06,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:06,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:06,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:08,163 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:08,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:08,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:08,164 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:08,164 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:55:08,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:08,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:08,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:08,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-10-13 16:55:08,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:08,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:08,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:08,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:08,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:08,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:08,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:08,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:09,173 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:09,177 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:55:09,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,180 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-10-13 16:55:09,181 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-10-13 16:55:09,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:55:09,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:09,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:09,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:09,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,215 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-10-13 16:55:09,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,218 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-10-13 16:55:09,220 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-10-13 16:55:09,220 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-10-13 16:55:09,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:09,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:09,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:09,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,245 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-10-13 16:55:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,247 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-10-13 16:55:09,249 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-10-13 16:55:09,250 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-10-13 16:55:09,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,298 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-10-13 16:55:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,301 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-10-13 16:55:09,302 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-10-13 16:55:09,303 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-10-13 16:55:09,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 16:55:09,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,342 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-10-13 16:55:09,344 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-10-13 16:55:09,345 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-10-13 16:55:09,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,384 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-10-13 16:55:09,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,387 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-10-13 16:55:09,388 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-10-13 16:55:09,389 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-10-13 16:55:09,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,427 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-10-13 16:55:09,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,429 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-10-13 16:55:09,430 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-10-13 16:55:09,431 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-10-13 16:55:09,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,466 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-10-13 16:55:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,469 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-10-13 16:55:09,471 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-10-13 16:55:09,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-10-13 16:55:09,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,508 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-10-13 16:55:09,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,512 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-10-13 16:55:09,514 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-10-13 16:55:09,515 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-10-13 16:55:09,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,546 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-10-13 16:55:09,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,548 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-10-13 16:55:09,548 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-10-13 16:55:09,549 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-10-13 16:55:09,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,579 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-10-13 16:55:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,581 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-10-13 16:55:09,583 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-10-13 16:55:09,584 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-10-13 16:55:09,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 16:55:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,635 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-10-13 16:55:09,636 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-10-13 16:55:09,637 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-10-13 16:55:09,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,674 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-10-13 16:55:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,677 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-10-13 16:55:09,678 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-10-13 16:55:09,680 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-10-13 16:55:09,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,713 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-10-13 16:55:09,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,715 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-10-13 16:55:09,715 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-10-13 16:55:09,716 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-10-13 16:55:09,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 16:55:09,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,748 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-10-13 16:55:09,749 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-10-13 16:55:09,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:55:09,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:09,782 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-10-13 16:55:09,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,785 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-10-13 16:55:09,786 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-10-13 16:55:09,787 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-10-13 16:55:09,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:09,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:09,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:09,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:09,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:09,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:09,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:55:09,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:55:09,823 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:55:09,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:09,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:09,847 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-10-13 16:55:09,849 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-10-13 16:55:09,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:55:09,866 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 16:55:09,867 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:55:09,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-10-13 16:55:09,882 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-10-13 16:55:09,995 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-10-13 16:55:10,003 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-13 16:55:10,005 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-13 16:55:10,005 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-10-13 16:55:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:10,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:55:10,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:10,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:55:10,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:10,130 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-10-13 16:55:10,132 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-10-13 16:55:10,181 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-10-13 16:55:10,185 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-10-13 16:55:10,189 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-10-13 16:55:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-10-13 16:55:10,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-13 16:55:10,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:10,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-13 16:55:10,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:10,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-13 16:55:10,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:10,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-10-13 16:55:10,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:55:10,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-10-13 16:55:10,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-13 16:55:10,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 16:55:10,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-10-13 16:55:10,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:10,200 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 16:55:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-10-13 16:55:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 16:55:10,222 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-10-13 16:55:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-13 16:55:10,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 16:55:10,225 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-13 16:55:10,225 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:55:10,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-13 16:55:10,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 16:55:10,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:10,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:10,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:55:10,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:55:10,228 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 224#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 221#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-10-13 16:55:10,228 INFO L747 eck$LassoCheckResult]: Loop: 215#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 218#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 219#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-10-13 16:55:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2024-10-13 16:55:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996620750] [2024-10-13 16:55:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:10,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996620750] [2024-10-13 16:55:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996620750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:55:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059982349] [2024-10-13 16:55:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:10,435 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:55:10,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2024-10-13 16:55:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559651471] [2024-10-13 16:55:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:10,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:55:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:55:10,609 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-10-13 16:55:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:10,636 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-13 16:55:10,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-10-13 16:55:10,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:55:10,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-10-13 16:55:10,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 16:55:10,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 16:55:10,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-13 16:55:10,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:10,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-13 16:55:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-13 16:55:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-13 16:55:10,642 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-10-13 16:55:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-13 16:55:10,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 16:55:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:55:10,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-13 16:55:10,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:55:10,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-13 16:55:10,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:55:10,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:10,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:10,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-10-13 16:55:10,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-10-13 16:55:10,647 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 260#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 261#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 259#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 262#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-10-13 16:55:10,647 INFO L747 eck$LassoCheckResult]: Loop: 266#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 267#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 265#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 257#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 270#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-10-13 16:55:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2024-10-13 16:55:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924892830] [2024-10-13 16:55:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2024-10-13 16:55:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017461898] [2024-10-13 16:55:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:10,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 1 times [2024-10-13 16:55:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:10,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866041935] [2024-10-13 16:55:10,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:10,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:11,828 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:11,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:11,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:11,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:11,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:55:11,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:11,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:11,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:11,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-10-13 16:55:11,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:11,830 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:11,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:11,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:11,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:11,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:11,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:12,731 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:12,731 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:55:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,733 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-10-13 16:55:12,735 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-10-13 16:55:12,736 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-10-13 16:55:12,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:12,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:12,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:12,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,758 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-10-13 16:55:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,760 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-10-13 16:55:12,761 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-10-13 16:55:12,762 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-10-13 16:55:12,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:12,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:12,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:12,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,783 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-10-13 16:55:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,785 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-10-13 16:55:12,786 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-10-13 16:55:12,787 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-10-13 16:55:12,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:12,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:12,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:12,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,811 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-10-13 16:55:12,812 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-10-13 16:55:12,812 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-10-13 16:55:12,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:12,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:12,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:12,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 16:55:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,836 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-10-13 16:55:12,836 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-10-13 16:55:12,837 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-10-13 16:55:12,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:12,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:12,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,863 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-10-13 16:55:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,865 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-10-13 16:55:12,865 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-10-13 16:55:12,866 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-10-13 16:55:12,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:12,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:12,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 16:55:12,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,895 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:12,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 16:55:12,897 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-10-13 16:55:12,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:12,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:12,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 16:55:12,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,941 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-10-13 16:55:12,942 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-10-13 16:55:12,944 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-10-13 16:55:12,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:12,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:12,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:12,972 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-10-13 16:55:12,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:12,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:12,974 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-10-13 16:55:12,974 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-10-13 16:55:12,975 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-10-13 16:55:12,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:12,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:12,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:12,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:12,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:12,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:12,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:13,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-13 16:55:13,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,006 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-10-13 16:55:13,008 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-10-13 16:55:13,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:55:13,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:13,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:13,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:13,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:13,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:13,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:13,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:13,040 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-10-13 16:55:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,042 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-10-13 16:55:13,043 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-10-13 16:55:13,043 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-10-13 16:55:13,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:13,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:13,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:13,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:13,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:13,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:13,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:13,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:13,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,070 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-10-13 16:55:13,071 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-10-13 16:55:13,072 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-10-13 16:55:13,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:13,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:13,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:13,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:13,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:13,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:13,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:13,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 16:55:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,106 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-10-13 16:55:13,108 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-10-13 16:55:13,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-10-13 16:55:13,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:13,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:13,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:13,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:13,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:13,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:13,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:13,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-13 16:55:13,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,146 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-10-13 16:55:13,147 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-10-13 16:55:13,149 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-10-13 16:55:13,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:13,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:13,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:13,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:13,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:13,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:13,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:55:13,184 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 16:55:13,184 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 16:55:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:13,186 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-10-13 16:55:13,195 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-10-13 16:55:13,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:55:13,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 16:55:13,208 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:55:13,212 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-10-13 16:55:13,223 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-10-13 16:55:13,319 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2024-10-13 16:55:13,321 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-10-13 16:55:13,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:13,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:55:13,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:13,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:55:13,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:13,413 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-10-13 16:55:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 16:55:13,443 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-10-13 16:55:13,443 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-10-13 16:55:13,456 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-10-13 16:55:13,456 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-10-13 16:55:13,457 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-10-13 16:55:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-13 16:55:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-10-13 16:55:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-10-13 16:55:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-10-13 16:55:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:13,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-10-13 16:55:13,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 16:55:13,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-10-13 16:55:13,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-13 16:55:13,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-13 16:55:13,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-10-13 16:55:13,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:13,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-13 16:55:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-10-13 16:55:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-10-13 16:55:13,463 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-10-13 16:55:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-13 16:55:13,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-13 16:55:13,464 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-13 16:55:13,464 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:55:13,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-10-13 16:55:13,464 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 16:55:13,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:13,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:13,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-13 16:55:13,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:55:13,465 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 525#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 521#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 519#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 522#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 536#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 517#L24-2 [2024-10-13 16:55:13,465 INFO L747 eck$LassoCheckResult]: Loop: 517#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 520#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 517#L24-2 [2024-10-13 16:55:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2024-10-13 16:55:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552141697] [2024-10-13 16:55:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2024-10-13 16:55:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713693908] [2024-10-13 16:55:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 3 times [2024-10-13 16:55:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:13,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470119639] [2024-10-13 16:55:13,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:13,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:14,847 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:14,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:14,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:14,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:14,847 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:55:14,847 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:14,847 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:14,847 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:14,847 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-10-13 16:55:14,847 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:14,847 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:14,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:14,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:14,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:14,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:14,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:15,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:15,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:15,626 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:15,626 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:55:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,630 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-10-13 16:55:15,632 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-10-13 16:55:15,633 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-10-13 16:55:15,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:15,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:15,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:15,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,655 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-10-13 16:55:15,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,656 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-10-13 16:55:15,657 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-10-13 16:55:15,658 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-10-13 16:55:15,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:15,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:15,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:15,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,680 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-10-13 16:55:15,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,681 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-10-13 16:55:15,683 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-10-13 16:55:15,683 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-10-13 16:55:15,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:15,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:15,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:15,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-13 16:55:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,710 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-10-13 16:55:15,711 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-10-13 16:55:15,712 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-10-13 16:55:15,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-13 16:55:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,737 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-10-13 16:55:15,738 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-10-13 16:55:15,739 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-10-13 16:55:15,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 16:55:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,768 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-10-13 16:55:15,768 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-10-13 16:55:15,769 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-10-13 16:55:15,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-13 16:55:15,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,803 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-10-13 16:55:15,804 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-10-13 16:55:15,805 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-10-13 16:55:15,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,828 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-10-13 16:55:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,829 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 16:55:15,831 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-10-13 16:55:15,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:15,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,858 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 16:55:15,859 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-10-13 16:55:15,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-13 16:55:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,886 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 16:55:15,887 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-10-13 16:55:15,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 16:55:15,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,912 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 16:55:15,914 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-10-13 16:55:15,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-13 16:55:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,947 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 16:55:15,949 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-10-13 16:55:15,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:15,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:15,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 16:55:15,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:15,981 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:15,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 16:55:15,984 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-10-13 16:55:15,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:15,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:15,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:15,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:15,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:15,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:16,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:55:16,010 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 16:55:16,010 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-13 16:55:16,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:16,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:16,012 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:16,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 16:55:16,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:55:16,025 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 16:55:16,025 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:55:16,025 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) 0)_2 + 1 Supporting invariants [] [2024-10-13 16:55:16,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:16,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:16,112 INFO L156 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2024-10-13 16:55:16,114 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-13 16:55:16,114 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-13 16:55:16,114 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-10-13 16:55:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:16,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 16:55:16,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:16,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:55:16,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:55:16,234 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-10-13 16:55:16,235 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-10-13 16:55:16,268 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-10-13 16:55:16,268 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-10-13 16:55:16,269 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-10-13 16:55:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-10-13 16:55:16,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-13 16:55:16,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:16,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-13 16:55:16,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:16,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-10-13 16:55:16,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:16,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-10-13 16:55:16,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-13 16:55:16,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-10-13 16:55:16,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-13 16:55:16,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-13 16:55:16,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-10-13 16:55:16,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:16,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-10-13 16:55:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-10-13 16:55:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-13 16:55:16,278 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-10-13 16:55:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-10-13 16:55:16,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-10-13 16:55:16,279 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-10-13 16:55:16,279 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:55:16,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-10-13 16:55:16,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-13 16:55:16,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:16,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:16,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-13 16:55:16,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-10-13 16:55:16,281 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 823#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 822#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 813#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 845#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 842#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-10-13 16:55:16,281 INFO L747 eck$LassoCheckResult]: Loop: 843#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 854#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 853#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 839#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 851#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 838#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-10-13 16:55:16,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:16,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2024-10-13 16:55:16,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:16,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545808391] [2024-10-13 16:55:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 16:55:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545808391] [2024-10-13 16:55:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545808391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:55:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910398762] [2024-10-13 16:55:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:16,384 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:55:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2024-10-13 16:55:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552490022] [2024-10-13 16:55:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:16,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:16,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:16,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:55:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:55:16,637 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-10-13 16:55:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:16,650 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-13 16:55:16,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-10-13 16:55:16,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-13 16:55:16,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-10-13 16:55:16,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-13 16:55:16,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:55:16,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-10-13 16:55:16,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:16,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-13 16:55:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-10-13 16:55:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 16:55:16,657 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-10-13 16:55:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-10-13 16:55:16,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-13 16:55:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:55:16,660 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-13 16:55:16,660 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:55:16,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-10-13 16:55:16,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-13 16:55:16,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:16,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:16,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-10-13 16:55:16,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:55:16,662 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 919#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 938#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 936#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 920#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 921#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 909#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 917#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 922#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 907#L24-2 [2024-10-13 16:55:16,662 INFO L747 eck$LassoCheckResult]: Loop: 907#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 941#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 907#L24-2 [2024-10-13 16:55:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 4 times [2024-10-13 16:55:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472289159] [2024-10-13 16:55:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 16:55:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472289159] [2024-10-13 16:55:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472289159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:55:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151247223] [2024-10-13 16:55:16,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:55:16,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:55:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:16,792 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:55:16,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-10-13 16:55:16,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:55:16,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:55:16,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:55:16,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:16,896 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-10-13 16:55:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 16:55:16,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:55:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151247223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:16,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 16:55:16,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 16:55:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498703840] [2024-10-13 16:55:16,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:16,922 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:55:16,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2024-10-13 16:55:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669408002] [2024-10-13 16:55:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:16,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:16,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:55:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:55:16,984 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-10-13 16:55:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:17,005 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-13 16:55:17,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-10-13 16:55:17,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-13 16:55:17,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-10-13 16:55:17,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 16:55:17,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:55:17,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-10-13 16:55:17,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:17,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 16:55:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-10-13 16:55:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-13 16:55:17,009 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-10-13 16:55:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-13 16:55:17,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-13 16:55:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:55:17,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-13 16:55:17,011 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:55:17,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-10-13 16:55:17,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-13 16:55:17,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:17,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:17,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-13 16:55:17,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-13 16:55:17,013 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1045#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1038#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1041#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1061#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1060#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1055#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1053#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1054#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-10-13 16:55:17,013 INFO L747 eck$LassoCheckResult]: Loop: 1049#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(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#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1039#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1036#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1064#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1046#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1047#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1059#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1056#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1051#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-10-13 16:55:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 5 times [2024-10-13 16:55:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984806345] [2024-10-13 16:55:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -97586480, now seen corresponding path program 1 times [2024-10-13 16:55:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744153394] [2024-10-13 16:55:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:17,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 569106656, now seen corresponding path program 1 times [2024-10-13 16:55:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639641461] [2024-10-13 16:55:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:17,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:18,850 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:55:18,850 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:55:18,850 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:55:18,850 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:55:18,850 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:55:18,850 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:18,850 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:55:18,850 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:55:18,851 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-10-13 16:55:18,851 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:55:18,851 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:55:18,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:18,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:18,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:18,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:19,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:55:19,722 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:55:19,722 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:55:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,724 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10-13 16:55:19,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 16:55:19,731 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-10-13 16:55:19,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:19,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:19,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:19,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:19,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 16:55:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,760 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 16:55:19,761 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-10-13 16:55:19,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:19,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:19,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:19,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:19,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-13 16:55:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,785 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 16:55:19,786 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-10-13 16:55:19,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:55:19,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:55:19,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:55:19,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:19,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 16:55:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,809 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 16:55:19,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:55:19,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:19,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:19,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:19,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,840 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 16:55:19,842 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-10-13 16:55:19,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:19,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:19,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:55:19,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-13 16:55:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,870 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-13 16:55:19,871 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-10-13 16:55:19,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:55:19,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:55:19,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:55:19,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:55:19,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:55:19,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:55:19,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:55:19,890 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 16:55:19,890 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-10-13 16:55:19,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:55:19,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:19,891 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:55:19,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-13 16:55:19,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:55:19,903 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 16:55:19,903 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:55:19,903 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-10-13 16:55:19,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-13 16:55:20,001 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-10-13 16:55:20,002 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 16:55:20,002 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 16:55:20,002 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-13 16:55:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:20,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:55:20,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:20,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:55:20,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:20,107 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-10-13 16:55:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 16:55:20,165 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-10-13 16:55:20,165 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-10-13 16:55:20,183 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-10-13 16:55:20,183 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-10-13 16:55:20,184 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-10-13 16:55:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-10-13 16:55:20,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-10-13 16:55:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:20,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-10-13 16:55:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:20,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-10-13 16:55:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:55:20,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-10-13 16:55:20,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-13 16:55:20,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-10-13 16:55:20,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-13 16:55:20,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-13 16:55:20,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-10-13 16:55:20,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:20,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-13 16:55:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-10-13 16:55:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-13 16:55:20,194 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-10-13 16:55:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-10-13 16:55:20,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-13 16:55:20,196 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-13 16:55:20,196 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:55:20,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-10-13 16:55:20,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-13 16:55:20,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:20,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:20,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 16:55:20,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-13 16:55:20,198 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1409#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1407#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1443#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1442#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1440#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1401#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1402#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1399#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1448#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1431#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(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#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1415#L24-2 [2024-10-13 16:55:20,198 INFO L747 eck$LassoCheckResult]: Loop: 1415#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1449#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1445#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1446#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1410#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1411#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1405#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1451#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1452#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1426#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(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#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1415#L24-2 [2024-10-13 16:55:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -141984138, now seen corresponding path program 1 times [2024-10-13 16:55:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004186720] [2024-10-13 16:55:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:20,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 16:55:20,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:20,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004186720] [2024-10-13 16:55:20,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004186720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:55:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:55:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463788650] [2024-10-13 16:55:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:20,322 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:55:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1365622390, now seen corresponding path program 2 times [2024-10-13 16:55:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966631395] [2024-10-13 16:55:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:55:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:55:20,772 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-10-13 16:55:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:20,789 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-10-13 16:55:20,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-10-13 16:55:20,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-10-13 16:55:20,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-10-13 16:55:20,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-13 16:55:20,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-10-13 16:55:20,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-10-13 16:55:20,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:20,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-10-13 16:55:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-10-13 16:55:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-13 16:55:20,797 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-10-13 16:55:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-10-13 16:55:20,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-13 16:55:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:55:20,801 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-13 16:55:20,801 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 16:55:20,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-10-13 16:55:20,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-10-13 16:55:20,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:20,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:20,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-10-13 16:55:20,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 16:55:20,802 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1565#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1589#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1557#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1591#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1593#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1592#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1590#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1585#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1581#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1573#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(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#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1572#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1579#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-10-13 16:55:20,802 INFO L747 eck$LassoCheckResult]: Loop: 1620#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1623#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-10-13 16:55:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 693278934, now seen corresponding path program 2 times [2024-10-13 16:55:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566569381] [2024-10-13 16:55:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2024-10-13 16:55:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833170718] [2024-10-13 16:55:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:20,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1024996556, now seen corresponding path program 3 times [2024-10-13 16:55:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142416402] [2024-10-13 16:55:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 16:55:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142416402] [2024-10-13 16:55:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142416402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:55:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419790955] [2024-10-13 16:55:20,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:55:20,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:55:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:20,977 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:55:20,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-10-13 16:55:21,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 16:55:21,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:55:21,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:55:21,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:21,083 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-10-13 16:55:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 16:55:21,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:55:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419790955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:55:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 16:55:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-10-13 16:55:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103512058] [2024-10-13 16:55:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:55:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:55:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:55:21,158 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-10-13 16:55:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:21,172 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-10-13 16:55:21,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-10-13 16:55:21,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-13 16:55:21,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-10-13 16:55:21,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-13 16:55:21,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-13 16:55:21,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-10-13 16:55:21,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:55:21,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-10-13 16:55:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-10-13 16:55:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-10-13 16:55:21,178 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-10-13 16:55:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-10-13 16:55:21,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-10-13 16:55:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:55:21,180 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-10-13 16:55:21,180 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 16:55:21,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-10-13 16:55:21,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-13 16:55:21,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:55:21,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:55:21,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-10-13 16:55:21,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-10-13 16:55:21,183 INFO L745 eck$LassoCheckResult]: Stem: 1793#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1794#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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1796#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1819#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1818#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1817#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1816#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1815#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1814#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1791#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1792#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1787#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1788#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1811#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1805#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1803#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1801#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1802#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1810#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1827#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1825#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1823#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1820#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1797#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1789#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1790#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1795#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1826#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1824#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1821#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1822#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1799#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1800#L24-2 [2024-10-13 16:55:21,183 INFO L747 eck$LassoCheckResult]: Loop: 1800#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1828#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1851#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1849#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1847#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1845#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1843#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1841#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1839#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1785#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1786#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1835#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1833#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1812#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1813#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1829#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1852#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1850#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1848#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1846#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1844#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1842#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1840#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1838#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1837#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1836#L24-2 call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1834#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1832#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1831#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1830#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1800#L24-2 [2024-10-13 16:55:21,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1450650533, now seen corresponding path program 1 times [2024-10-13 16:55:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101589584] [2024-10-13 16:55:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:21,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:21,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:21,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1011439773, now seen corresponding path program 1 times [2024-10-13 16:55:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836381403] [2024-10-13 16:55:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:21,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:55:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:55:21,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:55:21,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:55:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 783342599, now seen corresponding path program 2 times [2024-10-13 16:55:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:55:21,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227760674] [2024-10-13 16:55:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:55:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:55:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:55:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 227 proven. 20 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-13 16:55:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:55:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227760674] [2024-10-13 16:55:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227760674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:55:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037758074] [2024-10-13 16:55:21,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:55:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:55:21,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:55:21,549 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:55:21,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-10-13 16:55:21,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:55:21,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:55:21,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:55:21,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:55:21,738 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-10-13 16:55:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-13 16:55:21,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:55:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-13 16:55:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037758074] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:55:21,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:55:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-10-13 16:55:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274877445] [2024-10-13 16:55:21,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:55:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:55:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 16:55:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:55:23,762 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-10-13 16:55:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:55:23,791 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-10-13 16:55:23,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-10-13 16:55:23,791 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 16:55:23,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-10-13 16:55:23,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 16:55:23,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 16:55:23,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 16:55:23,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:55:23,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:55:23,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:55:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:55:23,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:55:23,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 16:55:23,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:55:23,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 16:55:23,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 16:55:23,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:55:23 BoogieIcfgContainer [2024-10-13 16:55:23,799 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:55:23,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:55:23,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:55:23,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:55:23,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:55:06" (3/4) ... [2024-10-13 16:55:23,802 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 16:55:23,803 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:55:23,803 INFO L158 Benchmark]: Toolchain (without parser) took 18184.06ms. Allocated memory was 176.2MB in the beginning and 285.2MB in the end (delta: 109.1MB). Free memory was 120.3MB in the beginning and 138.2MB in the end (delta: -17.9MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,804 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:55:23,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.74ms. Allocated memory is still 176.2MB. Free memory was 119.8MB in the beginning and 108.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.67ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,804 INFO L158 Benchmark]: Boogie Preprocessor took 40.32ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 104.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,805 INFO L158 Benchmark]: RCFGBuilder took 311.88ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 91.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,805 INFO L158 Benchmark]: BuchiAutomizer took 17568.51ms. Allocated memory was 176.2MB in the beginning and 285.2MB in the end (delta: 109.1MB). Free memory was 91.6MB in the beginning and 138.2MB in the end (delta: -46.6MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-10-13 16:55:23,805 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 285.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:55:23,806 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.45ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.74ms. Allocated memory is still 176.2MB. Free memory was 119.8MB in the beginning and 108.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.67ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.32ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 104.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.88ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 91.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 17568.51ms. Allocated memory was 176.2MB in the beginning and 285.2MB in the end (delta: 109.1MB). Free memory was 91.6MB in the beginning and 138.2MB in the end (delta: -46.6MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 285.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.5s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 16.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 90 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq165 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 16:55:23,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2024-10-13 16:55:24,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:24,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2024-10-13 16:55:24,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE