./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:41:09,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:41:09,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:41:09,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:41:09,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:41:09,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:41:09,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:41:09,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:41:09,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:41:09,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:41:09,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:41:09,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:41:09,604 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:41:09,605 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:41:09,605 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:41:09,606 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:41:09,607 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:41:09,607 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:41:09,607 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:41:09,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:41:09,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:41:09,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:41:09,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:41:09,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:41:09,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:41:09,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:41:09,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:41:09,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:41:09,611 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:41:09,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:41:09,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:41:09,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:41:09,611 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:41:09,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:41:09,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:41:09,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:41:09,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:41:09,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:41:09,613 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:41:09,613 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2024-10-12 00:41:09,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:41:09,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:41:09,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:41:09,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:41:09,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:41:09,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-10-12 00:41:11,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:41:11,633 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:41:11,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-10-12 00:41:11,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b1b12e331/ad81a46fc8da485689292de98f2e7f88/FLAGd830d3385 [2024-10-12 00:41:11,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b1b12e331/ad81a46fc8da485689292de98f2e7f88 [2024-10-12 00:41:11,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:41:11,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:41:11,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:41:11,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:41:11,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:41:11,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:41:11" (1/1) ... [2024-10-12 00:41:11,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da96e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:11, skipping insertion in model container [2024-10-12 00:41:11,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:41:11" (1/1) ... [2024-10-12 00:41:12,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:41:12,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:41:12,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:41:12,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:41:12,398 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:41:12,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12 WrapperNode [2024-10-12 00:41:12,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:41:12,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:41:12,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:41:12,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:41:12,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,434 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-10-12 00:41:12,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:41:12,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:41:12,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:41:12,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:41:12,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,463 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-12 00:41:12,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:41:12,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:41:12,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:41:12,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:41:12,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (1/1) ... [2024-10-12 00:41:12,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:12,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:12,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:41:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:41:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:41:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:41:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:41:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:41:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:41:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:41:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:41:12,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:41:12,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:41:12,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:41:12,818 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-12 00:41:12,818 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:41:12,834 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:41:12,834 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:41:12,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:12 BoogieIcfgContainer [2024-10-12 00:41:12,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:41:12,836 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:41:12,836 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:41:12,841 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:41:12,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:12,842 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:41:11" (1/3) ... [2024-10-12 00:41:12,843 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e40431f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:41:12, skipping insertion in model container [2024-10-12 00:41:12,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:12,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:41:12" (2/3) ... [2024-10-12 00:41:12,843 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e40431f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:41:12, skipping insertion in model container [2024-10-12 00:41:12,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:41:12,844 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:12" (3/3) ... [2024-10-12 00:41:12,846 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2024-10-12 00:41:12,903 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:41:12,904 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:41:12,904 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:41:12,904 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:41:12,904 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:41:12,904 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:41:12,904 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:41:12,905 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:41:12,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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-12 00:41:12,957 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-10-12 00:41:12,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:12,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:12,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:41:12,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:41:12,963 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:41:12,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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-12 00:41:12,965 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2024-10-12 00:41:12,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:12,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:12,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:41:12,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:41:12,972 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11#L533true assume main_~a~0#1.base == 0 && main_~a~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 2#L525true [2024-10-12 00:41:12,972 INFO L747 eck$LassoCheckResult]: Loop: 2#L525true assume true; 2#L525true [2024-10-12 00:41:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-10-12 00:41:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:12,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042178769] [2024-10-12 00:41:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:13,167 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-12 00:41:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042178769] [2024-10-12 00:41:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042178769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:41:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916442322] [2024-10-12 00:41:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:13,177 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2024-10-12 00:41:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:13,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168222632] [2024-10-12 00:41:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:41:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:41:13,239 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-12 00:41:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:13,257 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-12 00:41:13,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-10-12 00:41:13,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-10-12 00:41:13,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 20 transitions. [2024-10-12 00:41:13,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:41:13,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:41:13,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2024-10-12 00:41:13,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:13,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-12 00:41:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2024-10-12 00:41:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-12 00:41:13,291 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-12 00:41:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-12 00:41:13,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-12 00:41:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:41:13,297 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-12 00:41:13,297 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:41:13,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-12 00:41:13,299 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-10-12 00:41:13,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:13,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:13,299 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:41:13,299 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:41:13,299 INFO L745 eck$LassoCheckResult]: Stem: 67#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 64#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 65#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 56#L537-5 [2024-10-12 00:41:13,300 INFO L747 eck$LassoCheckResult]: Loop: 56#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 58#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 59#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 61#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 55#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56#L537-5 [2024-10-12 00:41:13,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2024-10-12 00:41:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:13,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46796649] [2024-10-12 00:41:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:13,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 43044216, now seen corresponding path program 1 times [2024-10-12 00:41:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369617076] [2024-10-12 00:41:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:13,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2099908596, now seen corresponding path program 1 times [2024-10-12 00:41:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419150276] [2024-10-12 00:41:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:13,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:14,233 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:41:14,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:41:14,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:41:14,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:41:14,236 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:41:14,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:14,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:41:14,237 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:41:14,237 INFO L132 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2024-10-12 00:41:14,237 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:41:14,237 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:41:14,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:14,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:41:15,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:41:15,042 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:41:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:41:15,049 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-12 00:41:15,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:41:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:41:15,093 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-12 00:41:15,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:41:15,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:41:15,133 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-12 00:41:15,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:41:15,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:41:15,177 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-12 00:41:15,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:41:15,216 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-12 00:41:15,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:41:15,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:41:15,251 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-12 00:41:15,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:41:15,292 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-12 00:41:15,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:41:15,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:41:15,321 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-12 00:41:15,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:41:15,348 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-12 00:41:15,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,380 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:41:15,382 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-12 00:41:15,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:41:15,414 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-12 00:41:15,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:41:15,450 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-12 00:41:15,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:41:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,482 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:41:15,485 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-12 00:41:15,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,524 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:41:15,526 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-12 00:41:15,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:41:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,561 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:41:15,563 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-12 00:41:15,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:41:15,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:41:15,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:41:15,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:41:15,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,599 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:41:15,602 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-12 00:41:15,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:15,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,640 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:41:15,643 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-12 00:41:15,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:41:15,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:41:15,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,677 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:41: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-12 00:41:15,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:41:15,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:41:15,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:41:15,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:41:15,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:41:15,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:41:15,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:41:15,712 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-12 00:41:15,712 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-12 00:41:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:41:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:15,737 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:41:15,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:41:15,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:41:15,750 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:41:15,750 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:41:15,751 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 59 Supporting invariants [] [2024-10-12 00:41:15,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:41:15,783 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-12 00:41:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:15,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:41:15,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:15,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:41:15,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:15,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:41:15,956 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-12 00:41:15,959 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-12 00:41:15,960 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.25) 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-12 00:41:16,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.25) 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) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-10-12 00:41:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:41:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) 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-12 00:41:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-12 00:41:16,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 5 letters. [2024-10-12 00:41:16,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:16,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 5 letters. [2024-10-12 00:41:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 10 letters. [2024-10-12 00:41:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:41:16,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-12 00:41:16,038 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-12 00:41:16,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 30 transitions. [2024-10-12 00:41:16,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:41:16,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:41:16,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-10-12 00:41:16,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:16,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-12 00:41:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-10-12 00:41:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-12 00:41:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-12 00:41:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-12 00:41:16,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 00:41:16,045 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 00:41:16,045 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:41:16,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-10-12 00:41:16,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-12 00:41:16,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:16,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:16,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:16,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:41:16,048 INFO L745 eck$LassoCheckResult]: Stem: 188#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 184#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 185#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 186#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 176#L537-1 assume !main_#t~short5#1; 177#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 180#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 189#L549-2 [2024-10-12 00:41:16,048 INFO L747 eck$LassoCheckResult]: Loop: 189#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 190#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 191#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 189#L549-2 [2024-10-12 00:41:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 206288184, now seen corresponding path program 1 times [2024-10-12 00:41:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251135706] [2024-10-12 00:41:16,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:16,178 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-12 00:41:16,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:16,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251135706] [2024-10-12 00:41:16,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251135706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:16,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:16,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:41:16,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219079450] [2024-10-12 00:41:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:16,180 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 1 times [2024-10-12 00:41:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099026187] [2024-10-12 00:41:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:16,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:41:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:41:16,283 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:16,316 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-12 00:41:16,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-10-12 00:41:16,317 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-10-12 00:41:16,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2024-10-12 00:41:16,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:41:16,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:41:16,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2024-10-12 00:41:16,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:16,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-12 00:41:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2024-10-12 00:41:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2024-10-12 00:41:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-12 00:41:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-12 00:41:16,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-12 00:41:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:41:16,322 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-12 00:41:16,322 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:41:16,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-10-12 00:41:16,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-12 00:41:16,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:16,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:16,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:16,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:41:16,324 INFO L745 eck$LassoCheckResult]: Stem: 253#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 247#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 248#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 249#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 238#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 239#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 242#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 254#L549-2 [2024-10-12 00:41:16,324 INFO L747 eck$LassoCheckResult]: Loop: 254#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 255#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 256#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 254#L549-2 [2024-10-12 00:41:16,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 206286262, now seen corresponding path program 1 times [2024-10-12 00:41:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998277535] [2024-10-12 00:41:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash 76912, now seen corresponding path program 2 times [2024-10-12 00:41:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627811829] [2024-10-12 00:41:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -624122213, now seen corresponding path program 1 times [2024-10-12 00:41:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830931632] [2024-10-12 00:41:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:16,531 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-12 00:41:16,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:16,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830931632] [2024-10-12 00:41:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830931632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:41:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588636945] [2024-10-12 00:41:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:16,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:41:16,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:41:16,616 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12 00:41:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:16,687 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-12 00:41:16,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-10-12 00:41:16,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2024-10-12 00:41:16,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2024-10-12 00:41:16,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:41:16,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:41:16,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-12 00:41:16,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:16,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-12 00:41:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-12 00:41:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-12 00:41:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-12 00:41:16,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-12 00:41:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:41:16,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-12 00:41:16,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:41:16,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2024-10-12 00:41:16,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2024-10-12 00:41:16,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:16,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:16,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:16,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:41:16,694 INFO L745 eck$LassoCheckResult]: Stem: 323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 317#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 318#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 319#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 320#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 329#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 313#L540 assume main_~t~0#1.base == 0 && main_~t~0#1.offset == 0;assume { :begin_inline_myexit } true;myexit_#in~s#1 := 1;havoc myexit_~s#1;myexit_~s#1 := myexit_#in~s#1; 322#L525-1 [2024-10-12 00:41:16,694 INFO L747 eck$LassoCheckResult]: Loop: 322#L525-1 assume true; 322#L525-1 [2024-10-12 00:41:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash 206286315, now seen corresponding path program 1 times [2024-10-12 00:41:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077924530] [2024-10-12 00:41:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:16,714 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-12 00:41:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077924530] [2024-10-12 00:41:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077924530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:41:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322973657] [2024-10-12 00:41:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:16,715 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 116, now seen corresponding path program 1 times [2024-10-12 00:41:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038519569] [2024-10-12 00:41:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:41:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:41:16,723 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:41:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:16,730 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2024-10-12 00:41:16,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2024-10-12 00:41:16,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:16,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 28 transitions. [2024-10-12 00:41:16,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:41:16,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:41:16,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-10-12 00:41:16,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:16,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-12 00:41:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-10-12 00:41:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 00:41:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-12 00:41:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-12 00:41:16,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-12 00:41:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:41:16,734 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-12 00:41:16,734 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:41:16,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-12 00:41:16,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:16,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:16,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:16,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:16,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:41:16,735 INFO L745 eck$LassoCheckResult]: Stem: 377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 371#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 372#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 373#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 363#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 364#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 367#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 376#L549-2 assume !(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0); 369#L549-3 main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; 362#L557-2 [2024-10-12 00:41:16,735 INFO L747 eck$LassoCheckResult]: Loop: 362#L557-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_~p~0#1.base, main_~p~0#1.offset := main_~tmp~0#1.base, main_~tmp~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset; 362#L557-2 [2024-10-12 00:41:16,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash 672603628, now seen corresponding path program 1 times [2024-10-12 00:41:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332702198] [2024-10-12 00:41:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:16,767 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-12 00:41:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332702198] [2024-10-12 00:41:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332702198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:41:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:41:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:41:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051055687] [2024-10-12 00:41:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:41:16,768 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2024-10-12 00:41:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669628197] [2024-10-12 00:41:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:16,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:41:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:41:16,826 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-12 00:41:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:16,853 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-12 00:41:16,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-10-12 00:41:16,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:16,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 30 transitions. [2024-10-12 00:41:16,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:41:16,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:41:16,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-10-12 00:41:16,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:16,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:41:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-10-12 00:41:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-10-12 00:41:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-12 00:41:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 00:41:16,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:41:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:41:16,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:41:16,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:41:16,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-10-12 00:41:16,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:16,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:16,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:16,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:16,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:41:16,858 INFO L745 eck$LassoCheckResult]: Stem: 437#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 433#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 434#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 435#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 427#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 428#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 430#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 422#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 423#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 425#L537-1 assume !main_#t~short5#1; 426#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 429#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 438#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-10-12 00:41:16,859 INFO L747 eck$LassoCheckResult]: Loop: 439#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 440#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 441#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 439#L550 [2024-10-12 00:41:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1728225128, now seen corresponding path program 1 times [2024-10-12 00:41:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363094498] [2024-10-12 00:41:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363094498] [2024-10-12 00:41:16,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363094498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:41:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37626425] [2024-10-12 00:41:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:41:16,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:16,922 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:41:16,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-12 00:41:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:17,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:41:17,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:17,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:41:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37626425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:41:17,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:41:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-12 00:41:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236099614] [2024-10-12 00:41:17,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:41:17,070 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:41:17,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 3 times [2024-10-12 00:41:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130029764] [2024-10-12 00:41:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:41:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:41:17,169 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-12 00:41:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:17,264 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2024-10-12 00:41:17,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2024-10-12 00:41:17,265 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 7 [2024-10-12 00:41:17,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 74 transitions. [2024-10-12 00:41:17,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-10-12 00:41:17,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-10-12 00:41:17,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 74 transitions. [2024-10-12 00:41:17,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:17,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 74 transitions. [2024-10-12 00:41:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 74 transitions. [2024-10-12 00:41:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2024-10-12 00:41:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 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-12 00:41:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-12 00:41:17,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-12 00:41:17,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:41:17,277 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-12 00:41:17,277 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:41:17,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-10-12 00:41:17,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:17,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:17,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:17,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:17,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:41:17,278 INFO L745 eck$LassoCheckResult]: Stem: 621#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 614#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 615#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 616#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 617#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 638#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 619#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 620#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 618#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 606#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 607#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 610#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 622#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-10-12 00:41:17,279 INFO L747 eck$LassoCheckResult]: Loop: 623#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 624#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 625#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 623#L550 [2024-10-12 00:41:17,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1728165546, now seen corresponding path program 1 times [2024-10-12 00:41:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:17,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903999604] [2024-10-12 00:41:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 4 times [2024-10-12 00:41:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787428070] [2024-10-12 00:41:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:17,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:17,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash 6864355, now seen corresponding path program 1 times [2024-10-12 00:41:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:17,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33988234] [2024-10-12 00:41:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33988234] [2024-10-12 00:41:17,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33988234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:41:17,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224394263] [2024-10-12 00:41:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:17,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:41:17,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:17,587 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:41:17,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-12 00:41:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:17,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 00:41:17,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:17,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:41:17,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 00:41:17,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 00:41:17,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 00:41:17,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 00:41:17,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:41:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:17,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:41:18,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:41:18,161 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-12 00:41:18,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:41:18,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2024-10-12 00:41:18,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-12 00:41:18,195 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-12 00:41:18,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-12 00:41:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224394263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:41:18,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:41:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-10-12 00:41:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611910147] [2024-10-12 00:41:18,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:41:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 00:41:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=250, Unknown=5, NotChecked=0, Total=306 [2024-10-12 00:41:18,468 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 10 Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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-12 00:41:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:18,681 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-12 00:41:18,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-10-12 00:41:18,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:18,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 44 transitions. [2024-10-12 00:41:18,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:41:18,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:41:18,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2024-10-12 00:41:18,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:41:18,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-12 00:41:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2024-10-12 00:41:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-12 00:41:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 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-12 00:41:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-12 00:41:18,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-12 00:41:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:41:18,690 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-12 00:41:18,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:41:18,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2024-10-12 00:41:18,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-12 00:41:18,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:41:18,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:41:18,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:41:18,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:41:18,691 INFO L745 eck$LassoCheckResult]: Stem: 829#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 821#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~post11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset, main_~i~0#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 822#L533 assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); 823#L533-1 havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 824#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 825#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 842#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 840#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 838#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 826#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 816#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 817#L537-3 assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; 819#L540 assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); 811#L540-1 call write~$Pointer$#1(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 812#L537-5 main_#t~short5#1 := main_~i~0#1 < 30; 814#L537-1 assume main_#t~short5#1;havoc main_#t~nondet4#1;main_#t~short5#1 := 0 != main_#t~nondet4#1; 815#L537-3 assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; 818#L537-6 call write~int#1(main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset;main_~i~0#1 := 0; 827#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-10-12 00:41:18,691 INFO L747 eck$LassoCheckResult]: Loop: 828#L550 assume !(1 != main_#t~mem9#1);havoc main_#t~mem9#1; 830#L550-2 call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#1(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 831#L549-2 assume !!(main_~p~0#1.base != 0 || main_~p~0#1.offset != 0);call main_#t~mem9#1 := read~int#1(main_~p~0#1.base, main_~p~0#1.offset, 4); 828#L550 [2024-10-12 00:41:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 46254041, now seen corresponding path program 2 times [2024-10-12 00:41:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945102637] [2024-10-12 00:41:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:18,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:18,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 90412, now seen corresponding path program 5 times [2024-10-12 00:41:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679543153] [2024-10-12 00:41:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:18,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:41:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:41:18,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:41:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:41:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -730305964, now seen corresponding path program 2 times [2024-10-12 00:41:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:41:18,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980638437] [2024-10-12 00:41:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:41:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:41:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:41:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:41:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980638437] [2024-10-12 00:41:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980638437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:41:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861151610] [2024-10-12 00:41:19,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:41:19,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:41:19,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:41:19,233 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:41:19,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-12 00:41:19,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:41:19,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:41:19,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-12 00:41:19,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:41:19,406 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-12 00:41:19,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 00:41:19,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 00:41:19,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 00:41:19,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:41:19,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-12 00:41:19,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 00:41:19,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 00:41:19,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 00:41:19,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 00:41:19,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 00:41:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:19,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:41:19,932 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-12 00:41:19,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-12 00:41:20,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:41:20,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-12 00:41:20,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 00:41:20,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 130 [2024-10-12 00:41:20,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2024-10-12 00:41:20,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-10-12 00:41:20,075 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-12 00:41:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-10-12 00:41:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:41:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861151610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:41:20,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:41:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-10-12 00:41:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018920032] [2024-10-12 00:41:20,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:41:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:41:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 00:41:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2024-10-12 00:41:20,300 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 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-12 00:41:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:41:20,498 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-12 00:41:20,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-10-12 00:41:20,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:41:20,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2024-10-12 00:41:20,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:41:20,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:41:20,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:41:20,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:41:20,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:41:20,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:41:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:41:20,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:41:20,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:41:20,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:41:20,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:41:20,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:41:20,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:41:20 BoogieIcfgContainer [2024-10-12 00:41:20,507 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:41:20,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:41:20,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:41:20,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:41:20,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:41:12" (3/4) ... [2024-10-12 00:41:20,509 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:41:20,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:41:20,511 INFO L158 Benchmark]: Toolchain (without parser) took 8543.42ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 105.9MB in the beginning and 75.4MB in the end (delta: 30.5MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,511 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:41:20,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.32ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 87.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.78ms. Allocated memory is still 151.0MB. Free memory was 87.0MB in the beginning and 84.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,512 INFO L158 Benchmark]: Boogie Preprocessor took 46.32ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 82.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,512 INFO L158 Benchmark]: RCFGBuilder took 352.60ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 68.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,512 INFO L158 Benchmark]: BuchiAutomizer took 7671.17ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 68.1MB in the beginning and 75.4MB in the end (delta: -7.3MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2024-10-12 00:41:20,512 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 251.7MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:41:20,514 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.11ms. Allocated memory is still 151.0MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.32ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 87.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.78ms. Allocated memory is still 151.0MB. Free memory was 87.0MB in the beginning and 84.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.32ms. Allocated memory is still 151.0MB. Free memory was 84.8MB in the beginning and 82.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 352.60ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 68.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7671.17ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 68.1MB in the beginning and 75.4MB in the end (delta: -7.3MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 251.7MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (8 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 59) and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 6.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 59 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 112 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital247 mio100 ax107 hnf100 lsp86 ukn42 mio100 lsp26 div100 bol100 ite100 ukn100 eq146 hnf97 smp100 dnf151 smp85 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:41:20,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-12 00:41:20,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:20,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:41:21,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE