./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.06-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 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:37:49,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:37:49,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:37:49,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:37:49,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:37:49,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:37:49,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:37:49,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:37:49,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:37:49,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:37:49,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:37:49,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:37:49,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:37:49,096 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:37:49,096 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:37:49,097 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:37:49,097 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:37:49,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:37:49,097 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:37:49,098 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:37:49,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:37:49,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:37:49,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:37:49,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:37:49,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:37:49,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:37:49,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:37:49,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:37:49,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:37:49,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:37:49,103 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:37:49,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:37:49,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:37:49,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:37:49,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:37:49,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:37:49,104 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:37:49,104 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 -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2024-11-10 22:37:49,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:37:49,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:37:49,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:37:49,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:37:49,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:37:49,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2024-11-10 22:37:50,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:37:50,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:37:50,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2024-11-10 22:37:51,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2141724/98975ad2a89249438d295cbf37da8fe2/FLAG9e8651887 [2024-11-10 22:37:51,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2141724/98975ad2a89249438d295cbf37da8fe2 [2024-11-10 22:37:51,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:37:51,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:37:51,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:37:51,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:37:51,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:37:51,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a3685a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51, skipping insertion in model container [2024-11-10 22:37:51,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:37:51,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:37:51,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:37:51,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:37:51,486 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:37:51,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51 WrapperNode [2024-11-10 22:37:51,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:37:51,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:37:51,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:37:51,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:37:51,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,523 INFO L138 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-11-10 22:37:51,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:37:51,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:37:51,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:37:51,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:37:51,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,545 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 9, 7, 2]. 45 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [1, 2, 2, 1]. [2024-11-10 22:37:51,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:37:51,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:37:51,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:37:51,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:37:51,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (1/1) ... [2024-11-10 22:37:51,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:51,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:51,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:37:51,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:37:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:37:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 22:37:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 22:37:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:37:51,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:37:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 22:37:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 22:37:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:37:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:37:51,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:37:51,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:37:51,729 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:37:51,730 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:37:51,862 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L564: havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;havoc main_#t~ret29#1; [2024-11-10 22:37:51,862 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc test_fun_#t~mem25#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset);havoc test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset; [2024-11-10 22:37:51,877 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-10 22:37:51,877 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:37:51,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:37:51,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:37:51,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:51 BoogieIcfgContainer [2024-11-10 22:37:51,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:37:51,895 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:37:51,895 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:37:51,899 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:37:51,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:51,900 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:37:51" (1/3) ... [2024-11-10 22:37:51,901 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67229396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:51, skipping insertion in model container [2024-11-10 22:37:51,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:51,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:51" (2/3) ... [2024-11-10 22:37:51,901 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67229396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:51, skipping insertion in model container [2024-11-10 22:37:51,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:37:51,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:51" (3/3) ... [2024-11-10 22:37:51,903 INFO L332 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2024-11-10 22:37:51,945 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:37:51,945 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:37:51,945 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:37:51,945 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:37:51,945 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:37:51,946 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:37:51,946 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:37:51,946 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:37:51,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:51,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:51,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:51,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:51,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:51,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:37:51,968 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:37:51,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:51,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:51,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:51,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:51,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:37:51,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:37:51,974 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 16#L557true [2024-11-10 22:37:51,975 INFO L747 eck$LassoCheckResult]: Loop: 16#L557true assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 14#L557-12true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 7#L557-11true test_fun_#t~short14#1 := test_fun_#t~short9#1; 17#L557-10true assume test_fun_#t~short14#1; 11#L557-7true test_fun_#t~short18#1 := test_fun_#t~short14#1; 15#L557-6true assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 13#L557-5true test_fun_#t~short20#1 := test_fun_#t~short18#1; 9#L557-4true assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 19#L557-3true test_fun_#t~short22#1 := test_fun_#t~short20#1; 5#L557-2true assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 20#L557-1true assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 16#L557true [2024-11-10 22:37:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2024-11-10 22:37:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554212070] [2024-11-10 22:37:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1660324722, now seen corresponding path program 1 times [2024-11-10 22:37:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226962641] [2024-11-10 22:37:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:52,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 97639027, now seen corresponding path program 1 times [2024-11-10 22:37:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430927685] [2024-11-10 22:37:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:52,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:53,784 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:37:53,785 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:37:53,785 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:37:53,785 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:37:53,785 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:37:53,785 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:53,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:37:53,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:37:53,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration1_Lasso [2024-11-10 22:37:53,789 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:37:53,790 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:37:53,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:53,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:54,950 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:37:54,954 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:37:54,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:54,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:54,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:54,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:37:54,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:54,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:54,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:54,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:54,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:54,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:54,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:54,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:54,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:54,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-10 22:37:54,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:54,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:54,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:37:54,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:55,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:55,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:55,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:55,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:55,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:55,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:55,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:55,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:55,025 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-10 22:37:55,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:55,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:37:55,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:55,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:55,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:55,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:55,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:55,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:55,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:55,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:55,064 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-10 22:37:55,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:55,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:55,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:55,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:37:55,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:55,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:55,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:55,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:55,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:55,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:55,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:55,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:37:55,132 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-10 22:37:55,132 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-10 22:37:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:55,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:55,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:37:55,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:37:55,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:37:55,170 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:37:55,171 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~z_ref~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~z_ref~0#1.base) 0)_1 + 4294967293 Supporting invariants [] [2024-11-10 22:37:55,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:55,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:37:55,326 INFO L156 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2024-11-10 22:37:55,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-10 22:37:55,334 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-10 22:37:55,334 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-10 22:37:55,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:55,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:37:55,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:55,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:37:55,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 22:37:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:55,734 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-10 22:37:55,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:55,905 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 84 transitions. Complement of second has 14 states. [2024-11-10 22:37:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-10 22:37:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2024-11-10 22:37:55,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 2 letters. Loop has 11 letters. [2024-11-10 22:37:55,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:55,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 13 letters. Loop has 11 letters. [2024-11-10 22:37:55,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:55,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 2 letters. Loop has 22 letters. [2024-11-10 22:37:55,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:55,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 84 transitions. [2024-11-10 22:37:55,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:55,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 38 states and 55 transitions. [2024-11-10 22:37:55,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-10 22:37:55,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-10 22:37:55,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2024-11-10 22:37:55,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:37:55,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 55 transitions. [2024-11-10 22:37:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2024-11-10 22:37:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-10 22:37:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2024-11-10 22:37:55,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-11-10 22:37:55,948 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-11-10 22:37:55,948 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:37:55,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 53 transitions. [2024-11-10 22:37:55,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:37:55,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:55,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:55,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 22:37:55,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:37:55,950 INFO L745 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 318#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 336#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 337#L557-12 [2024-11-10 22:37:55,950 INFO L747 eck$LassoCheckResult]: Loop: 337#L557-12 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 323#L557-11 test_fun_#t~short14#1 := test_fun_#t~short9#1; 324#L557-10 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 341#L557-9 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 313#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 314#L557-7 test_fun_#t~short18#1 := test_fun_#t~short14#1; 331#L557-6 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 334#L557-5 test_fun_#t~short20#1 := test_fun_#t~short18#1; 327#L557-4 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 328#L557-3 test_fun_#t~short22#1 := test_fun_#t~short20#1; 319#L557-2 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 320#L557-1 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 339#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 337#L557-12 [2024-11-10 22:37:55,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 60540, now seen corresponding path program 1 times [2024-11-10 22:37:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359978696] [2024-11-10 22:37:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:55,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 814335554, now seen corresponding path program 1 times [2024-11-10 22:37:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469075849] [2024-11-10 22:37:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469075849] [2024-11-10 22:37:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469075849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:37:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:37:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 22:37:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891050594] [2024-11-10 22:37:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:37:56,274 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:37:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:37:56,277 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:56,479 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2024-11-10 22:37:56,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 106 transitions. [2024-11-10 22:37:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-11-10 22:37:56,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 61 states and 79 transitions. [2024-11-10 22:37:56,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-10 22:37:56,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-10 22:37:56,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2024-11-10 22:37:56,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:37:56,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 79 transitions. [2024-11-10 22:37:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2024-11-10 22:37:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2024-11-10 22:37:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-10 22:37:56,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-10 22:37:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 22:37:56,489 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-10 22:37:56,489 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:37:56,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2024-11-10 22:37:56,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-10 22:37:56,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:56,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:56,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 22:37:56,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:37:56,491 INFO L745 eck$LassoCheckResult]: Stem: 456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 457#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 474#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 475#L557-12 [2024-11-10 22:37:56,491 INFO L747 eck$LassoCheckResult]: Loop: 475#L557-12 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 476#L557-11 test_fun_#t~short14#1 := test_fun_#t~short9#1; 493#L557-10 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 484#L557-9 assume !test_fun_#t~short13#1; 452#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 453#L557-7 test_fun_#t~short18#1 := test_fun_#t~short14#1; 470#L557-6 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 472#L557-5 test_fun_#t~short20#1 := test_fun_#t~short18#1; 466#L557-4 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 467#L557-3 test_fun_#t~short22#1 := test_fun_#t~short20#1; 458#L557-2 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 459#L557-1 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 479#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 475#L557-12 [2024-11-10 22:37:56,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 60540, now seen corresponding path program 2 times [2024-11-10 22:37:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149865355] [2024-11-10 22:37:56,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash 617822049, now seen corresponding path program 1 times [2024-11-10 22:37:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601272463] [2024-11-10 22:37:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:37:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601272463] [2024-11-10 22:37:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601272463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:37:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:37:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 22:37:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289941753] [2024-11-10 22:37:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:37:56,569 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:37:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:37:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:37:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 22:37:56,570 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:37:56,592 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-11-10 22:37:56,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 66 transitions. [2024-11-10 22:37:56,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-10 22:37:56,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 66 transitions. [2024-11-10 22:37:56,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-10 22:37:56,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-10 22:37:56,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 66 transitions. [2024-11-10 22:37:56,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:37:56,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 66 transitions. [2024-11-10 22:37:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 66 transitions. [2024-11-10 22:37:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-10 22:37:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-10 22:37:56,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-10 22:37:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:37:56,598 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-10 22:37:56,598 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:37:56,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2024-11-10 22:37:56,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-10 22:37:56,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:37:56,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:37:56,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 22:37:56,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:37:56,599 INFO L745 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 560#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int#3(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#0(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 578#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 582#L557-12 [2024-11-10 22:37:56,599 INFO L747 eck$LassoCheckResult]: Loop: 582#L557-12 assume !test_fun_#t~short9#1; 565#L557-11 test_fun_#t~short14#1 := test_fun_#t~short9#1; 566#L557-10 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 600#L557-9 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 599#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 573#L557-7 test_fun_#t~short18#1 := test_fun_#t~short14#1; 574#L557-6 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int#3(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 576#L557-5 test_fun_#t~short20#1 := test_fun_#t~short18#1; 569#L557-4 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 570#L557-3 test_fun_#t~short22#1 := test_fun_#t~short20#1; 561#L557-2 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 562#L557-1 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int#2(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int#2(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 590#L557 assume true;call test_fun_#t~mem6#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 582#L557-12 [2024-11-10 22:37:56,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 60540, now seen corresponding path program 3 times [2024-11-10 22:37:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119939676] [2024-11-10 22:37:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:56,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 520932547, now seen corresponding path program 1 times [2024-11-10 22:37:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383492148] [2024-11-10 22:37:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:56,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash 444284968, now seen corresponding path program 1 times [2024-11-10 22:37:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:37:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514128742] [2024-11-10 22:37:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:37:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:37:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:37:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:37:56,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:37:57,611 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:37:57,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:37:57,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:37:57,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:37:57,612 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:37:57,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:57,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:37:57,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:37:57,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration4_Lasso [2024-11-10 22:37:57,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:37:57,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:37:57,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:57,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:37:58,712 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:37:58,712 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:37:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:37:58,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:37:58,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:37:58,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:37:58,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 22:37:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,830 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:37:58,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 22:37:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,856 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:37:58,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 22:37:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,884 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:37:58,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:37:58,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,913 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:37:58,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:37:58,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:37:58,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:37:58,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 22:37:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,940 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:37:58,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:58,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:58,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:58,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:37:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:58,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:58,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:37:58,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:58,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:58,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:58,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:58,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:58,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:58,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:58,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:37:59,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,023 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:37:59,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 22:37:59,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,060 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:37:59,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,088 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-10 22:37:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,094 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:37:59,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 22:37:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,154 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:37:59,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:59,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,188 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:37:59,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,230 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-10 22:37:59,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,232 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-10 22:37:59,236 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-10 22:37:59,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,255 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 22:37:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,269 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 22:37:59,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:37:59,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:37:59,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:37:59,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:37:59,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:37:59,317 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-10 22:37:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,318 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 22:37:59,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:37:59,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:37:59,330 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-10 22:37:59,330 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:37:59,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:37:59,347 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-11-10 22:37:59,347 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-10 22:37:59,378 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:37:59,446 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2024-11-10 22:37:59,446 INFO L444 ModelExtractionUtils]: 12 out of 41 variables were initially zero. Simplification set additionally 26 variables to zero. [2024-11-10 22:37:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:37:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:37:59,449 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:37:59,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 22:37:59,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:37:59,462 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-10 22:37:59,462 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:37:59,462 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~z_ref~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_test_fun_~z_ref~0#1.base) 0)_2 + 4294967293 Supporting invariants [] [2024-11-10 22:37:59,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 22:37:59,566 INFO L156 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2024-11-10 22:37:59,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-10 22:37:59,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-10 22:37:59,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~z_ref~0!base,]]] [2024-11-10 22:37:59,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:37:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:59,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 22:37:59,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:37:59,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 22:37:59,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:37:59,716 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 36 treesize of output 20 [2024-11-10 22:37:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:37:59,729 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-10 22:37:59,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 16 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:59,794 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-10 22:37:59,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 16. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 98 states and 133 transitions. Complement of second has 7 states. [2024-11-10 22:37:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:37:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:37:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2024-11-10 22:37:59,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 3 letters. Loop has 13 letters. [2024-11-10 22:37:59,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:59,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 13 letters. [2024-11-10 22:37:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:59,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 3 letters. Loop has 26 letters. [2024-11-10 22:37:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:37:59,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 133 transitions. [2024-11-10 22:37:59,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:37:59,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 0 states and 0 transitions. [2024-11-10 22:37:59,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 22:37:59,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 22:37:59,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 22:37:59,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:37:59,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:37:59,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:37:59,811 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:37:59,811 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:37:59,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 22:37:59,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:37:59,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 22:37:59,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:37:59 BoogieIcfgContainer [2024-11-10 22:37:59,821 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:37:59,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:37:59,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:37:59,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:37:59,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:37:51" (3/4) ... [2024-11-10 22:37:59,824 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:37:59,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:37:59,827 INFO L158 Benchmark]: Toolchain (without parser) took 8789.66ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.4MB in the beginning and 288.3MB in the end (delta: -217.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:37:59,827 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:37:59,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.34ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 70.2MB in the beginning and 176.4MB in the end (delta: -106.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-10 22:37:59,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.10ms. Allocated memory is still 211.8MB. Free memory was 176.4MB in the beginning and 174.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:37:59,830 INFO L158 Benchmark]: Boogie Preprocessor took 28.89ms. Allocated memory is still 211.8MB. Free memory was 174.3MB in the beginning and 172.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:37:59,830 INFO L158 Benchmark]: IcfgBuilder took 340.44ms. Allocated memory is still 211.8MB. Free memory was 172.2MB in the beginning and 154.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 22:37:59,830 INFO L158 Benchmark]: BuchiAutomizer took 7926.29ms. Allocated memory was 211.8MB in the beginning and 335.5MB in the end (delta: 123.7MB). Free memory was 154.4MB in the beginning and 288.3MB in the end (delta: -133.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:37:59,830 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 335.5MB. Free memory is still 288.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:37:59,833 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.15ms. Allocated memory is still 142.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.34ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 70.2MB in the beginning and 176.4MB in the end (delta: -106.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.10ms. Allocated memory is still 211.8MB. Free memory was 176.4MB in the beginning and 174.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.89ms. Allocated memory is still 211.8MB. Free memory was 174.3MB in the beginning and 172.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 340.44ms. Allocated memory is still 211.8MB. Free memory was 172.2MB in the beginning and 154.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7926.29ms. Allocated memory was 211.8MB in the beginning and 335.5MB in the end (delta: 123.7MB). Free memory was 154.4MB in the beginning and 288.3MB in the end (delta: -133.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 335.5MB. Free memory is still 288.3MB. There was no memory consumed. 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[~z_ref~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[~z_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 8 locations. One deterministic module has affine ranking function null and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 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, 113 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 71 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital337 mio100 ax105 hnf100 lsp99 ukn65 mio100 lsp28 div100 bol104 ite100 ukn100 eq157 hnf91 smp100 dnf222 smp73 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 144ms VariablesStem: 7 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 22:37:59,856 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