./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:32:06,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:32:06,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:32:06,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:32:06,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:32:06,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:32:06,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:32:06,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:32:06,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:32:06,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:32:06,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:32:06,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:32:06,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:32:06,276 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:32:06,276 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:32:06,276 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:32:06,276 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:32:06,277 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:32:06,277 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:32:06,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:32:06,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:32:06,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:32:06,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:32:06,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:32:06,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:32:06,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:32:06,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:32:06,283 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:32:06,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:32:06,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:32:06,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:32:06,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:32:06,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:32:06,284 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:32:06,284 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2024-11-23 02:32:06,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:32:06,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:32:06,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:32:06,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:32:06,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:32:06,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-23 02:32:07,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:32:08,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:32:08,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-23 02:32:08,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafdd1555/f930bc413d7a44a0ac962118ee6e7920/FLAGfeeca1de5 [2024-11-23 02:32:08,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dafdd1555/f930bc413d7a44a0ac962118ee6e7920 [2024-11-23 02:32:08,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:32:08,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:32:08,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:32:08,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:32:08,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:32:08,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb1700d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08, skipping insertion in model container [2024-11-23 02:32:08,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:32:08,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:32:08,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:32:08,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:32:08,379 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:32:08,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08 WrapperNode [2024-11-23 02:32:08,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:32:08,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:32:08,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:32:08,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:32:08,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,425 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 141 [2024-11-23 02:32:08,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:32:08,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:32:08,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:32:08,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:32:08,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,483 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 8 writes are split as follows [0, 3, 5]. [2024-11-23 02:32:08,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:32:08,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:32:08,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:32:08,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:32:08,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (1/1) ... [2024-11-23 02:32:08,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:08,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:32:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 02:32:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 02:32:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 02:32:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 02:32:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 02:32:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:32:08,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:32:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 02:32:08,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:32:08,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:32:08,934 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-23 02:32:08,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:32:08,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:32:08,945 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-23 02:32:08,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:08 BoogieIcfgContainer [2024-11-23 02:32:08,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:32:08,946 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:32:08,946 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:32:08,949 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:32:08,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:08,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:32:08" (1/3) ... [2024-11-23 02:32:08,951 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f76171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:32:08, skipping insertion in model container [2024-11-23 02:32:08,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:08,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:08" (2/3) ... [2024-11-23 02:32:08,951 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f76171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:32:08, skipping insertion in model container [2024-11-23 02:32:08,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:32:08,952 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:08" (3/3) ... [2024-11-23 02:32:08,953 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2024-11-23 02:32:08,998 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:32:08,998 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:32:08,998 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:32:08,998 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:32:08,998 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:32:08,998 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:32:08,998 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:32:08,999 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:32:09,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:09,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-23 02:32:09,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:09,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:09,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:32:09,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:32:09,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:32:09,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:09,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-23 02:32:09,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:09,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:09,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:32:09,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:32:09,029 INFO L745 eck$LassoCheckResult]: Stem: 33#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 37#L19-3true [2024-11-23 02:32:09,029 INFO L747 eck$LassoCheckResult]: Loop: 37#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 37#L19-3true [2024-11-23 02:32:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:32:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971768498] [2024-11-23 02:32:09,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-23 02:32:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677720629] [2024-11-23 02:32:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:09,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-23 02:32:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493298130] [2024-11-23 02:32:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:09,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:09,787 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:32:09,788 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:32:09,788 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:32:09,788 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:32:09,788 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:32:09,788 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:09,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:32:09,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:32:09,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2024-11-23 02:32:09,789 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:32:09,789 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:32:09,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:09,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:10,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:32:10,473 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:32:10,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 02:32:10,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:10,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:10,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:10,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-23 02:32:10,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 02:32:10,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-23 02:32:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 02:32:10,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:32:10,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:32:10,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:10,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:10,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:10,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 02:32:10,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 02:32:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:32:10,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-23 02:32:10,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:32:10,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:10,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-23 02:32:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,849 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:32:10,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:10,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:10,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:10,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:10,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:10,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:10,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:10,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:32:10,924 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-23 02:32:10,924 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-23 02:32:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:10,947 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:10,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:32:10,949 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:32:10,975 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:32:10,975 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:32:10,975 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0#1) = 1*v_rep(select #length ~#pp~0.base)_1 - 2*ULTIMATE.start_init_~i~0#1 Supporting invariants [] [2024-11-23 02:32:10,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-23 02:32:11,019 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2024-11-23 02:32:11,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:32:11,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:32:11,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:32:11,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:32:11,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:11,147 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:32:11,149 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,194 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 105 transitions. Complement of second has 6 states. [2024-11-23 02:32:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:32:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2024-11-23 02:32:11,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-23 02:32:11,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:11,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-23 02:32:11,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:11,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 02:32:11,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:11,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2024-11-23 02:32:11,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-11-23 02:32:11,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 34 states and 48 transitions. [2024-11-23 02:32:11,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-23 02:32:11,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-23 02:32:11,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2024-11-23 02:32:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:11,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:32:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2024-11-23 02:32:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-23 02:32:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-23 02:32:11,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:32:11,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-23 02:32:11,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:32:11,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2024-11-23 02:32:11,241 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-11-23 02:32:11,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:11,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:11,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:11,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:11,243 INFO L745 eck$LassoCheckResult]: Stem: 234#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 209#L19-3 assume !(init_~i~0#1 < 2); 230#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 225#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 226#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 203#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 204#L27-3 [2024-11-23 02:32:11,243 INFO L747 eck$LassoCheckResult]: Loop: 204#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 233#L28 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 212#L27-2 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 204#L27-3 [2024-11-23 02:32:11,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2024-11-23 02:32:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34182011] [2024-11-23 02:32:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34182011] [2024-11-23 02:32:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34182011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:32:11,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484533236] [2024-11-23 02:32:11,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:11,332 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:11,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2024-11-23 02:32:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170010457] [2024-11-23 02:32:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:11,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:11,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:32:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:32:11,459 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:11,483 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-23 02:32:11,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2024-11-23 02:32:11,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-23 02:32:11,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 37 transitions. [2024-11-23 02:32:11,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-23 02:32:11,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-23 02:32:11,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-23 02:32:11,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:11,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-23 02:32:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-23 02:32:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-23 02:32:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-23 02:32:11,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-23 02:32:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:32:11,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-23 02:32:11,488 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:32:11,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-11-23 02:32:11,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-23 02:32:11,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:11,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:11,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:11,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:11,489 INFO L745 eck$LassoCheckResult]: Stem: 299#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 282#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 272#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 273#L19-3 assume !(init_~i~0#1 < 2); 296#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 292#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 293#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 277#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 278#L27-3 [2024-11-23 02:32:11,489 INFO L747 eck$LassoCheckResult]: Loop: 278#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 298#L28 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 283#L27-2 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 278#L27-3 [2024-11-23 02:32:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2024-11-23 02:32:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072625552] [2024-11-23 02:32:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072625552] [2024-11-23 02:32:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072625552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460915396] [2024-11-23 02:32:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:11,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:11,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 02:32:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:32:11,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:11,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460915396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:11,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-23 02:32:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117994329] [2024-11-23 02:32:11,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:11,632 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2024-11-23 02:32:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60403595] [2024-11-23 02:32:11,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:32:11,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:11,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:11,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:32:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:32:11,679 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:11,696 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-11-23 02:32:11,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-11-23 02:32:11,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-23 02:32:11,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-11-23 02:32:11,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-23 02:32:11,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-23 02:32:11,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-23 02:32:11,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:11,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-23 02:32:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-23 02:32:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-23 02:32:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-23 02:32:11,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-23 02:32:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:32:11,700 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-23 02:32:11,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:32:11,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-11-23 02:32:11,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-23 02:32:11,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:11,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:11,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:11,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:11,702 INFO L745 eck$LassoCheckResult]: Stem: 413#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 396#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 414#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 415#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 386#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 387#L19-3 assume !(init_~i~0#1 < 2); 410#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 406#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 407#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 388#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 389#L27-3 [2024-11-23 02:32:11,702 INFO L747 eck$LassoCheckResult]: Loop: 389#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 412#L28 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 397#L27-2 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 389#L27-3 [2024-11-23 02:32:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2024-11-23 02:32:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936417093] [2024-11-23 02:32:11,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,719 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:32:11,720 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:11,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:11,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:11,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2024-11-23 02:32:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333390881] [2024-11-23 02:32:11,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:32:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,744 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:32:11,744 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:11,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:11,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:11,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2024-11-23 02:32:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:11,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537167730] [2024-11-23 02:32:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:11,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 02:32:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537167730] [2024-11-23 02:32:12,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537167730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:12,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535362402] [2024-11-23 02:32:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:12,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:12,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:12,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 02:32:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:12,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 02:32:12,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:12,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:12,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:12,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:12,292 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 27 treesize of output 11 [2024-11-23 02:32:12,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:12,296 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 21 treesize of output 20 [2024-11-23 02:32:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:12,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:12,555 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 21 treesize of output 19 [2024-11-23 02:32:12,558 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 40 treesize of output 38 [2024-11-23 02:32:12,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-23 02:32:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535362402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:12,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-23 02:32:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770296059] [2024-11-23 02:32:12,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 02:32:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-23 02:32:12,636 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:12,784 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-11-23 02:32:12,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2024-11-23 02:32:12,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-23 02:32:12,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2024-11-23 02:32:12,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-23 02:32:12,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:32:12,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2024-11-23 02:32:12,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:12,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-23 02:32:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2024-11-23 02:32:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-23 02:32:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-23 02:32:12,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-23 02:32:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:32:12,824 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-23 02:32:12,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:32:12,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-23 02:32:12,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-23 02:32:12,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:12,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:12,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:12,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:12,828 INFO L745 eck$LassoCheckResult]: Stem: 578#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 559#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 560#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 552#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 553#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 579#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 580#L19-3 assume !(init_~i~0#1 < 2); 575#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 571#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 572#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 554#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 555#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 577#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 573#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 570#L27-7 [2024-11-23 02:32:12,828 INFO L747 eck$LassoCheckResult]: Loop: 570#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 563#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 565#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 570#L27-7 [2024-11-23 02:32:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2024-11-23 02:32:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218167332] [2024-11-23 02:32:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:12,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2024-11-23 02:32:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826962690] [2024-11-23 02:32:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2024-11-23 02:32:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862882384] [2024-11-23 02:32:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:12,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:28,382 WARN L286 SmtUtils]: Spent 15.39s on a formula simplification. DAG size of input: 290 DAG size of output: 252 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-23 02:32:28,919 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:32:28,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:32:28,920 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:32:28,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:32:28,920 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:32:28,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:28,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:32:28,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:32:28,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2024-11-23 02:32:28,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:32:28,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:32:28,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:28,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:29,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:29,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:29,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:32:29,507 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:32:29,507 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:32:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:32:29,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,536 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:32:29,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:32:29,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:32:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:32:29,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:29,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:29,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:32:29,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,640 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:32:29,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-11-23 02:32:29,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:29,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:29,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,667 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:32:29,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-23 02:32:29,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,700 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:32:29,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:29,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:29,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,742 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:32:29,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,776 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:32:29,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,800 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:32:29,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-23 02:32:29,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,821 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-23 02:32:29,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:29,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:29,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,845 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-23 02:32:29,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-23 02:32:29,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,866 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 02:32:29,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-23 02:32:29,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,888 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 02:32:29,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:29,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:29,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,910 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 02:32:29,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,942 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:32:29,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,977 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:29,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 02:32:29,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:29,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:29,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:29,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:29,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:29,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:29,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:29,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:29,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:29,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-23 02:32:29,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:29,998 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-23 02:32:30,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,039 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-23 02:32:30,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,061 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-23 02:32:30,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-23 02:32:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,081 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-23 02:32:30,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,111 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-23 02:32:30,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,131 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-23 02:32:30,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-11-23 02:32:30,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-23 02:32:30,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,151 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-23 02:32:30,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,186 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-23 02:32:30,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,227 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-23 02:32:30,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,273 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-23 02:32:30,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,300 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-23 02:32:30,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,321 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-23 02:32:30,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,345 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-23 02:32:30,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,368 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-23 02:32:30,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:32:30,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:32:30,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:32:30,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-23 02:32:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,389 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-23 02:32:30,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-23 02:32:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,428 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-23 02:32:30,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:32:30,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-23 02:32:30,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,461 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-23 02:32:30,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:32:30,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:32:30,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:32:30,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:32:30,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:32:30,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:32:30,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:32:30,504 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:32:30,546 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-11-23 02:32:30,546 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-23 02:32:30,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:32:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:30,549 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:32:30,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-23 02:32:30,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:32:30,562 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:32:30,562 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:32:30,562 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2024-11-23 02:32:30,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-23 02:32:30,586 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-23 02:32:30,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:30,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:32:30,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:30,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:32:30,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:30,720 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:32:30,720 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:30,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 41 transitions. Complement of second has 5 states. [2024-11-23 02:32:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:32:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-23 02:32:30,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-23 02:32:30,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:30,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-23 02:32:30,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:30,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-23 02:32:30,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:32:30,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2024-11-23 02:32:30,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:30,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2024-11-23 02:32:30,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-23 02:32:30,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:32:30,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2024-11-23 02:32:30,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:30,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-23 02:32:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2024-11-23 02:32:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-23 02:32:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-23 02:32:30,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-23 02:32:30,753 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-23 02:32:30,753 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:32:30,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-11-23 02:32:30,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:30,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:30,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:30,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:30,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:30,760 INFO L745 eck$LassoCheckResult]: Stem: 741#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 723#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 713#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 714#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 742#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 743#L19-3 assume !(init_~i~0#1 < 2); 738#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 733#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 734#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 715#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 716#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 740#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 735#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 736#L27-7 assume !(f_~i~1#1 < 2); 725#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 717#L38-3 [2024-11-23 02:32:30,760 INFO L747 eck$LassoCheckResult]: Loop: 717#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 719#L39 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 730#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 717#L38-3 [2024-11-23 02:32:30,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2024-11-23 02:32:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110191405] [2024-11-23 02:32:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110191405] [2024-11-23 02:32:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110191405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:30,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:32:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735933721] [2024-11-23 02:32:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:30,838 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 1 times [2024-11-23 02:32:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504103001] [2024-11-23 02:32:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:30,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:30,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:32:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:32:30,912 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:30,932 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-23 02:32:30,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-23 02:32:30,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:30,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-11-23 02:32:30,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-23 02:32:30,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:32:30,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-11-23 02:32:30,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:30,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-23 02:32:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-11-23 02:32:30,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-23 02:32:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-23 02:32:30,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-23 02:32:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:32:30,976 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-23 02:32:30,976 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:32:30,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2024-11-23 02:32:30,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:30,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:30,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:30,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:30,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:30,977 INFO L745 eck$LassoCheckResult]: Stem: 812#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 794#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 784#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 785#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 813#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 814#L19-3 assume !(init_~i~0#1 < 2); 809#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 804#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 805#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 789#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 790#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 811#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 806#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 807#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 795#L28-1 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 796#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 786#L38-3 [2024-11-23 02:32:30,977 INFO L747 eck$LassoCheckResult]: Loop: 786#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 788#L39 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 801#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 786#L38-3 [2024-11-23 02:32:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2024-11-23 02:32:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350975470] [2024-11-23 02:32:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:30,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-23 02:32:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350975470] [2024-11-23 02:32:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350975470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:32:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 02:32:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960433330] [2024-11-23 02:32:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:31,238 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:31,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 2 times [2024-11-23 02:32:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235611759] [2024-11-23 02:32:31,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,242 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:32:31,242 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:31,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:31,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 02:32:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-23 02:32:31,294 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:31,410 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-23 02:32:31,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2024-11-23 02:32:31,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:31,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 40 transitions. [2024-11-23 02:32:31,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-23 02:32:31,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:32:31,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2024-11-23 02:32:31,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:31,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-23 02:32:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2024-11-23 02:32:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-23 02:32:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-23 02:32:31,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-23 02:32:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:32:31,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-23 02:32:31,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:32:31,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-23 02:32:31,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:31,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:31,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:31,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:31,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:31,418 INFO L745 eck$LassoCheckResult]: Stem: 892#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 874#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 893#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 894#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 864#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 865#L19-3 assume !(init_~i~0#1 < 2); 889#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 884#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 885#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 866#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 867#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 891#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 886#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 887#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 877#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 878#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 883#L27-7 assume !(f_~i~1#1 < 2); 876#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 868#L38-3 [2024-11-23 02:32:31,418 INFO L747 eck$LassoCheckResult]: Loop: 868#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 870#L39 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 881#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 868#L38-3 [2024-11-23 02:32:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2024-11-23 02:32:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666112852] [2024-11-23 02:32:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666112852] [2024-11-23 02:32:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666112852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630812365] [2024-11-23 02:32:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:31,478 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-23 02:32:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:31,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:32:31,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:31,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630812365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:31,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-23 02:32:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554784094] [2024-11-23 02:32:31,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:31,574 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 3 times [2024-11-23 02:32:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793919772] [2024-11-23 02:32:31,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:32:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,577 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:32:31,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:31,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:31,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:32:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:32:31,616 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:31,649 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-23 02:32:31,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-23 02:32:31,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:31,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-11-23 02:32:31,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-23 02:32:31,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-23 02:32:31,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-11-23 02:32:31,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:31,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-23 02:32:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-11-23 02:32:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-23 02:32:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-23 02:32:31,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-23 02:32:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:32:31,654 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-23 02:32:31,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:32:31,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2024-11-23 02:32:31,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:31,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:31,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:31,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:31,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:31,655 INFO L745 eck$LassoCheckResult]: Stem: 1073#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1054#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1055#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1045#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1046#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1075#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1076#L19-3 assume !(init_~i~0#1 < 2); 1070#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1065#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1066#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1050#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1051#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1072#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1067#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1068#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1058#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 1059#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 1064#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1056#L28-1 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1057#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1047#L38-3 [2024-11-23 02:32:31,655 INFO L747 eck$LassoCheckResult]: Loop: 1047#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1049#L39 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 1062#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1047#L38-3 [2024-11-23 02:32:31,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2024-11-23 02:32:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452827189] [2024-11-23 02:32:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:31,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:31,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 4 times [2024-11-23 02:32:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271108160] [2024-11-23 02:32:31,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:32:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,734 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:32:31,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:31,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:31,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:31,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 951949762, now seen corresponding path program 1 times [2024-11-23 02:32:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:31,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948841366] [2024-11-23 02:32:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948841366] [2024-11-23 02:32:32,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948841366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864288775] [2024-11-23 02:32:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:32,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:32,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:32,849 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:32,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-11-23 02:32:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:32,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-23 02:32:32,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:32,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:32,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:33,066 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 27 treesize of output 11 [2024-11-23 02:32:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:33,070 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 27 treesize of output 11 [2024-11-23 02:32:33,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-23 02:32:33,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-23 02:32:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:33,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 02:32:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864288775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:32:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 02:32:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 19 [2024-11-23 02:32:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473472549] [2024-11-23 02:32:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:32:33,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:33,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 02:32:33,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-11-23 02:32:33,164 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:33,254 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-23 02:32:33,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2024-11-23 02:32:33,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:33,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2024-11-23 02:32:33,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:32:33,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-23 02:32:33,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2024-11-23 02:32:33,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:33,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-23 02:32:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2024-11-23 02:32:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-23 02:32:33,256 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-11-23 02:32:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-23 02:32:33,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-23 02:32:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 02:32:33,258 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-23 02:32:33,258 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:32:33,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-11-23 02:32:33,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:33,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:33,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:33,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:33,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:32:33,259 INFO L745 eck$LassoCheckResult]: Stem: 1240#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1218#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1211#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1212#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1242#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1243#L19-3 assume !(init_~i~0#1 < 2); 1237#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1230#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1231#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1213#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1214#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1239#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1232#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1233#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1223#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 1224#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 1229#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1221#L28-1 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1222#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1215#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1216#L39 assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1228#L41 [2024-11-23 02:32:33,259 INFO L747 eck$LassoCheckResult]: Loop: 1228#L41 assume 1 == g_#t~mem8#1; 1226#L41-2 havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1227#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1236#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1244#L39 assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1228#L41 [2024-11-23 02:32:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2024-11-23 02:32:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981992362] [2024-11-23 02:32:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:33,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:33,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 1 times [2024-11-23 02:32:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:33,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285231721] [2024-11-23 02:32:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:33,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:33,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -289285846, now seen corresponding path program 1 times [2024-11-23 02:32:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328729743] [2024-11-23 02:32:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:33,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328729743] [2024-11-23 02:32:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328729743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:33,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650918227] [2024-11-23 02:32:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:33,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:33,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:33,720 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-11-23 02:32:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:33,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 02:32:33,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:33,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:34,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:34,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-23 02:32:34,077 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 22 treesize of output 18 [2024-11-23 02:32:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:32:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650918227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:34,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2024-11-23 02:32:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840831624] [2024-11-23 02:32:34,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 02:32:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-11-23 02:32:34,341 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 24 states, 23 states have (on average 2.5652173913043477) 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-11-23 02:32:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:34,765 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-23 02:32:34,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2024-11-23 02:32:34,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:34,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 56 transitions. [2024-11-23 02:32:34,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-23 02:32:34,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-23 02:32:34,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2024-11-23 02:32:34,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:32:34,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-23 02:32:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2024-11-23 02:32:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-23 02:32:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-23 02:32:34,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-23 02:32:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-23 02:32:34,769 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-23 02:32:34,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:32:34,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-11-23 02:32:34,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:34,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:34,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:34,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:34,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:32:34,770 INFO L745 eck$LassoCheckResult]: Stem: 1528#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1505#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1496#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1497#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1531#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1532#L19-3 assume !(init_~i~0#1 < 2); 1525#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1515#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1516#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1500#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1501#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1527#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1517#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1518#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1529#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 1537#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 1530#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1508#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 1509#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 1514#L27-7 assume !(f_~i~1#1 < 2); 1519#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1498#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1499#L39 assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1524#L41 [2024-11-23 02:32:34,771 INFO L747 eck$LassoCheckResult]: Loop: 1524#L41 assume 1 == g_#t~mem8#1; 1511#L41-2 havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1512#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1533#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1534#L39 assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1524#L41 [2024-11-23 02:32:34,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2024-11-23 02:32:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804933051] [2024-11-23 02:32:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:32:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804933051] [2024-11-23 02:32:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804933051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:32:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136987316] [2024-11-23 02:32:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:35,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:32:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:32:35,171 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:32:35,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-23 02:32:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:32:35,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-23 02:32:35,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:32:35,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:35,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-23 02:32:35,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:35,389 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 27 treesize of output 11 [2024-11-23 02:32:35,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 02:32:35,394 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 27 treesize of output 11 [2024-11-23 02:32:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:35,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:32:35,624 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 14 [2024-11-23 02:32:35,626 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 16 treesize of output 12 [2024-11-23 02:32:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:32:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136987316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:32:35,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:32:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2024-11-23 02:32:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103385249] [2024-11-23 02:32:35,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:32:35,651 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:32:35,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 2 times [2024-11-23 02:32:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349160426] [2024-11-23 02:32:35,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:32:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:35,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:32:35,656 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:32:35,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:35,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:32:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 02:32:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-23 02:32:35,821 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. cyclomatic complexity: 12 Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:32:36,133 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-23 02:32:36,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2024-11-23 02:32:36,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:36,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 46 transitions. [2024-11-23 02:32:36,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-23 02:32:36,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-23 02:32:36,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2024-11-23 02:32:36,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:32:36,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-23 02:32:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2024-11-23 02:32:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-23 02:32:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:32:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-23 02:32:36,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-23 02:32:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 02:32:36,143 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-23 02:32:36,143 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:32:36,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2024-11-23 02:32:36,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-23 02:32:36,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:32:36,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:32:36,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:32:36,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-23 02:32:36,144 INFO L745 eck$LassoCheckResult]: Stem: 1797#$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(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1775#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1766#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1767#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1798#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1799#L19-3 assume !(init_~i~0#1 < 2); 1794#L17 havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1784#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1785#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1770#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1771#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1796#L28 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1786#L25 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1787#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1800#L28-1 assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset; 1782#L27-6 f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1; 1783#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1776#L28-1 assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1777#L25-1 havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1788#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1805#L39 assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1792#L41 assume 1 == g_#t~mem8#1; 1793#L41-2 havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1802#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1768#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1769#L39 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 1781#L38-2 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1791#L38-3 assume !(g_~i~2#1 < 2); 1789#L36 havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;havoc g_#in~pointer#1.base, g_#in~pointer#1.offset;assume { :end_inline_g } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1790#L38-7 [2024-11-23 02:32:36,144 INFO L747 eck$LassoCheckResult]: Loop: 1790#L38-7 assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1795#L39-2 assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset; 1773#L38-6 g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1; 1790#L38-7 [2024-11-23 02:32:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1885261436, now seen corresponding path program 1 times [2024-11-23 02:32:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137627563] [2024-11-23 02:32:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:36,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 132648, now seen corresponding path program 1 times [2024-11-23 02:32:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275593061] [2024-11-23 02:32:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:32:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:32:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1463787059, now seen corresponding path program 1 times [2024-11-23 02:32:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:32:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92722030] [2024-11-23 02:32:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:32:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:32:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:32:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:32:36,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace