./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-mul-div-a046e57-m [2024-10-13 17:22:55,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:22:55,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:22:55,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:22:55,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:22:55,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:22:55,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:22:55,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:22:55,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:22:55,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:22:55,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:22:55,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:22:55,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:22:55,150 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:22:55,150 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:22:55,151 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:22:55,152 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:22:55,153 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:22:55,153 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:22:55,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:22:55,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:22:55,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:22:55,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:22:55,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:22:55,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:22:55,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:22:55,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:22:55,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:22:55,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:22:55,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:22:55,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:22:55,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:22:55,159 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:22:55,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:22:55,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:22:55,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:22:55,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:22:55,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:22:55,161 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:22:55,168 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-10-13 17:22:55,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:22:55,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:22:55,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:22:55,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:22:55,445 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:22:55,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-10-13 17:22:56,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:22:57,039 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:22:57,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-10-13 17:22:57,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7533ad27/7cc1ed77ae304f3f9e92b343b2621330/FLAG5c8a4a271 [2024-10-13 17:22:57,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7533ad27/7cc1ed77ae304f3f9e92b343b2621330 [2024-10-13 17:22:57,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:22:57,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:22:57,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:22:57,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:22:57,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:22:57,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702ee2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57, skipping insertion in model container [2024-10-13 17:22:57,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:22:57,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:22:57,645 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:22:57,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:22:57,679 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:22:57,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57 WrapperNode [2024-10-13 17:22:57,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:22:57,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:22:57,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:22:57,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:22:57,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,729 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 141 [2024-10-13 17:22:57,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:22:57,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:22:57,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:22:57,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:22:57,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,775 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-10-13 17:22:57,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:22:57,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:22:57,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:22:57,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:22:57,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (1/1) ... [2024-10-13 17:22:57,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:22:57,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:22:57,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:22:57,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:22:57,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 17:22:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 17:22:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 17:22:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 17:22:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 17:22:57,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 17:22:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:22:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:22:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 17:22:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 17:22:57,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 17:22:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 17:22:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 17:22:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:22:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 17:22:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 17:22:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:22:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:22:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:22:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 17:22:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 17:22:57,990 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:22:57,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:22:58,272 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-13 17:22:58,274 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:22:58,288 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:22:58,288 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 17:22:58,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:22:58 BoogieIcfgContainer [2024-10-13 17:22:58,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:22:58,290 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:22:58,290 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:22:58,294 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:22:58,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:22:58,294 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:22:57" (1/3) ... [2024-10-13 17:22:58,295 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed885a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:22:58, skipping insertion in model container [2024-10-13 17:22:58,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:22:58,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:22:57" (2/3) ... [2024-10-13 17:22:58,296 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ed885a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:22:58, skipping insertion in model container [2024-10-13 17:22:58,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:22:58,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:22:58" (3/3) ... [2024-10-13 17:22:58,298 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2024-10-13 17:22:58,346 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:22:58,346 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:22:58,346 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:22:58,346 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:22:58,346 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:22:58,346 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:22:58,347 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:22:58,347 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:22:58,350 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-10-13 17:22:58,363 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:22:58,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:22:58,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:22:58,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:22:58,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:22:58,369 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:22:58,369 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-10-13 17:22:58,372 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:22:58,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:22:58,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:22:58,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:22:58,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:22:58,379 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-10-13 17:22:58,379 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-10-13 17:22:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:22:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:22:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:22:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383386104] [2024-10-13 17:22:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:22:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:22:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:22:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:22:58,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:22:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-13 17:22:58,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:22:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769999265] [2024-10-13 17:22:58,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:22:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:22:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:22:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:22:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:22:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-13 17:22:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:22:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406736994] [2024-10-13 17:22:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:22:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:22:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:22:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:22:58,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:22:59,289 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:22:59,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:22:59,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:22:59,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:22:59,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:22:59,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:22:59,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:22:59,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:22:59,292 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2024-10-13 17:22:59,292 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:22:59,292 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:22:59,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:22:59,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:00,087 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:23:00,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:23:00,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:23:00,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:00,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:00,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:00,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:23:00,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:23:00,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:00,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:23:00,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-10-13 17:23:00,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 17:23:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:23:00,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 17:23:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:23:00,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:00,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:00,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:00,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,295 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-10-13 17:23:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,297 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:23:00,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,350 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-10-13 17:23:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 17:23:00,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 17:23:00,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,398 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:23:00,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:00,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 17:23:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:23:00,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:00,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:00,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:00,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:00,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:00,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:00,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:00,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:23:00,534 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-13 17:23:00,535 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-10-13 17:23:00,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:00,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:00,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:23:00,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:23:00,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:23:00,669 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:23:00,669 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-10-13 17:23:00,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:00,738 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2024-10-13 17:23:00,750 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:23:00,751 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:23:00,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:00,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:23:00,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:00,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:23:00,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:00,906 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:23:00,909 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-10-13 17:23:00,957 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-10-13 17:23:00,959 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-10-13 17:23:00,964 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-10-13 17:23:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2024-10-13 17:23:00,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-13 17:23:00,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:00,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 17:23:00,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:00,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 17:23:00,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:00,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2024-10-13 17:23:00,971 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-10-13 17:23:00,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 34 states and 48 transitions. [2024-10-13 17:23:00,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-13 17:23:00,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-13 17:23:00,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2024-10-13 17:23:00,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:00,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-13 17:23:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2024-10-13 17:23:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 17:23:01,005 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-10-13 17:23:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-10-13 17:23:01,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-13 17:23:01,007 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-13 17:23:01,007 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:23:01,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2024-10-13 17:23:01,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-10-13 17:23:01,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:01,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:01,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:01,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:01,012 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-10-13 17:23:01,012 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-10-13 17:23:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2024-10-13 17:23:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28535222] [2024-10-13 17:23:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28535222] [2024-10-13 17:23:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28535222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:23:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204449338] [2024-10-13 17:23:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:01,100 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2024-10-13 17:23:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952274507] [2024-10-13 17:23:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:23:01,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:23:01,185 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-10-13 17:23:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:01,201 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-13 17:23:01,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2024-10-13 17:23:01,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-13 17:23:01,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 37 transitions. [2024-10-13 17:23:01,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-13 17:23:01,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-13 17:23:01,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-10-13 17:23:01,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:01,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-13 17:23:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-10-13 17:23:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-13 17:23:01,205 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-10-13 17:23:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-13 17:23:01,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-13 17:23:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:23:01,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-13 17:23:01,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:23:01,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-10-13 17:23:01,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-13 17:23:01,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:01,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:01,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:01,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:01,212 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-10-13 17:23:01,212 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-10-13 17:23:01,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2024-10-13 17:23:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491008926] [2024-10-13 17:23:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491008926] [2024-10-13 17:23:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491008926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:01,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789604116] [2024-10-13 17:23:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:01,317 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-10-13 17:23:01,318 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-10-13 17:23:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:01,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:23:01,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:01,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789604116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:01,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-13 17:23:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707168005] [2024-10-13 17:23:01,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:01,430 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2024-10-13 17:23:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898241590] [2024-10-13 17:23:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 17:23:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 17:23:01,492 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-10-13 17:23:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:01,514 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-10-13 17:23:01,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2024-10-13 17:23:01,515 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-13 17:23:01,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2024-10-13 17:23:01,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-13 17:23:01,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-13 17:23:01,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-10-13 17:23:01,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:01,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-13 17:23:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-10-13 17:23:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 17:23:01,518 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-10-13 17:23:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-10-13 17:23:01,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-13 17:23:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:23:01,519 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-13 17:23:01,520 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:23:01,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-10-13 17:23:01,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-10-13 17:23:01,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:01,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:01,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:01,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:01,521 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-10-13 17:23:01,521 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-10-13 17:23:01,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2024-10-13 17:23:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245668293] [2024-10-13 17:23:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:01,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2024-10-13 17:23:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628219954] [2024-10-13 17:23:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:01,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:01,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2024-10-13 17:23:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536215203] [2024-10-13 17:23:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:01,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:02,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:02,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536215203] [2024-10-13 17:23:02,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536215203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518462262] [2024-10-13 17:23:02,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:02,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:02,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:02,142 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-10-13 17:23:02,145 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-10-13 17:23:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:02,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 17:23:02,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:02,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:02,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:02,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:02,330 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-10-13 17:23:02,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:02,335 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-10-13 17:23:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:02,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:02,749 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-10-13 17:23:02,754 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-10-13 17:23:02,774 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-10-13 17:23:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518462262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:02,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-13 17:23:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268994401] [2024-10-13 17:23:02,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 17:23:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-13 17:23:02,854 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-10-13 17:23:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:03,074 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-13 17:23:03,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2024-10-13 17:23:03,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-13 17:23:03,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2024-10-13 17:23:03,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:23:03,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:23:03,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2024-10-13 17:23:03,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:03,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 17:23:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2024-10-13 17:23:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 17:23:03,077 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-10-13 17:23:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-13 17:23:03,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 17:23:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 17:23:03,079 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-13 17:23:03,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:23:03,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-10-13 17:23:03,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-13 17:23:03,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:03,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:03,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:03,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:03,081 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-10-13 17:23:03,081 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-10-13 17:23:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2024-10-13 17:23:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527985347] [2024-10-13 17:23:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:03,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2024-10-13 17:23:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008679139] [2024-10-13 17:23:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:03,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2024-10-13 17:23:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046684195] [2024-10-13 17:23:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:03,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:18,159 WARN L286 SmtUtils]: Spent 14.95s on a formula simplification. DAG size of input: 290 DAG size of output: 252 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:23:18,867 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:23:18,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:23:18,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:23:18,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:23:18,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:23:18,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:18,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:23:18,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:23:18,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2024-10-13 17:23:18,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:23:18,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:23:18,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:18,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:19,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:19,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:19,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:19,590 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:23:19,591 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:23:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:23:19,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,627 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:23:19,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 17:23:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,656 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:23:19,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 17:23:19,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,692 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:23:19,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:19,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:19,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,728 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:23:19,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:19,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:19,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-13 17:23:19,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 17:23:19,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,781 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:23:19,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:19,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:19,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-13 17:23:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,810 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 17:23:19,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,838 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:23:19,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,862 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-10-13 17:23:19,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,864 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 17:23:19,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,889 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:23:19,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-10-13 17:23:19,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:19,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:19,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 17:23:19,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,915 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:23:19,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,940 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:23:19,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:19,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:19,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:19,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,964 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:23:19,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:19,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:19,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:19,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:19,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:19,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:19,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:19,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:19,995 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-10-13 17:23:19,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:19,999 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:23:20,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-10-13 17:23:20,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,034 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:23:20,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,069 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 17:23:20,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,096 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 17:23:20,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-13 17:23:20,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,140 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 17:23:20,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,166 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 17:23:20,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,190 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 17:23:20,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,215 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 17:23:20,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,239 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 17:23:20,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,265 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 17:23:20,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-13 17:23:20,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,293 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 17:23:20,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 17:23:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,321 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 17:23:20,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-10-13 17:23:20,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,346 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-10-13 17:23:20,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,348 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 17:23:20,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,372 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 17:23:20,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-13 17:23:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,397 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 17:23:20,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-13 17:23:20,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,429 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 17:23:20,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 17:23:20,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,465 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 17:23:20,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:20,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:20,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:20,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:20,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,500 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 17:23:20,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 17:23:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,529 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 17:23:20,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:20,561 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-10-13 17:23:20,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,563 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:20,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 17:23:20,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:20,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:20,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:20,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:20,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:20,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:20,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:20,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:23:20,611 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-10-13 17:23:20,612 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-13 17:23:20,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:20,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:20,613 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-10-13 17:23:20,614 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-10-13 17:23:20,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:23:20,625 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:23:20,625 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:23:20,625 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-10-13 17:23:20,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-13 17:23:20,648 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-10-13 17:23:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:20,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:23:20,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:20,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:23:20,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:20,749 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:23:20,750 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-10-13 17:23:20,774 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-10-13 17:23:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:23:20,778 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-10-13 17:23:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-13 17:23:20,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2024-10-13 17:23:20,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:20,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2024-10-13 17:23:20,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:20,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2024-10-13 17:23:20,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:20,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2024-10-13 17:23:20,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:20,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2024-10-13 17:23:20,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-13 17:23:20,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:23:20,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2024-10-13 17:23:20,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:20,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-13 17:23:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2024-10-13 17:23:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-13 17:23:20,786 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-10-13 17:23:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-13 17:23:20,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-13 17:23:20,787 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-13 17:23:20,787 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:23:20,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-10-13 17:23:20,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:20,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:20,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:20,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:20,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:20,788 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-10-13 17:23:20,788 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-10-13 17:23:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2024-10-13 17:23:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881675150] [2024-10-13 17:23:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:20,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-10-13 17:23:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881675150] [2024-10-13 17:23:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881675150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:23:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654208010] [2024-10-13 17:23:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:20,834 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 1 times [2024-10-13 17:23:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930573213] [2024-10-13 17:23:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:20,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:20,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:23:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:23:20,897 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-10-13 17:23:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:20,916 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-13 17:23:20,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-13 17:23:20,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:20,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-10-13 17:23:20,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:23:20,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:23:20,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-10-13 17:23:20,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:20,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-13 17:23:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-10-13 17:23:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-13 17:23:20,919 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-10-13 17:23:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-13 17:23:20,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-13 17:23:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:23:20,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-13 17:23:20,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:23:20,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2024-10-13 17:23:20,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:20,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:20,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:20,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:20,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:20,925 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-10-13 17:23:20,925 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-10-13 17:23:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2024-10-13 17:23:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013424128] [2024-10-13 17:23:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:21,131 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-10-13 17:23:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013424128] [2024-10-13 17:23:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013424128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 17:23:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907139323] [2024-10-13 17:23:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:21,331 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 2 times [2024-10-13 17:23:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879961880] [2024-10-13 17:23:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 17:23:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 17:23:21,391 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-10-13 17:23:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:21,473 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-13 17:23:21,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2024-10-13 17:23:21,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:21,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 40 transitions. [2024-10-13 17:23:21,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:23:21,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:23:21,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2024-10-13 17:23:21,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:21,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-13 17:23:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2024-10-13 17:23:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-13 17:23:21,476 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-10-13 17:23:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-13 17:23:21,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-13 17:23:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:23:21,479 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-13 17:23:21,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:23:21,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-10-13 17:23:21,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:21,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:21,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:21,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:21,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:21,481 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-10-13 17:23:21,481 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-10-13 17:23:21,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2024-10-13 17:23:21,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725406862] [2024-10-13 17:23:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725406862] [2024-10-13 17:23:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725406862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973581976] [2024-10-13 17:23:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:21,543 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-10-13 17:23:21,545 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-10-13 17:23:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:21,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:23:21,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:21,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973581976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:21,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-13 17:23:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439568253] [2024-10-13 17:23:21,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:21,677 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:21,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 3 times [2024-10-13 17:23:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092880369] [2024-10-13 17:23:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 17:23:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 17:23:21,735 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-10-13 17:23:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:21,756 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-13 17:23:21,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-13 17:23:21,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:21,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2024-10-13 17:23:21,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-13 17:23:21,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 17:23:21,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2024-10-13 17:23:21,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:21,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-13 17:23:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2024-10-13 17:23:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 17:23:21,759 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-10-13 17:23:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-10-13 17:23:21,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-13 17:23:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:23:21,760 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-13 17:23:21,760 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:23:21,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2024-10-13 17:23:21,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:21,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:21,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:21,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:21,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:21,761 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-10-13 17:23:21,761 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-10-13 17:23:21,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2024-10-13 17:23:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621631911] [2024-10-13 17:23:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:21,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 4 times [2024-10-13 17:23:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001285465] [2024-10-13 17:23:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:21,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 951949762, now seen corresponding path program 1 times [2024-10-13 17:23:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042541772] [2024-10-13 17:23:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042541772] [2024-10-13 17:23:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042541772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178679437] [2024-10-13 17:23:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:22,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:22,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:22,893 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-10-13 17:23:22,894 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-10-13 17:23:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:23,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 17:23:23,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:23,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:23,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:23,154 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-10-13 17:23:23,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:23,161 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-10-13 17:23:23,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 17:23:23,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 17:23:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:23,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 17:23:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178679437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:23,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 17:23:23,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 19 [2024-10-13 17:23:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072579739] [2024-10-13 17:23:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 17:23:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-13 17:23:23,240 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-10-13 17:23:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:23,327 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-13 17:23:23,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2024-10-13 17:23:23,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:23,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2024-10-13 17:23:23,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 17:23:23,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-13 17:23:23,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2024-10-13 17:23:23,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:23,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-13 17:23:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2024-10-13 17:23:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-13 17:23:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-13 17:23:23,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-13 17:23:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:23:23,332 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-13 17:23:23,332 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:23:23,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-10-13 17:23:23,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:23,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:23,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:23,333 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-10-13 17:23:23,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:23:23,333 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-10-13 17:23:23,333 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-10-13 17:23:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2024-10-13 17:23:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078497847] [2024-10-13 17:23:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:23,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:23,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:23,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 1 times [2024-10-13 17:23:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617530160] [2024-10-13 17:23:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:23,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:23,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash -289285846, now seen corresponding path program 1 times [2024-10-13 17:23:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100832360] [2024-10-13 17:23:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100832360] [2024-10-13 17:23:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100832360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691203370] [2024-10-13 17:23:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:24,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:24,022 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-10-13 17:23:24,023 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-10-13 17:23:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:24,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 17:23:24,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:24,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:24,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:24,430 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-10-13 17:23:24,432 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-10-13 17:23:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:23:24,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691203370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:24,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:24,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2024-10-13 17:23:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731365941] [2024-10-13 17:23:24,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:24,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 17:23:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-10-13 17:23:24,691 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-10-13 17:23:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:25,087 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-13 17:23:25,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2024-10-13 17:23:25,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:25,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 56 transitions. [2024-10-13 17:23:25,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-13 17:23:25,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-13 17:23:25,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2024-10-13 17:23:25,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:25,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-13 17:23:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2024-10-13 17:23:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-13 17:23:25,091 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-10-13 17:23:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-13 17:23:25,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-13 17:23:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 17:23:25,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-13 17:23:25,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:23:25,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-10-13 17:23:25,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:25,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:25,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:25,095 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-10-13 17:23:25,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:23:25,095 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-10-13 17:23:25,095 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-10-13 17:23:25,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2024-10-13 17:23:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:25,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419806848] [2024-10-13 17:23:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419806848] [2024-10-13 17:23:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419806848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68935718] [2024-10-13 17:23:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:25,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:25,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:25,672 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-10-13 17:23:25,673 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-10-13 17:23:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:25,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 17:23:25,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:25,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:25,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:23:25,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:25,917 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-10-13 17:23:25,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 17:23:25,924 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-10-13 17:23:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:25,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:26,151 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-10-13 17:23:26,153 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-10-13 17:23:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68935718] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:26,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2024-10-13 17:23:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760197674] [2024-10-13 17:23:26,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:26,179 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:26,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 2 times [2024-10-13 17:23:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945608548] [2024-10-13 17:23:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 17:23:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-10-13 17:23:26,341 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-10-13 17:23:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:26,642 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-10-13 17:23:26,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2024-10-13 17:23:26,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:26,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 46 transitions. [2024-10-13 17:23:26,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-13 17:23:26,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-13 17:23:26,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2024-10-13 17:23:26,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:26,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-13 17:23:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2024-10-13 17:23:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 17:23:26,646 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-10-13 17:23:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-13 17:23:26,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-13 17:23:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 17:23:26,647 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-13 17:23:26,647 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:23:26,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2024-10-13 17:23:26,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-10-13 17:23:26,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:26,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:26,648 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-10-13 17:23:26,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:23:26,648 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-10-13 17:23:26,649 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-10-13 17:23:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1885261436, now seen corresponding path program 1 times [2024-10-13 17:23:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736418226] [2024-10-13 17:23:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:26,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 132648, now seen corresponding path program 1 times [2024-10-13 17:23:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700320056] [2024-10-13 17:23:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1463787059, now seen corresponding path program 1 times [2024-10-13 17:23:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317447476] [2024-10-13 17:23:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:26,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:26,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace