./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d 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/ldv-regression/test25-1.c -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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:28:57,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:28:57,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:28:57,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:28:57,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:28:57,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:28:57,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:28:57,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:28:57,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:28:57,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:28:57,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:28:57,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:28:57,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:28:57,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:28:57,602 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:28:57,602 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:28:57,602 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:28:57,603 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:28:57,603 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:28:57,603 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:28:57,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:28:57,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:28:57,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:28:57,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:28:57,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:28:57,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:28:57,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:28:57,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:28:57,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:28:57,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:28:57,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:28:57,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:28:57,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:28:57,607 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:28:57,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:28:57,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:28:57,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:28:57,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:28:57,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:28:57,608 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:28:57,609 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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2024-11-17 08:28:57,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:28:57,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:28:57,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:28:57,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:28:57,837 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:28:57,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-1.c [2024-11-17 08:28:59,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:28:59,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:28:59,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2024-11-17 08:28:59,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14166490/7a958055be9f407eba7cbd905810a12a/FLAGbc74c2bb7 [2024-11-17 08:28:59,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14166490/7a958055be9f407eba7cbd905810a12a [2024-11-17 08:28:59,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:28:59,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:28:59,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:28:59,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:28:59,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:28:59,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:28:59,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52076298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59, skipping insertion in model container [2024-11-17 08:28:59,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:28:59,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:28:59,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:28:59,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:28:59,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:28:59,952 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:28:59,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59 WrapperNode [2024-11-17 08:28:59,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:28:59,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:28:59,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:28:59,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:28:59,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:28:59,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:28:59,987 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-11-17 08:28:59,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:28:59,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:28:59,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:28:59,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:28:59,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:28:59,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,028 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-17 08:29:00,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:29:00,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:29:00,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:29:00,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:29:00,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (1/1) ... [2024-11-17 08:29:00,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:00,084 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-17 08:29:00,090 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-17 08:29:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 08:29:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 08:29:00,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:29:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:29:00,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:29:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:29:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:29:00,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:29:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:29:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:29:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:29:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:29:00,207 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:29:00,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:29:00,333 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: call ULTIMATE.dealloc(main_~#cont~0#1.base, main_~#cont~0#1.offset);havoc main_~#cont~0#1.base, main_~#cont~0#1.offset;call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2024-11-17 08:29:00,333 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc check_#t~mem4#1.base, check_#t~mem4#1.offset;havoc check_#t~mem5#1; [2024-11-17 08:29:00,348 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-17 08:29:00,348 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:29:00,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:29:00,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:29:00,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:00 BoogieIcfgContainer [2024-11-17 08:29:00,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:29:00,360 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:29:00,360 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:29:00,363 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:29:00,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:00,364 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:28:59" (1/3) ... [2024-11-17 08:29:00,365 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675d9130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:00, skipping insertion in model container [2024-11-17 08:29:00,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:00,365 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:28:59" (2/3) ... [2024-11-17 08:29:00,365 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@675d9130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:29:00, skipping insertion in model container [2024-11-17 08:29:00,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:29:00,365 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:29:00" (3/3) ... [2024-11-17 08:29:00,367 INFO L332 chiAutomizerObserver]: Analyzing ICFG test25-1.c [2024-11-17 08:29:00,411 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:29:00,412 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:29:00,412 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:29:00,412 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:29:00,412 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:29:00,412 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:29:00,412 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:29:00,412 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:29:00,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) 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-17 08:29:00,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-17 08:29:00,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:00,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:00,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:00,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:00,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:29:00,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.411764705882353) 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-17 08:29:00,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-17 08:29:00,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:00,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:00,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:29:00,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:00,447 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(11, 2);call #Ultimate.allocInit(12, 3); 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~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 6#L26-1true [2024-11-17 08:29:00,447 INFO L747 eck$LassoCheckResult]: Loop: 6#L26-1true assume true; 13#L26-2true assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6#L26-1true [2024-11-17 08:29:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 1 times [2024-11-17 08:29:00,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560008549] [2024-11-17 08:29:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:00,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2024-11-17 08:29:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611076325] [2024-11-17 08:29:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:00,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1907551, now seen corresponding path program 1 times [2024-11-17 08:29:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273752572] [2024-11-17 08:29:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:00,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:01,253 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:29:01,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:29:01,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:29:01,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:29:01,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:29:01,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:29:01,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:29:01,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: test25-1.c_Iteration1_Lasso [2024-11-17 08:29:01,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:29:01,255 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:29:01,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:29:01,801 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:29:01,806 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:29:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,811 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-17 08:29:01,813 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-17 08:29:01,814 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-17 08:29:01,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:01,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:01,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:01,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:01,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:01,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:01,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:01,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:01,841 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-17 08:29:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,844 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-17 08:29:01,845 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-17 08:29:01,846 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-17 08:29:01,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:01,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:01,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:01,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:01,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:01,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:01,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:01,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:01,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:29:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,871 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-17 08:29:01,892 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-17 08:29:01,893 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-17 08:29:01,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:01,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:01,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:01,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:01,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:01,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:01,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:01,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:01,926 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-17 08:29:01,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,928 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-17 08:29:01,928 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-17 08:29:01,933 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-17 08:29:01,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:01,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:01,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:01,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:01,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:01,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:01,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:01,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:01,955 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-17 08:29:01,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,958 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-17 08:29:01,959 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-17 08:29:01,960 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-17 08:29:01,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:01,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:01,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:01,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:01,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:01,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:01,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:01,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:01,992 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-17 08:29:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:01,995 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-17 08:29:01,997 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-17 08:29:01,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-17 08:29:02,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:02,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:02,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:02,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,023 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-17 08:29:02,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,025 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-17 08:29:02,026 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-17 08:29:02,027 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-17 08:29:02,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:02,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:02,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:02,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,052 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-17 08:29:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,054 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-17 08:29:02,055 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-17 08:29:02,056 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-17 08:29:02,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,088 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-17 08:29:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,090 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-17 08:29:02,091 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-17 08:29:02,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-17 08:29:02,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,121 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-17 08:29:02,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,124 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-17 08:29:02,125 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-17 08:29:02,126 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-17 08:29:02,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,172 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-17 08:29:02,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,174 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-17 08:29:02,175 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-17 08:29:02,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:02,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,204 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-17 08:29:02,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,208 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-17 08:29:02,210 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-17 08:29:02,211 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-17 08:29:02,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:02,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,240 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-17 08:29:02,241 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-17 08:29:02,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:29:02,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:02,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:02,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:02,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:29:02,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,267 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-17 08:29:02,268 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-17 08:29:02,269 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-17 08:29:02,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,294 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-17 08:29:02,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,296 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-17 08:29:02,297 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-17 08:29:02,299 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-17 08:29:02,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:02,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:02,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:02,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,322 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-17 08:29:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,324 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-17 08:29:02,325 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-17 08:29:02,326 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-17 08:29:02,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,353 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-17 08:29:02,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,355 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-17 08:29:02,356 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-17 08:29:02,357 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-17 08:29:02,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:29:02,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:29:02,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:29:02,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,384 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-17 08:29:02,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,386 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-17 08:29:02,387 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-17 08:29:02,389 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-17 08:29:02,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:29:02,419 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-17 08:29:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,421 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-17 08:29:02,423 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-17 08:29:02,425 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-17 08:29:02,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:29:02,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:29:02,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:29:02,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:29:02,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:29:02,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:29:02,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:29:02,476 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-17 08:29:02,476 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:29:02,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:29:02,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,500 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-17 08:29:02,502 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-17 08:29:02,503 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:29:02,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:29:02,515 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:29:02,515 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1) = -16*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#array~0#1.base)_1 Supporting invariants [] [2024-11-17 08:29:02,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:29:02,557 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-11-17 08:29:02,566 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:29:02,567 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:29:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:02,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:29:02,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:02,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:29:02,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:02,626 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-17 08:29:02,654 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-17 08:29:02,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:02,688 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.411764705882353) 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 46 transitions. Complement of second has 6 states. [2024-11-17 08:29:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:29:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-17 08:29:02,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:29:02,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:02,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:29:02,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:02,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:29:02,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:29:02,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2024-11-17 08:29:02,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:02,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 11 states and 13 transitions. [2024-11-17 08:29:02,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-17 08:29:02,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:29:02,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-11-17 08:29:02,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:02,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-17 08:29:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-11-17 08:29:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-17 08:29:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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-17 08:29:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-11-17 08:29:02,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-17 08:29:02,720 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-11-17 08:29:02,720 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:29:02,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-11-17 08:29:02,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:02,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:02,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:02,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:02,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:02,722 INFO L745 eck$LassoCheckResult]: Stem: 127#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(11, 2);call #Ultimate.allocInit(12, 3); 128#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 129#L26-1 assume true; 133#L26-2 assume !(main_~j~0#1 < 10); 135#L26 havoc main_~j~0#1; 137#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 130#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 131#L36 [2024-11-17 08:29:02,722 INFO L747 eck$LassoCheckResult]: Loop: 131#L36 assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 136#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 131#L36 [2024-11-17 08:29:02,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 993241177, now seen corresponding path program 1 times [2024-11-17 08:29:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093534651] [2024-11-17 08:29:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:02,806 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-17 08:29:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093534651] [2024-11-17 08:29:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093534651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:29:02,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:29:02,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:29:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734723222] [2024-11-17 08:29:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:29:02,809 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2024-11-17 08:29:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407248208] [2024-11-17 08:29:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:02,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:02,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:02,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:02,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:29:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:29:02,851 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:29:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:02,859 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-17 08:29:02,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-17 08:29:02,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:02,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-17 08:29:02,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:29:02,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:29:02,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-17 08:29:02,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:02,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-17 08:29:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-17 08:29:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-17 08:29:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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-17 08:29:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-17 08:29:02,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:29:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:29:02,862 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-17 08:29:02,862 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:29:02,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-11-17 08:29:02,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:02,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:02,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:02,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:02,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:02,863 INFO L745 eck$LassoCheckResult]: Stem: 157#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(11, 2);call #Ultimate.allocInit(12, 3); 158#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 159#L26-1 assume true; 162#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 163#L26-1 assume true; 164#L26-2 assume !(main_~j~0#1 < 10); 165#L26 havoc main_~j~0#1; 166#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 160#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 161#L36 [2024-11-17 08:29:02,863 INFO L747 eck$LassoCheckResult]: Loop: 161#L36 assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 167#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 161#L36 [2024-11-17 08:29:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1084031002, now seen corresponding path program 1 times [2024-11-17 08:29:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327323365] [2024-11-17 08:29:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327323365] [2024-11-17 08:29:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327323365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:29:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214641264] [2024-11-17 08:29:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:02,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:29:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:02,946 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-17 08:29:02,947 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-17 08:29:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:03,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:29:03,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:03,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:29:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214641264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:29:03,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:29:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:29:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264728424] [2024-11-17 08:29:03,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:29:03,057 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:03,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 2 times [2024-11-17 08:29:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823191792] [2024-11-17 08:29:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:29:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:29:03,100 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 08:29:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:03,122 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-17 08:29:03,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2024-11-17 08:29:03,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:03,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 19 transitions. [2024-11-17 08:29:03,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:29:03,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:29:03,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2024-11-17 08:29:03,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:03,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-17 08:29:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2024-11-17 08:29:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-17 08:29:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 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-17 08:29:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-17 08:29:03,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-17 08:29:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:29:03,127 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-17 08:29:03,127 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:29:03,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-11-17 08:29:03,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:03,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:03,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:03,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:03,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:03,128 INFO L745 eck$LassoCheckResult]: Stem: 247#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(11, 2);call #Ultimate.allocInit(12, 3); 248#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 249#L26-1 assume true; 252#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 253#L26-1 assume true; 254#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 257#L26-1 assume true; 263#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 262#L26-1 assume true; 261#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 260#L26-1 assume true; 255#L26-2 assume !(main_~j~0#1 < 10); 256#L26 havoc main_~j~0#1; 258#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 250#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 251#L36 [2024-11-17 08:29:03,128 INFO L747 eck$LassoCheckResult]: Loop: 251#L36 assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 259#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 251#L36 [2024-11-17 08:29:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1089715677, now seen corresponding path program 2 times [2024-11-17 08:29:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982682316] [2024-11-17 08:29:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:29:03,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:29:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:29:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982682316] [2024-11-17 08:29:03,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982682316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:29:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409254454] [2024-11-17 08:29:03,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:29:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:29:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:29:03,348 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:29:03,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-17 08:29:03,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:29:03,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:29:03,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:29:03,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:29:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:03,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:29:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:29:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409254454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:29:03,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:29:03,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:29:03,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617237097] [2024-11-17 08:29:03,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:29:03,517 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:29:03,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 3 times [2024-11-17 08:29:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43683604] [2024-11-17 08:29:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:29:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:29:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:29:03,551 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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-17 08:29:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:29:03,581 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-17 08:29:03,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2024-11-17 08:29:03,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:03,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 31 transitions. [2024-11-17 08:29:03,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:29:03,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:29:03,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 31 transitions. [2024-11-17 08:29:03,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:29:03,582 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-17 08:29:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 31 transitions. [2024-11-17 08:29:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-17 08:29:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 28 states have internal predecessors, (30), 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-17 08:29:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-17 08:29:03,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-17 08:29:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:29:03,591 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-17 08:29:03,591 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:29:03,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2024-11-17 08:29:03,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:29:03,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:29:03,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:29:03,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1] [2024-11-17 08:29:03,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:29:03,592 INFO L745 eck$LassoCheckResult]: Stem: 400#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(11, 2);call #Ultimate.allocInit(12, 3); 401#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~post9#1, main_~j~0#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~pre15#1, main_#t~ret16#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(80);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;havoc main_#t~nondet6#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~j~0#1 := 0; 404#L26-1 assume true; 409#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 410#L26-1 assume true; 407#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 408#L26-1 assume true; 428#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 427#L26-1 assume true; 426#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 425#L26-1 assume true; 424#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 423#L26-1 assume true; 422#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 421#L26-1 assume true; 420#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 419#L26-1 assume true; 418#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 417#L26-1 assume true; 416#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 415#L26-1 assume true; 414#L26-2 assume !!(main_~j~0#1 < 10);havoc main_#t~nondet7#1;call write~int#1(main_#t~nondet7#1, main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~j~0#1, 4);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;call write~int#1(main_#t~nondet8#1, main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~j~0#1), 4);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 413#L26-1 assume true; 405#L26-2 assume !(main_~j~0#1 < 10); 406#L26 havoc main_~j~0#1; 411#L31 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~$Pointer$#2(main_~#array~0#1.base, main_~#array~0#1.offset + 8 * main_~i~0#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem10#1.base, 4 + main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#2(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1 := read~int#1(main_#t~mem11#1.base, 4 + main_#t~mem11#1.offset, 4); 402#L34 assume main_#t~mem12#1 > 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1;call main_#t~mem13#1 := read~int#1(main_~#array~0#1.base, 4 + (main_~#array~0#1.offset + 8 * main_~i~0#1), 4);main_~i~0#1 := main_#t~mem13#1 - 10;havoc main_#t~mem13#1; 403#L36 [2024-11-17 08:29:03,592 INFO L747 eck$LassoCheckResult]: Loop: 403#L36 assume true;call main_#t~mem14#1 := read~int#1(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 412#L36-1 assume !!(main_~i~0#1 < main_#t~mem14#1);havoc main_#t~mem14#1;main_#t~pre15#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre15#1; 403#L36 [2024-11-17 08:29:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 114888355, now seen corresponding path program 3 times [2024-11-17 08:29:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274777316] [2024-11-17 08:29:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:03,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 4 times [2024-11-17 08:29:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431621164] [2024-11-17 08:29:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:29:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:29:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1261439966, now seen corresponding path program 1 times [2024-11-17 08:29:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:29:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411464683] [2024-11-17 08:29:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:29:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:29:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:29:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:29:03,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace