./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.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/list-ext-properties/test-0232_1-1.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 b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:23:35,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:23:35,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:23:35,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:23:35,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:23:35,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:23:35,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:23:35,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:23:35,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:23:35,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:23:35,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:23:35,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:23:35,362 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:23:35,363 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:23:35,364 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:23:35,364 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:23:35,364 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:23:35,364 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:23:35,365 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:23:35,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:23:35,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:23:35,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:23:35,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:23:35,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:23:35,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:23:35,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:23:35,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:23:35,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:23:35,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:23:35,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:23:35,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:23:35,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:23:35,371 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:23:35,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:23:35,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:23:35,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:23:35,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:23:35,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:23:35,373 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:23:35,374 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2024-10-13 17:23:35,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:23:35,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:23:35,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:23:35,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:23:35,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:23:35,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-13 17:23:37,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:23:37,395 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:23:37,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-13 17:23:37,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbe79c98/abd20fb1667044f88429421145cfc8cc/FLAG55d6e9f82 [2024-10-13 17:23:37,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbe79c98/abd20fb1667044f88429421145cfc8cc [2024-10-13 17:23:37,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:23:37,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:23:37,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:23:37,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:23:37,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:23:37,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:23:37" (1/1) ... [2024-10-13 17:23:37,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ced6ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:37, skipping insertion in model container [2024-10-13 17:23:37,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:23:37" (1/1) ... [2024-10-13 17:23:37,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:23:38,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:23:38,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:23:38,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:23:38,126 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:23:38,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38 WrapperNode [2024-10-13 17:23:38,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:23:38,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:23:38,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:23:38,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:23:38,135 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:23:38" (1/1) ... [2024-10-13 17:23:38,148 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:23:38" (1/1) ... [2024-10-13 17:23:38,169 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-13 17:23:38,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:23:38,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:23:38,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:23:38,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:23:38,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,209 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-10-13 17:23:38,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:23:38,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:23:38,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:23:38,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:23:38,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (1/1) ... [2024-10-13 17:23:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:38,273 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:23:38,275 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:23:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 17:23:38,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:23:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:23:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 17:23:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 17:23:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 17:23:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 17:23:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 17:23:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:23:38,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:23:38,462 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:23:38,464 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:23:38,667 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-13 17:23:38,667 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:23:38,678 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:23:38,678 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:23:38,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:23:38 BoogieIcfgContainer [2024-10-13 17:23:38,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:23:38,682 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:23:38,682 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:23:38,686 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:23:38,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:23:38,686 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:23:37" (1/3) ... [2024-10-13 17:23:38,687 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66e533f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:23:38, skipping insertion in model container [2024-10-13 17:23:38,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:23:38,687 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:23:38" (2/3) ... [2024-10-13 17:23:38,687 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66e533f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:23:38, skipping insertion in model container [2024-10-13 17:23:38,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:23:38,688 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:23:38" (3/3) ... [2024-10-13 17:23:38,689 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2024-10-13 17:23:38,751 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:23:38,751 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:23:38,751 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:23:38,752 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:23:38,752 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:23:38,752 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:23:38,752 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:23:38,752 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:23:38,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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:38,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:23:38,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:38,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:38,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:23:38,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:23:38,785 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:23:38,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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:38,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:23:38,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:38,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:38,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:23:38,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:23:38,795 INFO L745 eck$LassoCheckResult]: Stem: 15#$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(16, 2);~c~0 := 0; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 8#L543-4true [2024-10-13 17:23:38,796 INFO L747 eck$LassoCheckResult]: Loop: 8#L543-4true assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 3#L534true assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 11#L534-2true call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 6#L529true havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 9#L543-1true havoc main_#t~nondet12#1; 12#L543-2true assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 8#L543-4true [2024-10-13 17:23:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:23:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501122837] [2024-10-13 17:23:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:38,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:38,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:38,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1067992523, now seen corresponding path program 1 times [2024-10-13 17:23:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400135841] [2024-10-13 17:23:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:39,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:39,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 148041741, now seen corresponding path program 1 times [2024-10-13 17:23:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438567739] [2024-10-13 17:23:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:39,547 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:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438567739] [2024-10-13 17:23:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438567739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:39,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:23:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726937513] [2024-10-13 17:23:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:23:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:23:41,274 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:41,325 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-10-13 17:23:41,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2024-10-13 17:23:41,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:23:41,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2024-10-13 17:23:41,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-13 17:23:41,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-13 17:23:41,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-10-13 17:23:41,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:23:41,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:23:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-10-13 17:23:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-13 17:23:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-10-13 17:23:41,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-13 17:23:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:23:41,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-13 17:23:41,367 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:23:41,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-10-13 17:23:41,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-13 17:23:41,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:41,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:41,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:23:41,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-13 17:23:41,370 INFO L745 eck$LassoCheckResult]: Stem: 57#$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(16, 2);~c~0 := 0; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 61#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 54#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 49#L534-2 [2024-10-13 17:23:41,370 INFO L747 eck$LassoCheckResult]: Loop: 49#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 50#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 59#L543-1 havoc main_#t~nondet12#1; 51#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 53#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 62#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 49#L534-2 [2024-10-13 17:23:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2024-10-13 17:23:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743657766] [2024-10-13 17:23:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:41,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:41,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1274063243, now seen corresponding path program 2 times [2024-10-13 17:23:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753815016] [2024-10-13 17:23:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1985767406, now seen corresponding path program 1 times [2024-10-13 17:23:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159174477] [2024-10-13 17:23:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:41,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:43,263 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:23:43,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:23:43,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:23:43,265 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:23:43,265 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:23:43,265 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:43,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:23:43,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:23:43,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2024-10-13 17:23:43,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:23:43,269 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:23:43,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:43,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:44,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:44,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:44,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:23:45,019 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:23:45,023 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:23:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,028 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:45,029 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:45,031 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:45,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,077 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:45,079 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:45,080 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:45,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,114 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:45,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,117 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:45,118 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:45,120 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:45,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,145 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:45,147 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:45,148 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:45,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,173 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:45,173 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:45,174 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:45,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:23:45,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,204 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:45,205 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:45,206 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:45,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,229 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:45,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,231 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:45,231 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:45,232 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:45,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,260 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:45,261 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:45,261 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:45,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,285 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:45,286 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:45,287 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:45,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,316 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:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,319 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:45,321 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:45,322 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:45,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,353 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:45,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,354 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:45,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:23:45,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:45,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 17:23:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:23:45,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:23:45,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:23:45,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:45,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:45,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,414 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:45,430 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:45,430 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:45,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,452 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:45,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,454 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:45,455 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:45,456 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:45,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,489 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:45,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,492 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:45,494 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:45,494 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:45,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,528 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:45,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,531 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:45,532 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:45,533 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:45,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,555 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:45,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,557 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:45,557 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:45,558 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:45,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 17:23:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,581 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:45,582 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:45,583 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:45,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:23:45,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:23:45,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:23:45,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:23:45,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:23:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,610 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:45,611 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:45,611 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:45,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:23:45,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:23:45,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:23:45,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:23:45,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:23:45,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:23:45,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:23:45,641 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-13 17:23:45,641 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-13 17:23:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:23:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:45,659 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:45,661 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:45,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:23:45,676 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:23:45,676 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:23:45,677 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2024-10-13 17:23:45,692 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:45,726 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-10-13 17:23:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:45,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:23:45,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:45,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:23:45,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:45,889 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:45,892 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:23:45,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:45,944 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 34 transitions. Complement of second has 6 states. [2024-10-13 17:23:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:23:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2024-10-13 17:23:45,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-13 17:23:45,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-13 17:23:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:45,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 12 letters. [2024-10-13 17:23:45,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:23:45,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2024-10-13 17:23:45,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:45,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 26 transitions. [2024-10-13 17:23:45,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 17:23:45,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:23:45,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-10-13 17:23:45,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:45,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-13 17:23:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-10-13 17:23:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-10-13 17:23:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-10-13 17:23:45,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-13 17:23:45,960 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-13 17:23:45,961 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:23:45,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-10-13 17:23:45,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:45,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:45,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:45,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:45,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-13 17:23:45,962 INFO L745 eck$LassoCheckResult]: Stem: 182#$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(16, 2);~c~0 := 0; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 187#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 177#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 178#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 170#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 185#L543-1 havoc main_#t~nondet12#1; 173#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 174#L543-5 assume !(main_~length~0#1 > 0); 184#L556-1 [2024-10-13 17:23:45,962 INFO L747 eck$LassoCheckResult]: Loop: 184#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 184#L556-1 [2024-10-13 17:23:45,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:45,963 INFO L85 PathProgramCache]: Analyzing trace with hash 351584952, now seen corresponding path program 1 times [2024-10-13 17:23:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:45,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596199206] [2024-10-13 17:23:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:46,009 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:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596199206] [2024-10-13 17:23:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596199206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:46,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:23:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572594827] [2024-10-13 17:23:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:46,011 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2024-10-13 17:23:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242442359] [2024-10-13 17:23:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:23:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:23:46,153 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:46,168 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-10-13 17:23:46,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2024-10-13 17:23:46,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:46,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2024-10-13 17:23:46,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 17:23:46,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 17:23:46,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-13 17:23:46,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:46,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-13 17:23:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-13 17:23:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-13 17:23:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-13 17:23:46,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-13 17:23:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:23:46,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-13 17:23:46,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:23:46,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2024-10-13 17:23:46,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:46,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:46,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:46,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:46,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-13 17:23:46,175 INFO L745 eck$LassoCheckResult]: Stem: 229#$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(16, 2);~c~0 := 0; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 234#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 224#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 225#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 217#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 231#L543-1 havoc main_#t~nondet12#1; 220#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 221#L543-5 assume main_~length~0#1 > 0; 227#L548 assume !(main_~length~0#1 < 0); 228#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 233#L556-1 [2024-10-13 17:23:46,175 INFO L747 eck$LassoCheckResult]: Loop: 233#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 233#L556-1 [2024-10-13 17:23:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1429285103, now seen corresponding path program 1 times [2024-10-13 17:23:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582313158] [2024-10-13 17:23:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:46,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 2 times [2024-10-13 17:23:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311745737] [2024-10-13 17:23:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:46,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1358165187, now seen corresponding path program 1 times [2024-10-13 17:23:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946173052] [2024-10-13 17:23:46,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:46,301 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:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946173052] [2024-10-13 17:23:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946173052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:23:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:23:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:23:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571892227] [2024-10-13 17:23:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:23:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 17:23:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 17:23:46,425 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 3.0) 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:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:46,452 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-13 17:23:46,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2024-10-13 17:23:46,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:46,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 34 transitions. [2024-10-13 17:23:46,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-13 17:23:46,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-13 17:23:46,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2024-10-13 17:23:46,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:46,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-13 17:23:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2024-10-13 17:23:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2024-10-13 17:23:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-13 17:23:46,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-13 17:23:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 17:23:46,459 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-13 17:23:46,460 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:23:46,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2024-10-13 17:23:46,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:46,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:46,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:46,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:46,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-13 17:23:46,461 INFO L745 eck$LassoCheckResult]: Stem: 292#$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(16, 2);~c~0 := 0; 293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 298#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 287#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 280#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 281#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 296#L543-1 havoc main_#t~nondet12#1; 285#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 286#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 288#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 289#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 294#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 295#L543-1 havoc main_#t~nondet12#1; 283#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 284#L543-5 assume main_~length~0#1 > 0; 290#L548 assume !(main_~length~0#1 < 0); 291#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 297#L556-1 [2024-10-13 17:23:46,462 INFO L747 eck$LassoCheckResult]: Loop: 297#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 297#L556-1 [2024-10-13 17:23:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2089045691, now seen corresponding path program 1 times [2024-10-13 17:23:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689195841] [2024-10-13 17:23:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:46,546 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:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:23:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689195841] [2024-10-13 17:23:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689195841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:23:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059933831] [2024-10-13 17:23:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:23:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:23:46,805 INFO L229 MonitoredProcess]: Starting monitored process 22 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:46,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 17:23:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:23:46,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 17:23:46,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:23:46,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 17:23:47,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 17:23:47,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 17:23:47,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 17:23:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:47,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:23:47,099 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 30 treesize of output 26 [2024-10-13 17:23:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:23:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059933831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:23:47,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:23:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2024-10-13 17:23:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368930881] [2024-10-13 17:23:47,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:23:47,192 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:23:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 3 times [2024-10-13 17:23:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900438354] [2024-10-13 17:23:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:23:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 17:23:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 17:23:47,328 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:23:47,398 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-10-13 17:23:47,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2024-10-13 17:23:47,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:47,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2024-10-13 17:23:47,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 17:23:47,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 17:23:47,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2024-10-13 17:23:47,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:23:47,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-13 17:23:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2024-10-13 17:23:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-13 17:23:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:23:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-13 17:23:47,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-13 17:23:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 17:23:47,402 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-13 17:23:47,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:23:47,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2024-10-13 17:23:47,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-13 17:23:47,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:23:47,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:23:47,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:23:47,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-13 17:23:47,403 INFO L745 eck$LassoCheckResult]: Stem: 444#$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(16, 2);~c~0 := 0; 445#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post11#1, main_#t~nondet12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$#2(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; 449#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 439#L534 assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; 440#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 434#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 447#L543-1 havoc main_#t~nondet12#1; 437#L543-2 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 438#L543-4 assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset;call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$#2(append_~plist#1.base, append_~plist#1.offset, 4);call write~$Pointer$#1(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4);havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4); 441#L534 assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0;call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$#1(append_~item~0#1.base, append_~item~0#1.offset, 4);call append_#t~mem8#1.base, append_#t~mem8#1.offset := read~$Pointer$#1(append_#t~mem7#1.base, 4 + append_#t~mem7#1.offset, 4);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~mem8#1.base, append_#t~mem8#1.offset; 431#L534-2 call write~$Pointer$#1(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4);havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset;call write~$Pointer$#2(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); 432#L529 havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;havoc append_#in~plist#1.base, append_#in~plist#1.offset;assume { :end_inline_append } true;main_#t~post11#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 446#L543-1 havoc main_#t~nondet12#1; 435#L543-2 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 436#L543-5 assume main_~length~0#1 > 0; 442#L548 assume !(main_~length~0#1 < 0); 443#L548-2 call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem17#1.base, main_#t~mem17#1.offset);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;call write~$Pointer$#2(main_~next~0#1.base, main_~next~0#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post18#1 := main_~length~0#1;main_~length~0#1 := main_#t~post18#1 - 1;havoc main_~next~0#1.base, main_~next~0#1.offset;havoc main_#t~post18#1; 448#L556-1 [2024-10-13 17:23:47,403 INFO L747 eck$LassoCheckResult]: Loop: 448#L556-1 assume !!(main_~length~0#1 > 0);call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$#1(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4);main_~next~1#1.base, main_~next~1#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#2(main_~#list~0#1.base, main_~#list~0#1.offset, 4);call ULTIMATE.dealloc(main_#t~mem21#1.base, main_#t~mem21#1.offset);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call write~$Pointer$#2(main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_#t~post22#1 := main_~length~0#1;main_~length~0#1 := main_#t~post22#1 - 1;havoc main_~next~1#1.base, main_~next~1#1.offset;havoc main_#t~post22#1; 448#L556-1 [2024-10-13 17:23:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1279699065, now seen corresponding path program 1 times [2024-10-13 17:23:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284875046] [2024-10-13 17:23:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:47,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 4 times [2024-10-13 17:23:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680595842] [2024-10-13 17:23:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:23:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:23:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1015965305, now seen corresponding path program 1 times [2024-10-13 17:23:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:23:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645729747] [2024-10-13 17:23:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:23:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:23:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:23:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:23:47,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:24:01,318 WARN L286 SmtUtils]: Spent 13.62s on a formula simplification. DAG size of input: 369 DAG size of output: 303 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:24:04,248 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:24:04,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:24:04,248 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:24:04,248 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:24:04,248 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:24:04,248 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:04,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:24:04,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:24:04,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2024-10-13 17:24:04,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:24:04,248 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:24:04,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:04,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:24:05,143 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:24:05,143 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:24:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,145 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:24:05,146 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:24:05,148 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:24:05,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,170 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:24:05,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,172 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:24:05,172 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:24:05,173 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:24:05,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:24:05,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,196 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:24:05,197 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:24:05,197 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:24:05,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,219 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:24:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,220 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:24:05,222 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:24:05,222 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:24:05,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-13 17:24:05,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,245 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:24:05,246 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:24:05,246 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:24:05,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-13 17:24:05,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,282 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:24:05,283 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:24:05,284 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:24:05,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-13 17:24:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,307 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:24:05,307 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:24:05,308 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:24:05,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 17:24:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,334 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:24:05,335 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:24:05,336 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:24:05,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,357 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:24:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,358 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:24:05,359 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:24:05,359 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:24:05,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:24:05,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:24:05,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:24:05,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:24:05,383 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:24:05,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,385 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:24:05,386 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:24:05,387 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:24:05,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:24:05,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:24:05,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:24:05,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:24:05,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:24:05,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:24:05,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:24:05,407 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 17:24:05,407 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-13 17:24:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:24:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:24:05,409 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:24:05,410 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:24:05,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:24:05,422 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:24:05,422 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:24:05,423 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1) = 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2024-10-13 17:24:05,432 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:24:05,443 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-13 17:24:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:24:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:24:05,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:24:05,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:24:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:24:05,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:24:05,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:24:05,537 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:24:05,537 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-13 17:24:05,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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:24:05,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 20 transitions. cyclomatic complexity: 3. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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) Result 20 states and 21 transitions. Complement of second has 2 states. [2024-10-13 17:24:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:24:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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:24:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2024-10-13 17:24:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 17 letters. Loop has 1 letters. [2024-10-13 17:24:05,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:24:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 18 letters. Loop has 1 letters. [2024-10-13 17:24:05,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:24:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2024-10-13 17:24:05,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:24:05,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2024-10-13 17:24:05,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:24:05,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:24:05,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:24:05,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:24:05,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:24:05,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:24:05,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:24:05,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:24:05,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:24:05 BoogieIcfgContainer [2024-10-13 17:24:05,555 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:24:05,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:24:05,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:24:05,556 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:24:05,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:23:38" (3/4) ... [2024-10-13 17:24:05,558 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:24:05,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:24:05,560 INFO L158 Benchmark]: Toolchain (without parser) took 27854.73ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 148.6MB in the beginning and 81.1MB in the end (delta: 67.5MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,561 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:24:05,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.37ms. Allocated memory is still 182.5MB. Free memory was 148.6MB in the beginning and 129.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 128.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,561 INFO L158 Benchmark]: Boogie Preprocessor took 66.83ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 125.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,563 INFO L158 Benchmark]: RCFGBuilder took 438.90ms. Allocated memory is still 182.5MB. Free memory was 125.1MB in the beginning and 142.6MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,563 INFO L158 Benchmark]: BuchiAutomizer took 26873.95ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 142.6MB in the beginning and 82.2MB in the end (delta: 60.4MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,564 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 264.2MB. Free memory was 82.2MB in the beginning and 81.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:24:05,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.37ms. Allocated memory is still 182.5MB. Free memory was 148.6MB in the beginning and 129.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 128.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.83ms. Allocated memory is still 182.5MB. Free memory was 128.2MB in the beginning and 125.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.90ms. Allocated memory is still 182.5MB. Free memory was 125.1MB in the beginning and 142.6MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 26873.95ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 142.6MB in the beginning and 82.2MB in the end (delta: 60.4MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 264.2MB. Free memory was 82.2MB in the beginning and 81.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (39 + ((long long) -2 * c)) and consists of 4 locations. One deterministic module has affine ranking function length and consists of 2 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 26.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 77 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital649 mio100 ax102 hnf100 lsp92 ukn32 mio100 lsp26 div100 bol100 ite100 ukn100 eq161 hnf93 smp100 dnf250 smp83 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 17:24:05,592 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:24:05,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-13 17:24:05,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE