./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/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/c.03-alloca-1.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.graphml --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 4eacdd25ec766896c06b3ec61ff2eab4c80478ff ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:20:47,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:20:47,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:20:47,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:20:47,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:20:47,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:20:47,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:20:47,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:20:47,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:20:47,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:20:47,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:20:47,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:20:47,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:20:47,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:20:47,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:20:47,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:20:47,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:20:47,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:20:47,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:20:47,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:20:47,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:20:47,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:20:47,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:20:47,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:20:47,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:20:47,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:20:47,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:20:47,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:20:47,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:20:47,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:20:47,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:20:47,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:20:47,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:20:47,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:20:47,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:20:47,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:20:47,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:20:47,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:20:47,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:20:47,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:20:47,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:20:47,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:20:47,884 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:20:47,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:20:47,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:20:47,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:20:47,890 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:20:47,890 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:20:47,890 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:20:47,891 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:20:47,891 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:20:47,891 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:20:47,893 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:20:47,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:20:47,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:20:47,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:20:47,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:20:47,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:20:47,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:20:47,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:20:47,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:20:47,895 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:20:47,895 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:20:47,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:20:47,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:20:47,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:20:47,896 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:20:47,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:20:47,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:20:47,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:20:47,897 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:20:47,899 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:20:47,900 INFO L138 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.graphml 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 -> 4eacdd25ec766896c06b3ec61ff2eab4c80478ff [2020-10-26 04:20:48,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:20:48,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:20:48,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:20:48,348 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:20:48,349 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:20:48,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2020-10-26 04:20:48,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd37f407/7e3a03699c2846ffb9920f4941f7f1bc/FLAGa6a807e62 [2020-10-26 04:20:49,124 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:20:49,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2020-10-26 04:20:49,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd37f407/7e3a03699c2846ffb9920f4941f7f1bc/FLAGa6a807e62 [2020-10-26 04:20:49,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd37f407/7e3a03699c2846ffb9920f4941f7f1bc [2020-10-26 04:20:49,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:20:49,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:20:49,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:20:49,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:20:49,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:20:49,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:20:49" (1/1) ... [2020-10-26 04:20:49,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f16072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:49, skipping insertion in model container [2020-10-26 04:20:49,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:20:49" (1/1) ... [2020-10-26 04:20:49,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:20:49,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:20:49,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:20:49,878 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:20:49,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:20:50,004 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:20:50,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50 WrapperNode [2020-10-26 04:20:50,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:20:50,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:20:50,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:20:50,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:20:50,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:20:50,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:20:50,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:20:50,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:20:50,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... [2020-10-26 04:20:50,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:20:50,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:20:50,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:20:50,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:20:50,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:20:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:20:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:20:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:20:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:20:50,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:20:50,514 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:20:50,514 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-26 04:20:50,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:50 BoogieIcfgContainer [2020-10-26 04:20:50,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:20:50,518 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:20:50,518 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:20:50,527 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:20:50,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:50,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:20:49" (1/3) ... [2020-10-26 04:20:50,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49dd7b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:20:50, skipping insertion in model container [2020-10-26 04:20:50,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:50,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:20:50" (2/3) ... [2020-10-26 04:20:50,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49dd7b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:20:50, skipping insertion in model container [2020-10-26 04:20:50,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:20:50,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:50" (3/3) ... [2020-10-26 04:20:50,542 INFO L373 chiAutomizerObserver]: Analyzing ICFG c.03-alloca-1.i [2020-10-26 04:20:50,613 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:20:50,614 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:20:50,614 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:20:50,614 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:20:50,615 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:20:50,615 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:20:50,615 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:20:50,616 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:20:50,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:20:50,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:50,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:50,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:50,674 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:20:50,674 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:50,674 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:20:50,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:20:50,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:50,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:50,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:50,680 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:20:50,680 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:50,691 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 9#L558-2true [2020-10-26 04:20:50,694 INFO L796 eck$LassoCheckResult]: Loop: 9#L558-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 10#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 13#L557-3true assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 5#L558true assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 9#L558-2true [2020-10-26 04:20:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:20:50,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:50,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868875398] [2020-10-26 04:20:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,128 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2020-10-26 04:20:51,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:51,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796040800] [2020-10-26 04:20:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2020-10-26 04:20:51,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:51,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159416681] [2020-10-26 04:20:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:51,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:51,335 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:51,584 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 04:20:52,614 WARN L193 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-10-26 04:20:53,072 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-26 04:20:53,087 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:20:53,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:20:53,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:20:53,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:20:53,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:20:53,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:53,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:20:53,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:20:53,089 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration1_Lasso [2020-10-26 04:20:53,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:20:53,090 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:20:53,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:53,922 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2020-10-26 04:20:54,138 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-10-26 04:20:54,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:54,535 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-10-26 04:20:54,995 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:20:55,001 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:55,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:55,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:55,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:55,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:55,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:55,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:55,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:55,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:55,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:20:55,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:20:55,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:20:55,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:55,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:55,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:55,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:55,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:55,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:55,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:55,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:55,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:20:55,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:20:55,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:20:55,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:20:55,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:20:55,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:20:55,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:20:55,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:20:55,694 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-26 04:20:55,694 INFO L444 ModelExtractionUtils]: 14 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:20:55,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:55,720 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:20:55,721 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:20:55,722 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, ULTIMATE.start_test_fun_~z) = -4294967292*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967291*ULTIMATE.start_test_fun_~z Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*ULTIMATE.start_test_fun_~z >= 0] [2020-10-26 04:20:55,990 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-10-26 04:20:56,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:20:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:56,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 04:20:56,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:56,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:20:56,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:20:56,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:20:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:20:56,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:20:56,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-10-26 04:20:56,432 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 34 states and 42 transitions. Complement of second has 10 states. [2020-10-26 04:20:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:20:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:20:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-10-26 04:20:56,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-26 04:20:56,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:56,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:20:56,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:56,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-26 04:20:56,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:20:56,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2020-10-26 04:20:56,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:56,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 14 states and 20 transitions. [2020-10-26 04:20:56,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:20:56,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-26 04:20:56,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2020-10-26 04:20:56,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:56,467 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-26 04:20:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2020-10-26 04:20:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-26 04:20:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-26 04:20:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-10-26 04:20:56,502 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-26 04:20:56,503 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-26 04:20:56,504 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:20:56,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-10-26 04:20:56,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:56,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:56,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:56,507 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:20:56,508 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:56,509 INFO L794 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 268#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 269#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 277#L557-1 assume !test_fun_#t~short9; 278#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 270#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 271#L558-2 [2020-10-26 04:20:56,509 INFO L796 eck$LassoCheckResult]: Loop: 271#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 275#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 281#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 280#L558 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 271#L558-2 [2020-10-26 04:20:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2020-10-26 04:20:56,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:56,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997459694] [2020-10-26 04:20:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:20:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:20:56,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997459694] [2020-10-26 04:20:56,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:20:56,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:20:56,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541008455] [2020-10-26 04:20:56,623 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:20:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2020-10-26 04:20:56,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:56,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811884329] [2020-10-26 04:20:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:56,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:56,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:56,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:56,811 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 04:20:56,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:20:56,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:20:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:20:56,876 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-26 04:20:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:20:56,896 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-10-26 04:20:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:20:56,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2020-10-26 04:20:56,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:56,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2020-10-26 04:20:56,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-26 04:20:56,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-26 04:20:56,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-10-26 04:20:56,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:20:56,902 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:20:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-10-26 04:20:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-26 04:20:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-26 04:20:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-10-26 04:20:56,905 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:20:56,905 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-26 04:20:56,905 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:20:56,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-10-26 04:20:56,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:20:56,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:20:56,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:20:56,907 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:20:56,908 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:20:56,908 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 305#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 306#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 314#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 315#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 307#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 308#L558-2 [2020-10-26 04:20:56,908 INFO L796 eck$LassoCheckResult]: Loop: 308#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 312#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 318#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 317#L558 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 308#L558-2 [2020-10-26 04:20:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2020-10-26 04:20:56,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:56,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133776949] [2020-10-26 04:20:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:56,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:56,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:56,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:56,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2020-10-26 04:20:56,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:56,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292520919] [2020-10-26 04:20:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:56,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:57,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:57,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:20:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2020-10-26 04:20:57,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:20:57,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455918791] [2020-10-26 04:20:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:20:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:57,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:20:57,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:20:57,074 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:20:57,215 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 04:20:58,802 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 167 DAG size of output: 134 [2020-10-26 04:20:59,289 WARN L193 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-26 04:20:59,292 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:20:59,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:20:59,292 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:20:59,292 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:20:59,292 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:20:59,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:20:59,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:20:59,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:20:59,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration3_Lasso [2020-10-26 04:20:59,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:20:59,293 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:20:59,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:59,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:59,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:59,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:20:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,186 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2020-10-26 04:21:00,432 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-10-26 04:21:00,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:00,912 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-10-26 04:21:01,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:21:01,461 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:01,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:21:01,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:21:01,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:21:01,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:01,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:21:01,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:21:01,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:01,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:01,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:01,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:01,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:01,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:01,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:01,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:01,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:01,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:01,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:01,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:01,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:01,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:01,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:01,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:02,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:02,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:02,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:21:02,067 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-26 04:21:02,068 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:02,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:02,084 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:21:02,084 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:21:02,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -4294967292*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 + 4294967291*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-10-26 04:21:02,325 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-10-26 04:21:02,327 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:21:02,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:21:02,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:02,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:21:02,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:02,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-26 04:21:02,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:02,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:21:02,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:21:02,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:21:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:21:02,579 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:21:02,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-10-26 04:21:02,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 22 states and 27 transitions. Complement of second has 9 states. [2020-10-26 04:21:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:21:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:21:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-10-26 04:21:02,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:21:02,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:02,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-26 04:21:02,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:02,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2020-10-26 04:21:02,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:02,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-10-26 04:21:02,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:21:02,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2020-10-26 04:21:02,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:21:02,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:21:02,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-10-26 04:21:02,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:21:02,715 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 04:21:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-10-26 04:21:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-26 04:21:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 04:21:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-26 04:21:02,718 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 04:21:02,719 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 04:21:02,719 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:21:02,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-26 04:21:02,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:21:02,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:21:02,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:21:02,720 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2020-10-26 04:21:02,720 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:21:02,721 INFO L794 eck$LassoCheckResult]: Stem: 571#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 565#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 566#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 582#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 580#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 578#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 577#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 572#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 573#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 567#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 568#L558-2 [2020-10-26 04:21:02,721 INFO L796 eck$LassoCheckResult]: Loop: 568#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 576#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 581#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 579#L558 assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 568#L558-2 [2020-10-26 04:21:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2020-10-26 04:21:02,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:02,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317476044] [2020-10-26 04:21:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,771 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2020-10-26 04:21:02,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:02,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238625387] [2020-10-26 04:21:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,787 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2020-10-26 04:21:02,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:02,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135699753] [2020-10-26 04:21:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:02,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:02,851 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:03,008 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-26 04:21:04,581 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 204 DAG size of output: 154 [2020-10-26 04:21:05,208 WARN L193 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-26 04:21:05,212 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:21:05,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:21:05,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:21:05,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:21:05,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:21:05,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:05,213 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:21:05,213 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:21:05,213 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration4_Lasso [2020-10-26 04:21:05,213 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:21:05,213 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:21:05,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:05,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,077 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2020-10-26 04:21:06,291 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-10-26 04:21:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:06,693 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-10-26 04:21:07,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:21:07,309 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:07,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:07,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:07,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:21:07,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:07,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:07,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:07,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:21:07,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:07,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:07,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:07,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:07,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:07,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:07,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:07,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:07,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:07,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:21:07,440 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-26 04:21:07,440 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:07,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:21:07,448 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:21:07,448 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:21:07,448 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 4294967291 Supporting invariants [] [2020-10-26 04:21:07,667 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-10-26 04:21:07,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:21:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:07,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:21:07,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:07,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:21:07,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:07,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:21:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:21:07,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-26 04:21:07,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-10-26 04:21:07,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 34 states and 43 transitions. Complement of second has 8 states. [2020-10-26 04:21:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:21:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:21:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-26 04:21:07,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-26 04:21:07,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-26 04:21:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 8 letters. [2020-10-26 04:21:07,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:07,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2020-10-26 04:21:07,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:21:07,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2020-10-26 04:21:07,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:21:07,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:21:07,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2020-10-26 04:21:07,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:21:07,879 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-10-26 04:21:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2020-10-26 04:21:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-10-26 04:21:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 04:21:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-10-26 04:21:07,883 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 04:21:07,883 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-26 04:21:07,883 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:21:07,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2020-10-26 04:21:07,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:21:07,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:21:07,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:21:07,886 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-26 04:21:07,887 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:21:07,887 INFO L794 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 839#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 840#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 855#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 854#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 853#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 852#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 846#L557-1 [2020-10-26 04:21:07,887 INFO L796 eck$LassoCheckResult]: Loop: 846#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 847#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 841#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 842#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 846#L557-1 [2020-10-26 04:21:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849212, now seen corresponding path program 3 times [2020-10-26 04:21:07,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:07,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24041675] [2020-10-26 04:21:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:07,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:07,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:07,934 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1239449, now seen corresponding path program 1 times [2020-10-26 04:21:07,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:07,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988708812] [2020-10-26 04:21:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:07,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:07,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:07,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash -322541356, now seen corresponding path program 4 times [2020-10-26 04:21:07,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:21:07,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636582924] [2020-10-26 04:21:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:21:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:07,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:21:08,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:21:08,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:21:08,235 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2020-10-26 04:21:09,479 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 182 DAG size of output: 143 [2020-10-26 04:21:09,870 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-26 04:21:09,875 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:21:09,875 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:21:09,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:21:09,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:21:09,876 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:21:09,876 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:09,876 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:21:09,876 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:21:09,876 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration5_Lasso [2020-10-26 04:21:09,876 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:21:09,876 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:21:09,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:10,731 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2020-10-26 04:21:11,057 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2020-10-26 04:21:11,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:21:11,429 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-26 04:21:12,345 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-10-26 04:21:12,422 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:21:12,422 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:21:12,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:21:12,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:21:12,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:21:12,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:21:12,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:21:12,788 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-26 04:21:12,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:21:12,819 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-26 04:21:12,820 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-26 04:21:12,888 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:21:12,949 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-26 04:21:12,949 INFO L444 ModelExtractionUtils]: 40 out of 81 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:21:12,961 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:21:12,969 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-26 04:21:12,969 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:21:12,969 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_4 + 4294967293 Supporting invariants [] [2020-10-26 04:21:13,220 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-10-26 04:21:13,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:21:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:21:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:13,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:21:13,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:21:13,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:21:13,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:21:13,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:21:13,376 INFO L384 Elim1Store]: Elim1 did not use preprocessing 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 [2020-10-26 04:21:13,377 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:21:13,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:21:13,384 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:21:13,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-10-26 04:21:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:21:13,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:21:13,408 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-10-26 04:21:13,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 55 states and 71 transitions. Complement of second has 8 states. [2020-10-26 04:21:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:21:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-26 04:21:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-10-26 04:21:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-26 04:21:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-26 04:21:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 8 letters. [2020-10-26 04:21:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:21:13,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2020-10-26 04:21:13,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:21:13,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-10-26 04:21:13,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:21:13,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:21:13,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:21:13,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:21:13,472 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:21:13,472 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:21:13,472 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:21:13,472 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:21:13,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:21:13,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:21:13,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:21:13,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:21:13 BoogieIcfgContainer [2020-10-26 04:21:13,478 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:21:13,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:21:13,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:21:13,479 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:21:13,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:20:50" (3/4) ... [2020-10-26 04:21:13,482 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:21:13,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:21:13,484 INFO L168 Benchmark]: Toolchain (without parser) took 24028.16 ms. Allocated memory was 46.1 MB in the beginning and 211.8 MB in the end (delta: 165.7 MB). Free memory was 22.8 MB in the beginning and 105.3 MB in the end (delta: -82.5 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,485 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 37.7 MB. Free memory is still 20.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:21:13,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.95 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 24.3 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 46.1 MB. Free memory was 24.3 MB in the beginning and 22.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,487 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 46.1 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,487 INFO L168 Benchmark]: RCFGBuilder took 427.25 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 26.5 MB in the end (delta: -5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,488 INFO L168 Benchmark]: BuchiAutomizer took 22960.75 ms. Allocated memory was 56.6 MB in the beginning and 211.8 MB in the end (delta: 155.2 MB). Free memory was 26.3 MB in the beginning and 105.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 77.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:21:13,489 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 211.8 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:21:13,494 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 37.7 MB. Free memory is still 20.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 541.95 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 24.3 MB in the end (delta: -2.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.71 ms. Allocated memory is still 46.1 MB. Free memory was 24.3 MB in the beginning and 22.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 46.1 MB. Free memory was 22.6 MB in the beginning and 21.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 427.25 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.2 MB in the beginning and 26.5 MB in the end (delta: -5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 22960.75 ms. Allocated memory was 56.6 MB in the beginning and 211.8 MB in the end (delta: 155.2 MB). Free memory was 26.3 MB in the beginning and 105.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 77.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.04 ms. Allocated memory is still 211.8 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4294967292 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 * z and consists of 6 locations. One deterministic module has affine ranking function -4294967292 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 21.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 22 SDslu, 11 SDs, 0 SdLazy, 63 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1128 mio100 ax102 hnf99 lsp96 ukn27 mio100 lsp33 div100 bol102 ite100 ukn100 eq182 hnf88 smp97 dnf125 smp91 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 186ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...