./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:06:45,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:06:45,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:06:45,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:06:45,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:06:45,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:06:46,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:06:46,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:06:46,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:06:46,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:06:46,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:06:46,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:06:46,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:06:46,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:06:46,025 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:06:46,026 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:06:46,026 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:06:46,026 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:06:46,027 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:06:46,027 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:06:46,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:06:46,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:06:46,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:06:46,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:06:46,033 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:06:46,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:06:46,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:06:46,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:06:46,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:06:46,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:06:46,034 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:06:46,034 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2024-11-17 08:06:46,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:06:46,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:06:46,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:06:46,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:06:46,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:06:46,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-17 08:06:47,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:06:47,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:06:47,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-17 08:06:47,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5617bd40/54d9a91892874a27839a6da7f1fd06e0/FLAG1b5fd5ab5 [2024-11-17 08:06:47,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5617bd40/54d9a91892874a27839a6da7f1fd06e0 [2024-11-17 08:06:47,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:06:47,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:06:47,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:06:47,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:06:48,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:06:48,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:06:47" (1/1) ... [2024-11-17 08:06:48,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ff2936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48, skipping insertion in model container [2024-11-17 08:06:48,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:06:47" (1/1) ... [2024-11-17 08:06:48,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:06:48,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:06:48,298 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:06:48,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:06:48,364 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:06:48,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48 WrapperNode [2024-11-17 08:06:48,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:06:48,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:06:48,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:06:48,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:06:48,370 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:06:48" (1/1) ... [2024-11-17 08:06:48,382 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:06:48" (1/1) ... [2024-11-17 08:06:48,404 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2024-11-17 08:06:48,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:06:48,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:06:48,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:06:48,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:06:48,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,431 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [12, 6, 10, 8, 6]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 20 writes are split as follows [6, 2, 6, 4, 2]. [2024-11-17 08:06:48,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:06:48,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:06:48,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:06:48,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:06:48,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (1/1) ... [2024-11-17 08:06:48,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:48,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:48,475 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:06:48,479 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:06:48,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:06:48,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:06:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:06:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 08:06:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:06:48,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:06:48,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:06:48,601 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:06:48,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:06:48,788 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 08:06:48,789 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:06:48,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:06:48,805 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:06:48,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:48 BoogieIcfgContainer [2024-11-17 08:06:48,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:06:48,807 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:06:48,807 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:06:48,810 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:06:48,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:48,810 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:06:47" (1/3) ... [2024-11-17 08:06:48,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f60de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:06:48, skipping insertion in model container [2024-11-17 08:06:48,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:48,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:48" (2/3) ... [2024-11-17 08:06:48,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f60de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:06:48, skipping insertion in model container [2024-11-17 08:06:48,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:48,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:48" (3/3) ... [2024-11-17 08:06:48,814 INFO L332 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-17 08:06:48,850 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:06:48,850 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:06:48,850 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:06:48,850 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:06:48,850 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:06:48,850 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:06:48,850 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:06:48,850 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:06:48,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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:06:48,865 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:06:48,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:48,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:48,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:06:48,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:06:48,868 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:06:48,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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:06:48,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:06:48,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:48,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:48,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:06:48,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:06:48,875 INFO L745 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 21#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 12#L578true assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 5#L558-1true assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 20#f_L1#2true assume true; 17#L562-2true [2024-11-17 08:06:48,875 INFO L747 eck$LassoCheckResult]: Loop: 17#L562-2true assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 27#L562-3true assume !!(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1;call f_#t~mem10#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(2 * f_#t~mem10#1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem10#1; 17#L562-2true [2024-11-17 08:06:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 78221199, now seen corresponding path program 1 times [2024-11-17 08:06:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393181371] [2024-11-17 08:06:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 1 times [2024-11-17 08:06:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026112967] [2024-11-17 08:06:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2138837682, now seen corresponding path program 1 times [2024-11-17 08:06:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064592356] [2024-11-17 08:06:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:49,402 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:06:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:49,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064592356] [2024-11-17 08:06:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064592356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:06:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:06:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:06:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559179012] [2024-11-17 08:06:49,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:06:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:49,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:06:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:06:49,557 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:06:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:49,623 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2024-11-17 08:06:49,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2024-11-17 08:06:49,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-17 08:06:49,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 33 states and 42 transitions. [2024-11-17 08:06:49,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-17 08:06:49,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-17 08:06:49,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2024-11-17 08:06:49,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:06:49,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-17 08:06:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2024-11-17 08:06:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2024-11-17 08:06:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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:06:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-17 08:06:49,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:06:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:06:49,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:06:49,658 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:06:49,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-17 08:06:49,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:49,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:49,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:49,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:49,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:06:49,661 INFO L745 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 92#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 102#L578 assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 98#L558-1 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 96#f_L1#2 assume true; 97#L562-2 assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 110#L562-3 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 100#f_L2#2 assume true; 101#L566-3 [2024-11-17 08:06:49,662 INFO L747 eck$LassoCheckResult]: Loop: 101#L566-3 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 111#L566-5 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 93#L566-4 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 94#L567-2 assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#2(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1; 101#L566-3 [2024-11-17 08:06:49,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1879458725, now seen corresponding path program 1 times [2024-11-17 08:06:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661143478] [2024-11-17 08:06:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2060507, now seen corresponding path program 1 times [2024-11-17 08:06:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131784162] [2024-11-17 08:06:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:49,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1238331445, now seen corresponding path program 1 times [2024-11-17 08:06:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777232592] [2024-11-17 08:06:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:49,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:51,341 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:06:51,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:06:51,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:06:51,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:06:51,342 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:06:51,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:51,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:06:51,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:06:51,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration2_Lasso [2024-11-17 08:06:51,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:06:51,343 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:06:51,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:51,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:52,466 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:06:52,469 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:06:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,472 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:06:52,473 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:06:52,477 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:06:52,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:52,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,505 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:06:52,506 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:06:52,507 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:06:52,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,530 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:06:52,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,532 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:06:52,533 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:06:52,534 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:06:52,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:06:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,558 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:06:52,559 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:06:52,560 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:06:52,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,582 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:06:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,584 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:06:52,585 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:06:52,587 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:06:52,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:52,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:52,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,614 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:06:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,616 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:06:52,617 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:06:52,620 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:06:52,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,641 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:06:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,643 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:06:52,643 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:06:52,644 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:06:52,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,665 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:06:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,667 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:06:52,668 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:06:52,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:06:52,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:06:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,692 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:06:52,693 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:06:52,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:06:52,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,714 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:06:52,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,716 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:06:52,716 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:06:52,717 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:06:52,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,738 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:06:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,740 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:06:52,741 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:06:52,741 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:06:52,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:52,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,765 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:06:52,766 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:06:52,767 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:06:52,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:06:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,793 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:06:52,793 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:06:52,794 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:06:52,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:52,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:52,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,819 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:06:52,820 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:06:52,821 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:06:52,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:52,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:52,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:52,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,844 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:06:52,845 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:06:52,845 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:06:52,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:52,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:52,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:52,873 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:06:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,874 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:06:52,875 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:06:52,876 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:06:52,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:52,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:52,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:52,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:52,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:52,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:52,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:06:52,922 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-17 08:06:52,922 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:06:52,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:52,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:52,925 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:06:52,926 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:06:52,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:06:52,938 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:06:52,938 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:06:52,939 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) 0)_1 Supporting invariants [1*v_rep(select (select #memory_int#4 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_1 - 2 >= 0] [2024-11-17 08:06:52,950 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:06:53,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:06:53,136 INFO L156 tatePredicateManager]: 54 out of 56 supporting invariants were superfluous and have been removed [2024-11-17 08:06:53,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 08:06:53,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-17 08:06:53,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-17 08:06:53,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:53,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:06:53,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:53,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 08:06:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:53,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:06:53,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:53,358 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:06:53,361 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-17 08:06:53,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:06:53,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Result 33 states and 42 transitions. Complement of second has 10 states. [2024-11-17 08:06:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:06:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:06:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2024-11-17 08:06:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-17 08:06:53,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:53,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-17 08:06:53,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:53,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2024-11-17 08:06:53,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:53,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2024-11-17 08:06:53,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:53,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 41 transitions. [2024-11-17 08:06:53,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-17 08:06:53,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-17 08:06:53,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2024-11-17 08:06:53,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:53,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-17 08:06:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2024-11-17 08:06:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-17 08:06:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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:06:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-17 08:06:53,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-17 08:06:53,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-17 08:06:53,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:06:53,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2024-11-17 08:06:53,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:53,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:53,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:53,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:53,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:06:53,441 INFO L745 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 442#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 454#L578 assume 0 != main_#t~nondet21#1;havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 456#L558 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 457#f_L1#1 assume true; 462#L562 assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 455#L562-1 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 447#f_L2#1 assume true; 440#L566 [2024-11-17 08:06:53,441 INFO L747 eck$LassoCheckResult]: Loop: 440#L566 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 453#L566-2 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 459#L566-1 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 458#L567 assume !(0 != f_#t~nondet14#1);havoc f_#t~nondet14#1;call f_#t~mem19#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);call f_#t~mem20#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#2(f_#t~mem19#1 - f_#t~mem20#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~mem19#1;havoc f_#t~mem20#1; 440#L566 [2024-11-17 08:06:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1675922171, now seen corresponding path program 1 times [2024-11-17 08:06:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727436101] [2024-11-17 08:06:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1290907, now seen corresponding path program 1 times [2024-11-17 08:06:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209464183] [2024-11-17 08:06:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:53,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2019963029, now seen corresponding path program 1 times [2024-11-17 08:06:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966039457] [2024-11-17 08:06:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:53,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:55,003 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:06:55,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:06:55,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:06:55,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:06:55,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:06:55,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:55,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:06:55,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:06:55,004 INFO L132 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2024-11-17 08:06:55,004 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:06:55,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:06:55,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:55,992 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:06:55,992 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:06:55,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:55,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:55,994 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:06:55,995 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:06:55,996 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:06:56,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,020 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:06:56,021 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:06:56,022 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:06:56,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,043 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:06:56,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,044 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:06:56,046 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:06:56,046 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:06:56,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:56,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:56,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,069 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:06:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,070 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:06:56,071 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:06:56,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,094 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:06:56,095 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:06:56,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:06:56,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,118 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:06:56,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:06:56,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,142 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:06:56,144 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:06:56,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,166 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:06:56,168 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:06:56,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:56,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:56,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:56,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,190 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:06:56,191 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:06:56,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:56,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:56,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,216 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:06:56,217 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:06:56,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:56,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:56,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,244 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:06:56,245 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:06:56,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:56,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:56,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:56,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,269 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:06:56,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:06:56,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:56,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:56,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:56,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:56,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:56,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:56,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:06:56,296 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-17 08:06:56,296 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-17 08:06:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:56,297 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:06:56,299 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:06:56,309 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:06:56,309 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:06:56,309 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) ULTIMATE.start_f_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_f_~y~0#1.base) ULTIMATE.start_f_~y~0#1.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int#4 ULTIMATE.start_f_~d_ref~0#1.base) ULTIMATE.start_f_~d_ref~0#1.offset)_2 - 1 >= 0] [2024-11-17 08:06:56,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:56,484 INFO L156 tatePredicateManager]: 55 out of 56 supporting invariants were superfluous and have been removed [2024-11-17 08:06:56,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 08:06:56,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-17 08:06:56,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-11-17 08:06:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:56,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:06:56,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:56,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 08:06:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:56,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:06:56,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:56,623 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:06:56,623 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-17 08:06:56,624 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:06:56,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Result 41 states and 54 transitions. Complement of second has 10 states. [2024-11-17 08:06:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:06:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:06:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2024-11-17 08:06:56,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-17 08:06:56,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:56,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-17 08:06:56,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:56,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2024-11-17 08:06:56,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:56,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2024-11-17 08:06:56,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:56,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 53 transitions. [2024-11-17 08:06:56,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-17 08:06:56,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-17 08:06:56,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2024-11-17 08:06:56,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:56,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-17 08:06:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2024-11-17 08:06:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-17 08:06:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 38 states have internal predecessors, (52), 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:06:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-17 08:06:56,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-17 08:06:56,684 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-17 08:06:56,684 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:06:56,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2024-11-17 08:06:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:56,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:56,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:56,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:56,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:06:56,685 INFO L745 eck$LassoCheckResult]: Stem: 807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 808#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 824#L578 assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 817#L558-1 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 815#f_L1#2 assume true; 816#L562-2 assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 836#L562-3 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 822#f_L2#2 assume true; 823#L566-3 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 837#L566-5 assume !f_#t~short13#1; 809#L566-4 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 810#L567-2 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 833#f_P1#2 [2024-11-17 08:06:56,685 INFO L747 eck$LassoCheckResult]: Loop: 833#f_P1#2 assume true;call f_#t~mem15#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#2(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1; 834#L566-3 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 839#L566-5 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 842#L566-4 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 841#L567-2 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 833#f_P1#2 [2024-11-17 08:06:56,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1238332405, now seen corresponding path program 1 times [2024-11-17 08:06:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:56,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855406859] [2024-11-17 08:06:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:56,715 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:06:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855406859] [2024-11-17 08:06:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855406859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:06:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:06:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:06:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721008049] [2024-11-17 08:06:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:06:56,716 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:06:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 55624724, now seen corresponding path program 1 times [2024-11-17 08:06:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674163036] [2024-11-17 08:06:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:06:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:06:56,914 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:06:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:56,927 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-11-17 08:06:56,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 52 transitions. [2024-11-17 08:06:56,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:56,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 46 transitions. [2024-11-17 08:06:56,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-17 08:06:56,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-17 08:06:56,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2024-11-17 08:06:56,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:56,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-17 08:06:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2024-11-17 08:06:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-17 08:06:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:06:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-11-17 08:06:56,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-17 08:06:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:06:56,934 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-11-17 08:06:56,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:06:56,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2024-11-17 08:06:56,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-17 08:06:56,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:56,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:56,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:56,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:06:56,935 INFO L745 eck$LassoCheckResult]: Stem: 897#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 898#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1;havoc main_#t~nondet21#1; 914#L578 assume !(0 != main_#t~nondet21#1);havoc main_#t~nondet21#1;assume { :begin_inline_f } true;f_#in~d#1 := 2;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~malloc6#1.base, f_#t~malloc6#1.offset, f_#t~mem7#1, f_#t~mem8#1, f_#t~mem9#1, f_#t~mem10#1, f_#t~mem11#1, f_#t~mem12#1, f_#t~short13#1, f_#t~nondet14#1, f_#t~mem15#1, f_#t~mem16#1, f_#t~nondet17#1, f_#t~mem18#1, f_#t~mem19#1, f_#t~mem20#1, f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, f_~x~0#1.base, f_~x~0#1.offset, f_~y~0#1.base, f_~y~0#1.offset, f_~k~0#1.base, f_~k~0#1.offset, f_~z~0#1.base, f_~z~0#1.offset;f_~d#1 := f_#in~d#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~d_ref~0#1.base, f_~d_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~x~0#1.base, f_~x~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~y~0#1.base, f_~y~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~k~0#1.base, f_~k~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call f_#t~malloc6#1.base, f_#t~malloc6#1.offset := #Ultimate.allocOnStack(4);f_~z~0#1.base, f_~z~0#1.offset := f_#t~malloc6#1.base, f_#t~malloc6#1.offset;call write~int#4(f_~d#1, f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(1, f_~x~0#1.base, f_~x~0#1.offset, 4);call write~int#2(1, f_~y~0#1.base, f_~y~0#1.offset, 4);call write~int#1(1, f_~k~0#1.base, f_~k~0#1.offset, 4);call write~int#0(1, f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem7#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 907#L558-1 assume !(f_#t~mem7#1 > 1073741823);havoc f_#t~mem7#1; 905#f_L1#2 assume true; 906#L562-2 assume true;call f_#t~mem8#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call f_#t~mem9#1 := read~int#1(f_~k~0#1.base, f_~k~0#1.offset, 4); 925#L562-3 assume !(f_#t~mem8#1 < f_#t~mem9#1);havoc f_#t~mem8#1;havoc f_#t~mem9#1; 908#f_L2#2 assume true; 909#L566-3 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 928#L566-5 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 899#L566-4 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 900#L567-2 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 922#f_P1#2 [2024-11-17 08:06:56,935 INFO L747 eck$LassoCheckResult]: Loop: 922#f_P1#2 assume true;call f_#t~mem15#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);call f_#t~mem16#1 := read~int#4(f_~d_ref~0#1.base, f_~d_ref~0#1.offset, 4);call write~int#3(f_#t~mem15#1 - f_#t~mem16#1, f_~x~0#1.base, f_~x~0#1.offset, 4);havoc f_#t~nondet17#1;call write~int#2(f_#t~nondet17#1, f_~y~0#1.base, f_~y~0#1.offset, 4);havoc f_#t~nondet17#1;call f_#t~mem18#1 := read~int#0(f_~z~0#1.base, f_~z~0#1.offset, 4);call write~int#0(f_#t~mem18#1 - 1, f_~z~0#1.base, f_~z~0#1.offset, 4);havoc f_#t~mem18#1; 923#L566-3 assume true;call f_#t~mem11#1 := read~int#3(f_~x~0#1.base, f_~x~0#1.offset, 4);f_#t~short13#1 := f_#t~mem11#1 > 0; 926#L566-5 assume f_#t~short13#1;call f_#t~mem12#1 := read~int#2(f_~y~0#1.base, f_~y~0#1.offset, 4);f_#t~short13#1 := f_#t~mem12#1 > 0; 933#L566-4 assume !!f_#t~short13#1;havoc f_#t~mem11#1;havoc f_#t~mem12#1;havoc f_#t~short13#1;havoc f_#t~nondet14#1; 932#L567-2 assume 0 != f_#t~nondet14#1;havoc f_#t~nondet14#1; 922#f_P1#2 [2024-11-17 08:06:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1238331444, now seen corresponding path program 1 times [2024-11-17 08:06:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869006563] [2024-11-17 08:06:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 55624724, now seen corresponding path program 2 times [2024-11-17 08:06:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028705366] [2024-11-17 08:06:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:56,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:56,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:56,966 INFO L85 PathProgramCache]: Analyzing trace with hash -122782783, now seen corresponding path program 1 times [2024-11-17 08:06:56,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864497914] [2024-11-17 08:06:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864497914] [2024-11-17 08:06:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864497914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:06:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823324328] [2024-11-17 08:06:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:57,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:06:57,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:57,150 INFO L229 MonitoredProcess]: Starting monitored process 32 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:06:57,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-17 08:06:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:57,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:06:57,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:57,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 08:06:57,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:06:57,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-17 08:06:57,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-17 08:06:57,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 08:06:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:57,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:06:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823324328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:06:57,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:06:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-17 08:06:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358197155] [2024-11-17 08:06:57,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:06:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:06:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:06:57,488 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:06:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:57,544 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-17 08:06:57,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2024-11-17 08:06:57,545 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:06:57,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2024-11-17 08:06:57,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:06:57,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:06:57,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:06:57,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:06:57,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:57,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:06:57,546 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:57,546 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:06:57,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:06:57,546 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:06:57,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:06:57,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:06:57 BoogieIcfgContainer [2024-11-17 08:06:57,552 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:06:57,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:06:57,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:06:57,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:06:57,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:48" (3/4) ... [2024-11-17 08:06:57,554 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:06:57,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:06:57,555 INFO L158 Benchmark]: Toolchain (without parser) took 9559.92ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 109.7MB in the beginning and 136.4MB in the end (delta: -26.7MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,555 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:06:57,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.37ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 146.4MB in the end (delta: -37.0MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.90ms. Allocated memory is still 184.5MB. Free memory was 146.4MB in the beginning and 144.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,556 INFO L158 Benchmark]: Boogie Preprocessor took 38.51ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 141.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,556 INFO L158 Benchmark]: IcfgBuilder took 361.98ms. Allocated memory is still 184.5MB. Free memory was 141.2MB in the beginning and 119.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,556 INFO L158 Benchmark]: BuchiAutomizer took 8744.83ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 119.2MB in the beginning and 137.5MB in the end (delta: -18.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,556 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 268.4MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:06:57,557 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.37ms. Allocated memory is still 184.5MB. Free memory was 109.5MB in the beginning and 146.4MB in the end (delta: -37.0MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.90ms. Allocated memory is still 184.5MB. Free memory was 146.4MB in the beginning and 144.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.51ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 141.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 361.98ms. Allocated memory is still 184.5MB. Free memory was 141.2MB in the beginning and 119.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 8744.83ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 119.2MB in the beginning and 137.5MB in the end (delta: -18.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 268.4MB. Free memory was 137.5MB in the beginning and 136.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 122 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax105 hnf100 lsp94 ukn73 mio100 lsp25 div100 bol100 ite100 ukn100 eq166 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:06:57,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:57,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE