./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:00:04,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:00:04,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:00:04,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:00:04,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:00:04,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:00:04,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:00:04,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:00:04,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:00:04,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:00:04,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:00:04,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:00:04,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:00:04,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:00:04,768 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:00:04,768 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:00:04,769 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:00:04,769 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:00:04,769 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:00:04,770 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:00:04,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:00:04,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:00:04,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:00:04,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:00:04,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:00:04,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:00:04,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:00:04,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:00:04,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:00:04,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:00:04,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:00:04,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:00:04,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:00:04,775 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:00:04,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:00:04,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:00:04,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:00:04,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:00:04,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:00:04,777 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:00:04,777 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-11-10 23:00:05,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:00:05,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:00:05,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:00:05,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:00:05,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:00:05,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-11-10 23:00:06,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:00:06,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:00:06,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-11-10 23:00:06,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf4dff74/687d77d67c0a4d05b87c01afe4709149/FLAGfc3d93c2b [2024-11-10 23:00:06,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf4dff74/687d77d67c0a4d05b87c01afe4709149 [2024-11-10 23:00:06,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:00:06,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:00:06,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:00:06,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:00:06,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:00:06,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:00:06" (1/1) ... [2024-11-10 23:00:06,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea641c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:06, skipping insertion in model container [2024-11-10 23:00:06,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:00:06" (1/1) ... [2024-11-10 23:00:06,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:00:07,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:00:07,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:00:07,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:00:07,292 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:00:07,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07 WrapperNode [2024-11-10 23:00:07,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:00:07,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:00:07,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:00:07,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:00:07,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,340 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-10 23:00:07,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:00:07,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:00:07,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:00:07,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:00:07,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,383 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-11-10 23:00:07,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:00:07,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:00:07,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:00:07,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:00:07,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (1/1) ... [2024-11-10 23:00:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:07,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:07,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:00:07,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 23:00:07,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 23:00:07,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:00:07,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:00:07,662 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:00:07,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:00:07,849 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-10 23:00:07,863 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-10 23:00:07,865 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:00:07,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:00:07,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:00:07,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:00:07 BoogieIcfgContainer [2024-11-10 23:00:07,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:00:07,883 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:00:07,883 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:00:07,888 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:00:07,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:00:07,888 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:00:06" (1/3) ... [2024-11-10 23:00:07,889 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a9bcee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:00:07, skipping insertion in model container [2024-11-10 23:00:07,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:00:07,889 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:00:07" (2/3) ... [2024-11-10 23:00:07,890 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a9bcee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:00:07, skipping insertion in model container [2024-11-10 23:00:07,890 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:00:07,890 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:00:07" (3/3) ... [2024-11-10 23:00:07,891 INFO L332 chiAutomizerObserver]: Analyzing ICFG test-0232_1-1.i [2024-11-10 23:00:07,942 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:00:07,942 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:00:07,943 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:00:07,943 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:00:07,943 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:00:07,943 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:00:07,943 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:00:07,943 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:00:07,947 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-11-10 23:00:07,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 23:00:07,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:07,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:07,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:00:07,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:00:07,967 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:00:07,968 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-11-10 23:00:07,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 23:00:07,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:07,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:07,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:00:07,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:00:07,975 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue 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; 11#ULTIMATE.init_returnLabel#1true assume true;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; 14#L543true [2024-11-10 23:00:07,977 INFO L747 eck$LassoCheckResult]: Loop: 14#L543true assume true;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); 2#L534-1true 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; 6#L534true 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); 9#append_returnLabel#1true assume true;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;havoc main_#t~nondet12#1; 10#L543-1true assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 14#L543true [2024-11-10 23:00:07,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2024-11-10 23:00:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931558310] [2024-11-10 23:00:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:08,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:08,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 48606962, now seen corresponding path program 1 times [2024-11-10 23:00:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096969815] [2024-11-10 23:00:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:08,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:08,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:08,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2048456813, now seen corresponding path program 1 times [2024-11-10 23:00:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001329874] [2024-11-10 23:00:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:00:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001329874] [2024-11-10 23:00:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001329874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:00:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:00:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 23:00:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116090860] [2024-11-10 23:00:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:00:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:00:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 23:00:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 23:00:10,461 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:00:10,521 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-10 23:00:10,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2024-11-10 23:00:10,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 23:00:10,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 15 states and 19 transitions. [2024-11-10 23:00:10,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 23:00:10,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 23:00:10,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-10 23:00:10,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:00:10,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-10 23:00:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-10 23:00:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-10 23:00:10,551 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-11-10 23:00:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-11-10 23:00:10,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-10 23:00:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 23:00:10,557 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-10 23:00:10,558 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:00:10,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-11-10 23:00:10,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-10 23:00:10,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:10,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:10,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:00:10,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:00:10,559 INFO L745 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY 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; 55#ULTIMATE.init_returnLabel#1 assume true;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; 56#L543 assume true;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); 49#L534-1 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; 50#L534 [2024-11-10 23:00:10,560 INFO L747 eck$LassoCheckResult]: Loop: 50#L534 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); 57#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 62#L543-1 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 60#L543 assume true;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); 61#L534-1 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; 50#L534 [2024-11-10 23:00:10,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1661279, now seen corresponding path program 1 times [2024-11-10 23:00:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105926111] [2024-11-10 23:00:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash 45775022, now seen corresponding path program 2 times [2024-11-10 23:00:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630110004] [2024-11-10 23:00:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:10,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1443345904, now seen corresponding path program 1 times [2024-11-10 23:00:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962146647] [2024-11-10 23:00:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:10,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:12,732 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:00:12,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:00:12,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:00:12,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:00:12,734 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:00:12,735 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:12,735 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:00:12,735 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:00:12,735 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration2_Lasso [2024-11-10 23:00:12,735 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:00:12,736 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:00:12,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:12,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:13,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:13,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:13,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:13,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:14,584 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:00:14,588 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:00:14,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 23:00:14,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 23:00:14,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 23:00:14,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,663 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-11-10 23:00:14,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 23:00:14,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:14,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 23:00:14,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 23:00:14,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 23:00:14,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:14,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 23:00:14,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 23:00:14,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,787 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 23:00:14,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 23:00:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:00:14,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,848 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-11-10 23:00:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:00:14,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 23:00:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:00:14,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,919 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-11-10 23:00:14,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,921 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-11-10 23:00:14,923 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-11-10 23:00:14,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:14,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:14,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:14,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,954 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-11-10 23:00:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,955 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-11-10 23:00:14,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:14,962 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-11-10 23:00:14,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:14,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:14,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:14,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:14,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:00:14,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:00:14,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:14,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 23:00:14,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:14,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:14,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:14,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 23:00:14,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,029 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 23:00:15,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-11-10 23:00:15,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,057 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-11-10 23:00:15,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,060 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 23:00:15,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 23:00:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,088 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 23:00:15,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 23:00:15,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,114 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 23:00:15,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,139 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 23:00:15,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:15,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:15,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:15,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:15,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 23:00:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,165 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 23:00:15,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:15,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:15,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:15,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:15,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:15,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:00:15,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:00:15,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:00:15,193 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-10 23:00:15,193 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-10 23:00:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:15,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:15,212 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:15,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 23:00:15,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:00:15,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 23:00:15,226 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:00:15,226 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c~0) = -2*~c~0 + 39 Supporting invariants [] [2024-11-10 23:00:15,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:15,260 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-10 23:00:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:15,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:00:15,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:00:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:15,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:00:15,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:00:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:15,413 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-11-10 23:00:15,414 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 1.8) internal successors, (9), 5 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-11-10 23:00:15,459 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 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 34 transitions. Complement of second has 6 states. [2024-11-10 23:00:15,462 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-11-10 23:00:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-10 23:00:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2024-11-10 23:00:15,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 5 letters. [2024-11-10 23:00:15,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:15,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 5 letters. [2024-11-10 23:00:15,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:15,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 4 letters. Loop has 10 letters. [2024-11-10 23:00:15,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:15,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2024-11-10 23:00:15,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 19 states and 25 transitions. [2024-11-10 23:00:15,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-10 23:00:15,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 23:00:15,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2024-11-10 23:00:15,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:00:15,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-10 23:00:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2024-11-10 23:00:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-10 23:00:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-11-10 23:00:15,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-10 23:00:15,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-10 23:00:15,473 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:00:15,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-11-10 23:00:15,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:15,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:15,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:00:15,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:00:15,476 INFO L745 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY 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; 172#ULTIMATE.init_returnLabel#1 assume true;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; 176#L543 assume true;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); 166#L534-1 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; 167#L534 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); 177#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 182#L543-1 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 173#L547 assume !(main_~length~0#1 > 0); 175#L556 [2024-11-10 23:00:15,476 INFO L747 eck$LassoCheckResult]: Loop: 175#L556 assume true; 180#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; 175#L556 [2024-11-10 23:00:15,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash 923271741, now seen corresponding path program 1 times [2024-11-10 23:00:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935538154] [2024-11-10 23:00:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:00:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935538154] [2024-11-10 23:00:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935538154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:00:15,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:00:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:00:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584602470] [2024-11-10 23:00:15,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:00:15,542 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 23:00:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2024-11-10 23:00:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454182877] [2024-11-10 23:00:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:00:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 23:00:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 23:00:15,654 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-11-10 23:00:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:00:15,671 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-10 23:00:15,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-10 23:00:15,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2024-11-10 23:00:15,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-10 23:00:15,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 23:00:15,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-11-10 23:00:15,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:00:15,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-10 23:00:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-11-10 23:00:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-10 23:00:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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-11-10 23:00:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-10 23:00:15,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-10 23:00:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 23:00:15,676 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-10 23:00:15,676 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:00:15,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2024-11-10 23:00:15,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:15,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:15,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:00:15,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:00:15,677 INFO L745 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY 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; 219#ULTIMATE.init_returnLabel#1 assume true;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; 220#L543 assume true;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); 211#L534-1 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; 212#L534 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); 221#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 227#L543-1 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 216#L547 assume main_~length~0#1 > 0; 217#L548 assume !(main_~length~0#1 < 0); 223#L551 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; 224#L556 [2024-11-10 23:00:15,677 INFO L747 eck$LassoCheckResult]: Loop: 224#L556 assume true; 225#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; 224#L556 [2024-11-10 23:00:15,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1794087750, now seen corresponding path program 1 times [2024-11-10 23:00:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260750505] [2024-11-10 23:00:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:15,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 2 times [2024-11-10 23:00:15,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527002871] [2024-11-10 23:00:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:15,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1836441799, now seen corresponding path program 1 times [2024-11-10 23:00:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129875652] [2024-11-10 23:00:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:00:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129875652] [2024-11-10 23:00:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129875652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:00:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:00:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 23:00:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491464737] [2024-11-10 23:00:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:00:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:00:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 23:00:15,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 23:00:15,924 INFO L87 Difference]: Start difference. First operand 18 states and 22 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-11-10 23:00:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:00:15,945 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-10 23:00:15,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-10 23:00:15,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 32 transitions. [2024-11-10 23:00:15,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 23:00:15,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 23:00:15,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2024-11-10 23:00:15,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:00:15,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-10 23:00:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2024-11-10 23:00:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2024-11-10 23:00:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-10 23:00:15,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-10 23:00:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 23:00:15,951 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-10 23:00:15,951 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:00:15,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-10 23:00:15,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:15,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:15,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:15,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:00:15,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:00:15,952 INFO L745 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY 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; 280#ULTIMATE.init_returnLabel#1 assume true;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; 281#L543 assume true;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); 272#L534-1 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; 273#L534 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); 283#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 289#L543-1 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 286#L543 assume true;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); 274#L534-1 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; 275#L534 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); 287#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 288#L543-1 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 277#L547 assume main_~length~0#1 > 0; 278#L548 assume !(main_~length~0#1 < 0); 282#L551 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; 284#L556 [2024-11-10 23:00:15,952 INFO L747 eck$LassoCheckResult]: Loop: 284#L556 assume true; 285#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; 284#L556 [2024-11-10 23:00:15,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2146400276, now seen corresponding path program 1 times [2024-11-10 23:00:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453696511] [2024-11-10 23:00:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:16,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-10 23:00:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:00:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453696511] [2024-11-10 23:00:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453696511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:00:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904047660] [2024-11-10 23:00:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:00:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:16,246 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-11-10 23:00:16,247 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-11-10 23:00:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:16,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 23:00:16,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:00:16,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-10 23:00:16,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 23:00:16,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 23:00:16,476 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-11-10 23:00:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:16,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:00:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904047660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:00:16,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:00:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-10 23:00:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237295647] [2024-11-10 23:00:16,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:00:16,660 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 23:00:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 3 times [2024-11-10 23:00:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320825864] [2024-11-10 23:00:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:16,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:16,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:00:16,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 23:00:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-10 23:00:16,835 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:00:16,971 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-10 23:00:16,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-11-10 23:00:16,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:16,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2024-11-10 23:00:16,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-10 23:00:16,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-10 23:00:16,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2024-11-10 23:00:16,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:00:16,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-10 23:00:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2024-11-10 23:00:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-10 23:00:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-10 23:00:16,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-10 23:00:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:00:16,976 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-10 23:00:16,976 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:00:16,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2024-11-10 23:00:16,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-10 23:00:16,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:00:16,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:00:16,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:00:16,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:00:16,978 INFO L745 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY 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; 416#ULTIMATE.init_returnLabel#1 assume true;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; 419#L543 assume true;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); 410#L534-1 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; 411#L534 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); 421#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 427#L543-1 assume !!(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 425#L543 assume true;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); 412#L534-1 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; 413#L534 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); 420#append_returnLabel#1 assume true;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;havoc main_#t~nondet12#1; 426#L543-1 assume !(0 != main_#t~nondet12#1 && ~c~0 < 20);havoc main_#t~nondet12#1; 417#L547 assume main_~length~0#1 > 0; 418#L548 assume !(main_~length~0#1 < 0); 422#L551 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; 423#L556 [2024-11-10 23:00:16,980 INFO L747 eck$LassoCheckResult]: Loop: 423#L556 assume true; 424#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; 423#L556 [2024-11-10 23:00:16,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1261063339, now seen corresponding path program 1 times [2024-11-10 23:00:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486383838] [2024-11-10 23:00:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:17,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 4 times [2024-11-10 23:00:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425059442] [2024-11-10 23:00:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:17,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash 701091562, now seen corresponding path program 1 times [2024-11-10 23:00:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:00:17,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144649234] [2024-11-10 23:00:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:00:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:00:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:00:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:00:17,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:00:32,627 WARN L286 SmtUtils]: Spent 15.32s on a formula simplification. DAG size of input: 369 DAG size of output: 300 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-10 23:00:36,048 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:00:36,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:00:36,048 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:00:36,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:00:36,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:00:36,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:36,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:00:36,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:00:36,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: test-0232_1-1.i_Iteration6_Lasso [2024-11-10 23:00:36,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:00:36,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:00:36,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:00:36,978 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:00:36,978 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:00:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:36,982 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:36,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 23:00:36,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,020 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-11-10 23:00:37,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,021 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 23:00:37,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:37,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,053 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 23:00:37,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-10 23:00:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,089 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 23:00:37,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:37,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,118 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 23:00:37,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-11-10 23:00:37,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,141 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-11-10 23:00:37,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,143 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 23:00:37,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,169 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 23:00:37,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,196 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-11-10 23:00:37,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,198 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 23:00:37,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-10 23:00:37,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,223 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 23:00:37,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:00:37,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:00:37,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:00:37,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:00:37,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,249 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 23:00:37,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:00:37,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:00:37,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:00:37,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:00:37,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:00:37,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 23:00:37,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 23:00:37,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:00:37,271 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-10 23:00:37,272 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-10 23:00:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:00:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:00:37,273 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:00:37,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 23:00:37,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:00:37,285 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 23:00:37,285 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:00:37,285 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-11-10 23:00:37,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-10 23:00:37,306 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-10 23:00:37,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:00:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:37,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:00:37,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:00:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:00:37,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:00:37,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:00:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:00:37,407 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-11-10 23:00:37,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:37,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 22 transitions. Complement of second has 4 states. [2024-11-10 23:00:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 23:00:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:00:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-11-10 23:00:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-10 23:00:37,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-10 23:00:37,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:37,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-10 23:00:37,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:00:37,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2024-11-10 23:00:37,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:00:37,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2024-11-10 23:00:37,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:00:37,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:00:37,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:00:37,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:00:37,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:00:37,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:00:37,415 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:00:37,415 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:00:37,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 23:00:37,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:00:37,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 23:00:37,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:00:37 BoogieIcfgContainer [2024-11-10 23:00:37,421 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:00:37,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:00:37,421 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:00:37,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:00:37,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:00:07" (3/4) ... [2024-11-10 23:00:37,424 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 23:00:37,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:00:37,425 INFO L158 Benchmark]: Toolchain (without parser) took 30584.32ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 118.8MB in the beginning and 147.4MB in the end (delta: -28.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-10 23:00:37,425 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:00:37,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.65ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 97.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 23:00:37,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 176.2MB. Free memory was 97.8MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:00:37,426 INFO L158 Benchmark]: Boogie Preprocessor took 59.38ms. Allocated memory is still 176.2MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 23:00:37,426 INFO L158 Benchmark]: IcfgBuilder took 480.82ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 76.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 23:00:37,426 INFO L158 Benchmark]: BuchiAutomizer took 29537.67ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 76.8MB in the beginning and 147.4MB in the end (delta: -70.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:00:37,426 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:00:37,427 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.21ms. Allocated memory is still 176.2MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.65ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 97.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 176.2MB. Free memory was 97.8MB in the beginning and 96.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.38ms. Allocated memory is still 176.2MB. Free memory was 96.4MB in the beginning and 93.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 480.82ms. Allocated memory is still 176.2MB. Free memory was 93.6MB in the beginning and 76.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 29537.67ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 76.8MB in the beginning and 147.4MB in the end (delta: -70.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 28.7s. 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, 12 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, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 77 mSDtfsCounter, 96 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 lsp25 div100 bol100 ite100 ukn100 eq161 hnf93 smp100 dnf250 smp83 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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-11-10 23:00:37,448 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-11-10 23:00:37,646 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-11-10 23:00:37,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE