./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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.01_assume-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:39:19,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:39:19,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:39:19,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:39:19,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:39:19,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:39:19,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:39:19,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:39:19,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:39:19,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:39:19,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:39:19,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:39:19,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:39:19,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:39:19,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:39:19,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:39:19,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:39:19,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:39:19,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:39:19,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:39:19,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:39:19,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:39:19,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:39:19,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:39:19,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:39:19,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:39:19,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:39:19,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:39:19,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:39:19,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:39:19,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:39:19,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:39:19,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:39:19,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:39:19,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:39:19,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:39:19,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:39:19,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:39:19,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:39:19,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:39:19,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:39:19,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:39:19,732 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:39:19,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:39:19,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:39:19,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:39:19,735 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:39:19,735 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:39:19,736 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:39:19,736 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:39:19,736 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:39:19,736 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:39:19,737 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:39:19,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:39:19,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:39:19,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:39:19,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:39:19,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:39:19,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:39:19,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:39:19,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:39:19,740 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:39:19,740 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:39:19,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:39:19,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:39:19,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:39:19,741 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:39:19,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:39:19,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:39:19,742 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:39:19,742 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:39:19,743 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:39:19,743 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2020-10-20 06:39:19,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:39:19,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:39:19,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:39:19,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:39:19,974 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:39:19,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2020-10-20 06:39:20,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ef5cb17/e1e561e460f44162969d91533000a3c7/FLAG5365c19f1 [2020-10-20 06:39:20,601 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:39:20,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca.i [2020-10-20 06:39:20,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ef5cb17/e1e561e460f44162969d91533000a3c7/FLAG5365c19f1 [2020-10-20 06:39:20,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ef5cb17/e1e561e460f44162969d91533000a3c7 [2020-10-20 06:39:20,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:39:20,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:39:20,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:20,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:39:20,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:39:20,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:20" (1/1) ... [2020-10-20 06:39:20,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61619f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:20, skipping insertion in model container [2020-10-20 06:39:20,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:20" (1/1) ... [2020-10-20 06:39:20,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:39:20,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:39:21,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:21,267 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:39:21,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:21,380 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:39:21,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21 WrapperNode [2020-10-20 06:39:21,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:21,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:21,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:39:21,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:39:21,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:21,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:39:21,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:39:21,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:39:21,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (1/1) ... [2020-10-20 06:39:21,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:39:21,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:39:21,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:39:21,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:39:21,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (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-20 06:39:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:39:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:39:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:39:21,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:39:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:39:21,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:39:21,799 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:39:21,799 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:39:21,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:21 BoogieIcfgContainer [2020-10-20 06:39:21,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:39:21,802 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:39:21,802 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:39:21,811 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:39:21,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:21,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:39:20" (1/3) ... [2020-10-20 06:39:21,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23beae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:21, skipping insertion in model container [2020-10-20 06:39:21,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:21,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:21" (2/3) ... [2020-10-20 06:39:21,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23beae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:21, skipping insertion in model container [2020-10-20 06:39:21,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:21,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:21" (3/3) ... [2020-10-20 06:39:21,816 INFO L373 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca.i [2020-10-20 06:39:21,871 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:39:21,871 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:39:21,871 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:39:21,872 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:39:21,872 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:39:21,872 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:39:21,872 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:39:21,872 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:39:21,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:39:21,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:21,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:21,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:21,911 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:21,911 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:21,911 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:39:21,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-10-20 06:39:21,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:21,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:21,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:21,913 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:21,913 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:21,919 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 12#L553-3true [2020-10-20 06:39:21,920 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2020-10-20 06:39:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:39:21,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:21,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539026906] [2020-10-20 06:39:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2020-10-20 06:39:22,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5293861] [2020-10-20 06:39:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:22,130 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-20 06:39:22,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5293861] [2020-10-20 06:39:22,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:22,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:39:22,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781353025] [2020-10-20 06:39:22,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:22,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:39:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:39:22,155 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-20 06:39:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:22,161 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-10-20 06:39:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:39:22,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2020-10-20 06:39:22,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:22,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2020-10-20 06:39:22,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:39:22,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:39:22,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-10-20 06:39:22,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:22,170 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-20 06:39:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-10-20 06:39:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:39:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:39:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-10-20 06:39:22,193 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-20 06:39:22,193 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-10-20 06:39:22,193 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:39:22,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-10-20 06:39:22,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-20 06:39:22,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:22,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:22,195 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:22,195 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:39:22,195 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 37#L553-3 [2020-10-20 06:39:22,195 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2020-10-20 06:39:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 06:39:22,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879609415] [2020-10-20 06:39:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,234 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2020-10-20 06:39:22,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470471597] [2020-10-20 06:39:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:22,313 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-20 06:39:22,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470471597] [2020-10-20 06:39:22,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:22,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:39:22,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766015809] [2020-10-20 06:39:22,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:22,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:22,316 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2020-10-20 06:39:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:22,403 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-10-20 06:39:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:22,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-20 06:39:22,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-20 06:39:22,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2020-10-20 06:39:22,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 06:39:22,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:39:22,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-10-20 06:39:22,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:22,407 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-20 06:39:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-10-20 06:39:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2020-10-20 06:39:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:39:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-10-20 06:39:22,409 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-10-20 06:39:22,409 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-10-20 06:39:22,409 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:39:22,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-10-20 06:39:22,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-10-20 06:39:22,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:22,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:22,411 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:39:22,411 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:39:22,411 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 73#L553-3 [2020-10-20 06:39:22,411 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2020-10-20 06:39:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 06:39:22,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060969677] [2020-10-20 06:39:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,444 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2020-10-20 06:39:22,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007021591] [2020-10-20 06:39:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2020-10-20 06:39:22,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:22,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500302010] [2020-10-20 06:39:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:22,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:22,549 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:22,692 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2020-10-20 06:39:23,002 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-10-20 06:39:23,113 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-20 06:39:23,133 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:23,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:23,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:23,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:23,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:23,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:23,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:23,135 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:23,135 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration3_Lasso [2020-10-20 06:39:23,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:23,136 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:23,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-20 06:39:23,181 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-20 06:39:23,186 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-20 06:39:23,190 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-20 06:39:23,195 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-20 06:39:23,394 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-10-20 06:39:23,484 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-20 06:39:23,490 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-20 06:39:23,494 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-20 06:39:23,496 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-20 06:39:23,499 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-20 06:39:23,502 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-20 06:39:23,504 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-20 06:39:23,507 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-20 06:39:23,509 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-20 06:39:23,511 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-20 06:39:23,514 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-20 06:39:23,518 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-20 06:39:23,521 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-20 06:39:23,524 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-20 06:39:23,527 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-20 06:39:23,962 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:23,966 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-20 06:39:23,978 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 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:23,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:23,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:23,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:23,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:23,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:23,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:23,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:23,991 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) [2020-10-20 06:39:24,039 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-20 06:39:24,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:24,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:24,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:24,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:24,050 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-20 06:39:24,099 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-20 06:39:24,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:24,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:24,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:24,108 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) [2020-10-20 06:39:24,145 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-20 06:39:24,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:24,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:24,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:24,151 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-20 06:39:24,193 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-20 06:39:24,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:24,202 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-20 06:39:24,211 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) [2020-10-20 06:39:24,255 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-20 06:39:24,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:24,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:24,272 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) [2020-10-20 06:39:24,316 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-20 06:39:24,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:24,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:24,330 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-20 06:39:24,367 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-20 06:39:24,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:24,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:24,375 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-20 06:39:24,414 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-20 06:39:24,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:24,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:24,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:24,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:24,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:24,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:24,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:24,449 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 06:39:24,449 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 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-20 06:39:24,458 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-20 06:39:24,467 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:39:24,467 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:24,468 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) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2020-10-20 06:39:24,596 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:39:24,610 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:24,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:39:24,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:24,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:39:24,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:24,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-10-20 06:39:24,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:24,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:24,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:39:24,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2020-10-20 06:39:24,816 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-20 06:39:24,820 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-20 06:39:24,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-10-20 06:39:24,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2020-10-20 06:39:24,936 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-20 06:39:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:39:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-10-20 06:39:24,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2020-10-20 06:39:24,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:24,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2020-10-20 06:39:24,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:24,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2020-10-20 06:39:24,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:24,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-10-20 06:39:24,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-10-20 06:39:24,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2020-10-20 06:39:24,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 06:39:24,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 06:39:24,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2020-10-20 06:39:24,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:24,946 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-10-20 06:39:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2020-10-20 06:39:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2020-10-20 06:39:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:39:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-10-20 06:39:24,949 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:39:24,950 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:39:24,950 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:39:24,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-10-20 06:39:24,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-10-20 06:39:24,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:24,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:24,952 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:39:24,952 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:24,952 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2020-10-20 06:39:24,953 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2020-10-20 06:39:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-20 06:39:24,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:24,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92692254] [2020-10-20 06:39:24,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,979 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2020-10-20 06:39:24,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:24,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964213405] [2020-10-20 06:39:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:25,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964213405] [2020-10-20 06:39:25,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799578714] [2020-10-20 06:39:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:39:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:25,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:39:25,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:25,085 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:39:25,085 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:25,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:25,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:25,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 06:39:25,097 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 25 treesize of output 13 [2020-10-20 06:39:25,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:25,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:25,101 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:25,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-10-20 06:39:25,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:25,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:25,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-10-20 06:39:25,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186861759] [2020-10-20 06:39:25,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:25,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:25,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:39:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:39:25,138 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2020-10-20 06:39:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:25,256 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2020-10-20 06:39:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:39:25,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2020-10-20 06:39:25,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-10-20 06:39:25,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2020-10-20 06:39:25,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:39:25,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 06:39:25,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2020-10-20 06:39:25,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:25,265 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2020-10-20 06:39:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2020-10-20 06:39:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-10-20 06:39:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-20 06:39:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2020-10-20 06:39:25,272 INFO L714 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2020-10-20 06:39:25,272 INFO L594 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2020-10-20 06:39:25,272 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:39:25,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2020-10-20 06:39:25,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 06:39:25,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:25,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:25,275 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:39:25,276 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:25,276 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2020-10-20 06:39:25,277 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2020-10-20 06:39:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-10-20 06:39:25,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:25,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846463769] [2020-10-20 06:39:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2020-10-20 06:39:25,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:25,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108172305] [2020-10-20 06:39:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2020-10-20 06:39:25,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:25,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493873114] [2020-10-20 06:39:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:25,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:25,418 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:25,666 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2020-10-20 06:39:25,876 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-10-20 06:39:25,948 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:25,948 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:25,949 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:25,949 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:25,949 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:25,949 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:25,949 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:25,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:25,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration5_Lasso [2020-10-20 06:39:25,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:25,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:25,953 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-20 06:39:26,111 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-10-20 06:39:26,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-20 06:39:26,190 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-20 06:39:26,192 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-20 06:39:26,195 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-20 06:39:26,197 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-20 06:39:26,199 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-20 06:39:26,201 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-20 06:39:26,204 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-20 06:39:26,206 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-20 06:39:26,209 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-20 06:39:26,211 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-20 06:39:26,213 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-20 06:39:26,215 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-20 06:39:26,218 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-20 06:39:26,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-20 06:39:26,222 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-20 06:39:26,225 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-20 06:39:26,227 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-20 06:39:26,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:26,654 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 06:39:26,661 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-20 06:39:26,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:26,679 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-20 06:39:26,729 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-20 06:39:26,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,736 INFO L402 nArgumentSynthesizer]: A total of 2 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-20 06:39:26,748 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-20 06:39:26,804 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-20 06:39:26,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,810 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-20 06:39:26,816 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-20 06:39:26,852 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-20 06:39:26,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:26,873 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-20 06:39:26,907 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-20 06:39:26,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:26,930 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:26,944 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 06:39:26,945 INFO L444 ModelExtractionUtils]: 12 out of 19 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:26,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:26,959 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:39:26,959 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:26,959 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2020-10-20 06:39:27,021 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:39:27,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:27,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:27,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:27,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 06:39:27,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:27,124 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:27,125 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 1 case distinctions, treesize of input 19 treesize of output 42 [2020-10-20 06:39:27,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,129 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:27,149 INFO L625 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-10-20 06:39:27,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:27,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:23 [2020-10-20 06:39:27,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,285 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:27,285 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 69 [2020-10-20 06:39:27,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:27,292 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:39:27,295 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:27,326 INFO L625 ElimStorePlain]: treesize reduction 49, result has 38.8 percent of original size [2020-10-20 06:39:27,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:27,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:31 [2020-10-20 06:39:27,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:27,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:27,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:27,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:38,802 WARN L193 SmtUtils]: Spent 11.37 s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-20 06:39:38,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:39:38,920 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:38,921 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2020-10-20 06:39:38,922 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:38,926 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 29 [2020-10-20 06:39:38,927 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:38,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:38,955 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-20 06:39:38,956 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:109, output treesize:83 [2020-10-20 06:39:40,446 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-20 06:39:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:40,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-20 06:39:40,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2020-10-20 06:39:45,791 WARN L193 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-10-20 06:39:46,008 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2020-10-20 06:39:46,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2020-10-20 06:39:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:39:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2020-10-20 06:39:46,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2020-10-20 06:39:46,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:46,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2020-10-20 06:39:46,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:46,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2020-10-20 06:39:46,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:46,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2020-10-20 06:39:46,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2020-10-20 06:39:46,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2020-10-20 06:39:46,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-20 06:39:46,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2020-10-20 06:39:46,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2020-10-20 06:39:46,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:46,104 INFO L691 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2020-10-20 06:39:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2020-10-20 06:39:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-10-20 06:39:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-20 06:39:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2020-10-20 06:39:46,112 INFO L714 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2020-10-20 06:39:46,112 INFO L594 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2020-10-20 06:39:46,113 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:39:46,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2020-10-20 06:39:46,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2020-10-20 06:39:46,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:46,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:46,115 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:46,115 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2020-10-20 06:39:46,115 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2020-10-20 06:39:46,115 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2020-10-20 06:39:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-20 06:39:46,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:46,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655483324] [2020-10-20 06:39:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,132 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2020-10-20 06:39:46,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:46,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428899418] [2020-10-20 06:39:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:46,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2020-10-20 06:39:46,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:46,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901295290] [2020-10-20 06:39:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:46,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901295290] [2020-10-20 06:39:46,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183310865] [2020-10-20 06:39:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:39:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:46,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:39:46,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:46,287 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:39:46,287 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:46,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 06:39:46,295 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 25 treesize of output 13 [2020-10-20 06:39:46,296 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:46,297 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-10-20 06:39:46,311 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 25 treesize of output 13 [2020-10-20 06:39:46,312 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:46,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:46,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-10-20 06:39:46,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:46,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:46,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-10-20 06:39:46,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572571886] [2020-10-20 06:39:46,723 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2020-10-20 06:39:46,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:39:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:39:46,771 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2020-10-20 06:39:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:46,934 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2020-10-20 06:39:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:39:46,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2020-10-20 06:39:46,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2020-10-20 06:39:46,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2020-10-20 06:39:46,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-20 06:39:46,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-10-20 06:39:46,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2020-10-20 06:39:46,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:46,942 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2020-10-20 06:39:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2020-10-20 06:39:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2020-10-20 06:39:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 06:39:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2020-10-20 06:39:46,952 INFO L714 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2020-10-20 06:39:46,952 INFO L594 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2020-10-20 06:39:46,952 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:39:46,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2020-10-20 06:39:46,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2020-10-20 06:39:46,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:46,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:46,955 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:46,955 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:39:46,955 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2020-10-20 06:39:46,955 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2020-10-20 06:39:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-20 06:39:46,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:46,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18175109] [2020-10-20 06:39:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2020-10-20 06:39:46,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:46,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536165191] [2020-10-20 06:39:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:46,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:47,001 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2020-10-20 06:39:47,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:47,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068652122] [2020-10-20 06:39:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:47,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:47,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:47,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:47,464 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2020-10-20 06:39:47,727 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2020-10-20 06:39:47,824 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:47,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:47,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:47,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:47,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:47,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:47,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:47,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:47,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration7_Lasso [2020-10-20 06:39:47,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:47,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:47,829 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-20 06:39:47,837 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-20 06:39:47,843 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-20 06:39:47,845 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-20 06:39:47,848 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-20 06:39:47,850 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-20 06:39:47,851 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-20 06:39:47,855 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-20 06:39:47,861 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-20 06:39:47,862 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-20 06:39:47,866 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-20 06:39:47,868 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-20 06:39:47,873 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-20 06:39:47,875 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-20 06:39:47,877 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-20 06:39:47,880 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-20 06:39:47,882 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-20 06:39:47,885 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-20 06:39:48,065 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-10-20 06:39:48,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-20 06:39:48,176 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-20 06:39:48,577 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:48,577 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 06:39:48,584 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-20 06:39:48,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,588 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:48,610 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-20 06:39:48,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,614 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:48,636 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-20 06:39:48,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,643 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-20 06:39:48,668 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-20 06:39:48,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:48,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:48,679 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:48,716 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:48,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,720 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:48,742 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-20 06:39:48,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,745 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-20 06:39:48,747 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-20 06:39:48,773 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-20 06:39:48,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:48,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:48,779 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 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-20 06:39:48,800 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-20 06:39:48,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:48,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:48,807 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 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-20 06:39:48,830 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-20 06:39:48,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,834 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-20 06:39:48,856 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-20 06:39:48,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:48,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:48,862 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-20 06:39:48,884 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-20 06:39:48,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,893 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-20 06:39:48,916 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-20 06:39:48,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,920 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) [2020-10-20 06:39:48,944 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 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:48,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:48,947 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) [2020-10-20 06:39:48,978 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-20 06:39:48,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:48,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:48,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:48,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:48,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:48,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:48,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:48,983 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-20 06:39:49,007 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-20 06:39:49,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:49,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:49,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:49,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:49,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:49,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:49,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:49,011 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-20 06:39:49,032 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-20 06:39:49,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:49,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:49,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:49,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:49,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:49,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:49,037 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-20 06:39:49,060 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-20 06:39:49,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:49,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:49,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:49,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:49,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:49,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:49,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:49,063 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:49,088 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-20 06:39:49,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:49,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:49,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:49,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:49,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:49,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:49,107 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:49,133 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-20 06:39:49,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:49,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:49,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:49,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:49,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:49,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:49,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:49,178 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 06:39:49,178 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:49,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:49,185 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:39:49,185 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:49,185 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-10-20 06:39:49,244 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:39:49,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:49,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:49,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:49,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:39:49,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:49,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:49,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:49,391 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:49,391 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-10-20 06:39:49,400 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-20 06:39:49,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:49,404 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,480 INFO L625 ElimStorePlain]: treesize reduction 26, result has 82.7 percent of original size [2020-10-20 06:39:49,481 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:124 [2020-10-20 06:39:49,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:49,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:49,551 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 41 [2020-10-20 06:39:49,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:49,563 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2020-10-20 06:39:49,565 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:49,608 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:39:49,608 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:133, output treesize:135 [2020-10-20 06:39:49,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:39:49,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 58 [2020-10-20 06:39:49,706 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,712 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:49,713 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 52 [2020-10-20 06:39:49,714 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:49,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:49,753 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:39:49,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:169, output treesize:135 [2020-10-20 06:39:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:49,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-10-20 06:39:49,845 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2020-10-20 06:39:50,442 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2020-10-20 06:39:50,626 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-10-20 06:39:50,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2020-10-20 06:39:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:39:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2020-10-20 06:39:50,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-20 06:39:50,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:50,937 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:39:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:50,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:50,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:50,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:39:50,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:50,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:50,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:51,089 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:51,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 66 [2020-10-20 06:39:51,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:51,098 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:39:51,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,158 INFO L625 ElimStorePlain]: treesize reduction 79, result has 38.8 percent of original size [2020-10-20 06:39:51,158 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,158 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:50 [2020-10-20 06:39:51,200 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 37 [2020-10-20 06:39:51,202 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,210 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:51,211 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2020-10-20 06:39:51,212 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:51,245 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:39:51,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:125, output treesize:127 [2020-10-20 06:39:51,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:51,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:39:51,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 48 [2020-10-20 06:39:51,329 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,335 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:51,335 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 54 [2020-10-20 06:39:51,337 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:51,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:51,376 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-20 06:39:51,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:161, output treesize:127 [2020-10-20 06:39:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:51,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2020-10-20 06:39:51,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2020-10-20 06:39:52,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 361 states and 453 transitions. Complement of second has 31 states. [2020-10-20 06:39:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:39:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2020-10-20 06:39:52,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-20 06:39:52,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:52,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 18 letters. Loop has 14 letters. [2020-10-20 06:39:52,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:52,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 35 transitions. Stem has 4 letters. Loop has 28 letters. [2020-10-20 06:39:52,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:52,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 453 transitions. [2020-10-20 06:39:52,597 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-10-20 06:39:52,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 290 states and 370 transitions. [2020-10-20 06:39:52,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2020-10-20 06:39:52,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-20 06:39:52,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 370 transitions. [2020-10-20 06:39:52,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:52,601 INFO L691 BuchiCegarLoop]: Abstraction has 290 states and 370 transitions. [2020-10-20 06:39:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 370 transitions. [2020-10-20 06:39:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 233. [2020-10-20 06:39:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-10-20 06:39:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2020-10-20 06:39:52,619 INFO L714 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2020-10-20 06:39:52,619 INFO L594 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2020-10-20 06:39:52,619 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:39:52,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2020-10-20 06:39:52,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-10-20 06:39:52,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:52,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:52,622 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:52,622 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:52,622 INFO L794 eck$LassoCheckResult]: Stem: 1956#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1954#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 1955#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1957#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1958#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2020-10-20 06:39:52,623 INFO L796 eck$LassoCheckResult]: Loop: 1971#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1962#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1963#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1966#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1971#L555-1 [2020-10-20 06:39:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-10-20 06:39:52,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:52,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814006222] [2020-10-20 06:39:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2020-10-20 06:39:52,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:52,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125582750] [2020-10-20 06:39:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:52,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2020-10-20 06:39:52,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:52,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820816142] [2020-10-20 06:39:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:52,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:52,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:52,790 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-10-20 06:39:53,115 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2020-10-20 06:39:53,230 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-20 06:39:53,233 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:53,233 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:53,233 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:53,233 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:53,233 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:53,234 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:53,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:53,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:53,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration8_Lasso [2020-10-20 06:39:53,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:53,234 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:53,237 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-20 06:39:53,239 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-20 06:39:53,241 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-20 06:39:53,243 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-20 06:39:53,245 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-20 06:39:53,257 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-20 06:39:53,979 WARN L193 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2020-10-20 06:39:54,108 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-20 06:39:54,109 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-20 06:39:54,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-20 06:39:54,113 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-20 06:39:54,115 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-20 06:39:54,118 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-20 06:39:54,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-20 06:39:54,122 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-20 06:39:54,129 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-20 06:39:54,132 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-20 06:39:54,134 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-20 06:39:54,756 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-10-20 06:39:54,914 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-10-20 06:39:54,948 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:54,948 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:54,960 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-20 06:39:54,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:54,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:54,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:54,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:54,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:54,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:54,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:54,963 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:54,984 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-20 06:39:54,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:54,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:54,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:54,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:54,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:54,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:54,989 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,011 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-20 06:39:55,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:55,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:55,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:55,020 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,044 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-20 06:39:55,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:55,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:55,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:55,047 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,069 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-20 06:39:55,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:55,075 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,096 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-20 06:39:55,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:55,105 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,126 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-20 06:39:55,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:55,137 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,158 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-20 06:39:55,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:55,177 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:55,211 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-20 06:39:55,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:55,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:55,257 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-20 06:39:55,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:55,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:55,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:55,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:55,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,269 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:55,306 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-20 06:39:55,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:55,308 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 06:39:55,309 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:39:55,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,333 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-10-20 06:39:55,334 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:39:55,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:55,470 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 06:39:55,470 INFO L444 ModelExtractionUtils]: 21 out of 46 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:55,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:55,481 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:39:55,481 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:55,481 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2020-10-20 06:39:55,531 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:39:55,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:39:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:55,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:55,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:55,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:39:55,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:55,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:55,622 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 43 treesize of output 23 [2020-10-20 06:39:55,623 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:55,637 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:47 [2020-10-20 06:39:55,658 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-20 06:39:55,658 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-20 06:39:55,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2020-10-20 06:39:55,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2020-10-20 06:39:55,702 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-20 06:39:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:39:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-20 06:39:55,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 06:39:55,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:55,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2020-10-20 06:39:55,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:55,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2020-10-20 06:39:55,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:55,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2020-10-20 06:39:55,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-10-20 06:39:55,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2020-10-20 06:39:55,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-10-20 06:39:55,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-10-20 06:39:55,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2020-10-20 06:39:55,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:55,720 INFO L691 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2020-10-20 06:39:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2020-10-20 06:39:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2020-10-20 06:39:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-10-20 06:39:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2020-10-20 06:39:55,747 INFO L714 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2020-10-20 06:39:55,747 INFO L594 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2020-10-20 06:39:55,747 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:39:55,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2020-10-20 06:39:55,749 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-10-20 06:39:55,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:55,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:55,750 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:55,750 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:55,750 INFO L794 eck$LassoCheckResult]: Stem: 2661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2659#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 2660#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2842#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2807#L555-1 assume !test_fun_#t~short8; 2737#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2732#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2686#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2020-10-20 06:39:55,751 INFO L796 eck$LassoCheckResult]: Loop: 2687#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2735#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2725#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2663#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2707#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2693#L555-1 assume !test_fun_#t~short8; 2695#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 2679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2680#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2687#L553-1 [2020-10-20 06:39:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2020-10-20 06:39:55,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:55,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183744772] [2020-10-20 06:39:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:55,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:55,765 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:55,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2020-10-20 06:39:55,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:55,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409007592] [2020-10-20 06:39:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:55,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:55,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:55,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2020-10-20 06:39:55,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:55,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273708510] [2020-10-20 06:39:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:39:55,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273708510] [2020-10-20 06:39:55,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773446733] [2020-10-20 06:39:55,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:39:55,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 06:39:55,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:39:55,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 06:39:55,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:55,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-20 06:39:55,970 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:55,972 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-10-20 06:39:55,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:39:55,978 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:55,983 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:55,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-10-20 06:39:55,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:55,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,046 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-10-20 06:39:56,046 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:56,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:19 [2020-10-20 06:39:56,078 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-20 06:39:56,080 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:56,086 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-10-20 06:39:56,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:39:56,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:56,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-10-20 06:39:56,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430341756] [2020-10-20 06:39:56,376 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2020-10-20 06:39:56,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:39:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:39:56,419 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 13 states. [2020-10-20 06:39:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:56,555 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2020-10-20 06:39:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:39:56,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2020-10-20 06:39:56,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2020-10-20 06:39:56,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2020-10-20 06:39:56,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-10-20 06:39:56,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-20 06:39:56,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2020-10-20 06:39:56,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:56,561 INFO L691 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2020-10-20 06:39:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2020-10-20 06:39:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2020-10-20 06:39:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-20 06:39:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2020-10-20 06:39:56,578 INFO L714 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2020-10-20 06:39:56,579 INFO L594 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2020-10-20 06:39:56,579 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:39:56,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2020-10-20 06:39:56,580 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-10-20 06:39:56,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:56,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:56,581 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:56,581 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:39:56,581 INFO L794 eck$LassoCheckResult]: Stem: 3318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3316#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 3317#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3363#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3362#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3357#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3358#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3353#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3354#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3350#L555-1 assume !test_fun_#t~short8; 3349#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3348#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3346#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3334#L553-1 [2020-10-20 06:39:56,582 INFO L796 eck$LassoCheckResult]: Loop: 3334#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3413#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3410#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3408#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3406#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3403#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3401#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3398#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3399#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3392#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3393#L555-1 assume !test_fun_#t~short8; 3344#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3345#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3333#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3334#L553-1 [2020-10-20 06:39:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2020-10-20 06:39:56,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:56,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91928484] [2020-10-20 06:39:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:56,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:56,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:56,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2020-10-20 06:39:56,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:56,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018486332] [2020-10-20 06:39:56,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:56,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:56,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:56,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2020-10-20 06:39:56,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:56,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530486261] [2020-10-20 06:39:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:39:56,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530486261] [2020-10-20 06:39:56,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475878531] [2020-10-20 06:39:56,822 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:39:56,870 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-10-20 06:39:56,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:39:56,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 06:39:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:56,883 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:39:56,883 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:56,893 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:56,893 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-10-20 06:39:56,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,986 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:56,987 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2020-10-20 06:39:56,988 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:39:56,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:56,998 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,036 INFO L625 ElimStorePlain]: treesize reduction 32, result has 50.8 percent of original size [2020-10-20 06:39:57,036 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:33 [2020-10-20 06:39:57,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:57,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:57,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:57,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 06:39:57,204 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:57,205 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2020-10-20 06:39:57,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,215 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2020-10-20 06:39:57,215 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,239 INFO L625 ElimStorePlain]: treesize reduction 31, result has 47.5 percent of original size [2020-10-20 06:39:57,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:28 [2020-10-20 06:39:57,292 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:57,293 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 62 [2020-10-20 06:39:57,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 06:39:57,298 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-20 06:39:57,302 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,332 INFO L625 ElimStorePlain]: treesize reduction 41, result has 43.1 percent of original size [2020-10-20 06:39:57,332 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:57,332 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2020-10-20 06:39:57,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:57,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:57,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:57,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:57,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:57,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:39:57,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 06:39:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 06:39:57,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:57,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2020-10-20 06:39:57,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991862234] [2020-10-20 06:39:57,915 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-10-20 06:39:57,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 06:39:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2020-10-20 06:39:57,953 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 22 states. [2020-10-20 06:39:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:58,401 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2020-10-20 06:39:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 06:39:58,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2020-10-20 06:39:58,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:39:58,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2020-10-20 06:39:58,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 06:39:58,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 06:39:58,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2020-10-20 06:39:58,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:58,404 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2020-10-20 06:39:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2020-10-20 06:39:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2020-10-20 06:39:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 06:39:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-10-20 06:39:58,406 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-10-20 06:39:58,406 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-10-20 06:39:58,406 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:39:58,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2020-10-20 06:39:58,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:39:58,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:58,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:58,407 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:39:58,407 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:39:58,407 INFO L794 eck$LassoCheckResult]: Stem: 3679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3677#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 3678#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3684#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3685#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3715#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3714#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3713#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3712#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3711#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3710#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3709#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3708#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3697#L555-1 assume !test_fun_#t~short8; 3695#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 3694#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3693#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3686#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3687#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3691#L555-1 [2020-10-20 06:39:58,408 INFO L796 eck$LassoCheckResult]: Loop: 3691#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3680#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3681#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3688#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3691#L555-1 [2020-10-20 06:39:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2020-10-20 06:39:58,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:58,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20462131] [2020-10-20 06:39:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,446 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2020-10-20 06:39:58,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:58,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789345604] [2020-10-20 06:39:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2020-10-20 06:39:58,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:58,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504627310] [2020-10-20 06:39:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:58,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:58,530 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:58,652 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-10-20 06:40:00,652 WARN L193 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 202 DAG size of output: 150 [2020-10-20 06:40:00,802 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 06:40:00,806 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:40:00,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:40:00,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:40:00,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:40:00,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:40:00,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:00,807 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:40:00,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:40:00,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca.i_Iteration11_Lasso [2020-10-20 06:40:00,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:40:00,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:40:00,810 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-20 06:40:00,811 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-20 06:40:00,816 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-20 06:40:00,819 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-20 06:40:00,822 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-20 06:40:00,824 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-20 06:40:00,827 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-20 06:40:00,829 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-20 06:40:00,832 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-20 06:40:01,042 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-20 06:40:01,171 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-20 06:40:01,173 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-20 06:40:01,180 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-20 06:40:01,183 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-20 06:40:01,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-20 06:40:01,187 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-20 06:40:01,190 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-20 06:40:01,193 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-20 06:40:01,195 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-20 06:40:01,198 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-20 06:40:01,690 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-10-20 06:40:01,796 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:40:01,797 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,800 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-20 06:40:01,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:01,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:01,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:01,803 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,825 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-20 06:40:01,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:01,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:01,834 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,857 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-20 06:40:01,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:01,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:01,862 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,885 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-20 06:40:01,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:01,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:01,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:01,888 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,910 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-20 06:40:01,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:01,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:01,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:01,913 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,935 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-20 06:40:01,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:01,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:01,941 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,964 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-20 06:40:01,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:01,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:01,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:01,967 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:01,989 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-20 06:40:01,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:01,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:40:01,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:01,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:01,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:01,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:40:01,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:40:01,993 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:02,013 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-20 06:40:02,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:02,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:02,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:02,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:02,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:02,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:02,034 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:40:02,056 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-20 06:40:02,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:02,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:02,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:40:02,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:02,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:40:02,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:40:02,062 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:02,089 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-20 06:40:02,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:40:02,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:40:02,090 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:40:02,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:40:02,117 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-20 06:40:02,117 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:40:02,178 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:40:02,249 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 06:40:02,249 INFO L444 ModelExtractionUtils]: 20 out of 46 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:40:02,251 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:40:02,254 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-10-20 06:40:02,254 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:40:02,254 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2020-10-20 06:40:02,309 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 06:40:02,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-20 06:40:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:02,417 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 43 treesize of output 23 [2020-10-20 06:40:02,418 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:02,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2020-10-20 06:40:02,447 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-20 06:40:02,448 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-20 06:40:02,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 06:40:02,486 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2020-10-20 06:40:02,487 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-20 06:40:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-10-20 06:40:02,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:40:02,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:02,488 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:02,584 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 43 treesize of output 23 [2020-10-20 06:40:02,585 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:02,596 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:47 [2020-10-20 06:40:02,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-20 06:40:02,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-20 06:40:02,618 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 06:40:02,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2020-10-20 06:40:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 06:40:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2020-10-20 06:40:02,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:40:02,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:02,673 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:40:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:40:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:40:02,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:40:02,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:40:02,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:40:02,813 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 43 treesize of output 23 [2020-10-20 06:40:02,814 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:40:02,824 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:40:02,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:47 [2020-10-20 06:40:02,847 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-20 06:40:02,848 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-20 06:40:02,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-10-20 06:40:02,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2020-10-20 06:40:02,895 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-20 06:40:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:40:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-20 06:40:02,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:40:02,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:02,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2020-10-20 06:40:02,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:02,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-20 06:40:02,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:40:02,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2020-10-20 06:40:02,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:02,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2020-10-20 06:40:02,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:40:02,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:40:02,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:40:02,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:40:02,899 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:02,899 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:02,899 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:40:02,899 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:40:02,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:40:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:40:02,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:40:02,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:40:02 BoogieIcfgContainer [2020-10-20 06:40:02,909 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:40:02,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:40:02,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:40:02,910 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:40:02,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:21" (3/4) ... [2020-10-20 06:40:02,914 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:40:02,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:40:02,916 INFO L168 Benchmark]: Toolchain (without parser) took 42053.50 ms. Allocated memory was 39.8 MB in the beginning and 134.7 MB in the end (delta: 94.9 MB). Free memory was 20.5 MB in the beginning and 85.9 MB in the end (delta: -65.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,916 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 30.4 MB. Free memory was 5.8 MB in the beginning and 5.8 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.62 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 19.6 MB in the beginning and 25.5 MB in the end (delta: -5.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.67 ms. Allocated memory is still 42.5 MB. Free memory was 25.5 MB in the beginning and 23.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,917 INFO L168 Benchmark]: Boogie Preprocessor took 24.21 ms. Allocated memory is still 42.5 MB. Free memory was 23.6 MB in the beginning and 22.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,918 INFO L168 Benchmark]: RCFGBuilder took 351.05 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 22.0 MB in the beginning and 21.4 MB in the end (delta: 581.9 kB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,918 INFO L168 Benchmark]: BuchiAutomizer took 41107.62 ms. Allocated memory was 44.0 MB in the beginning and 134.7 MB in the end (delta: 90.7 MB). Free memory was 21.4 MB in the beginning and 85.9 MB in the end (delta: -64.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:40:02,919 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 134.7 MB. Free memory is still 85.9 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:40:02,921 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.26 ms. Allocated memory is still 30.4 MB. Free memory was 5.8 MB in the beginning and 5.8 MB in the end (delta: 41.5 kB). Peak memory consumption was 41.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 512.62 ms. Allocated memory was 39.8 MB in the beginning and 42.5 MB in the end (delta: 2.6 MB). Free memory was 19.6 MB in the beginning and 25.5 MB in the end (delta: -5.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 43.67 ms. Allocated memory is still 42.5 MB. Free memory was 25.5 MB in the beginning and 23.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 24.21 ms. Allocated memory is still 42.5 MB. Free memory was 23.6 MB in the beginning and 22.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 351.05 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 22.0 MB in the beginning and 21.4 MB in the end (delta: 581.9 kB). Peak memory consumption was 12.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 41107.62 ms. Allocated memory was 44.0 MB in the beginning and 134.7 MB in the end (delta: 90.7 MB). Free memory was 21.4 MB in the beginning and 85.9 MB in the end (delta: -64.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.77 ms. Allocated memory is still 134.7 MB. Free memory is still 85.9 MB. There was no memory consumed. Max. memory is 14.3 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 16 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.0s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 16.2s. Construction of modules took 1.0s. Büchi inclusion checks took 23.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 189 SDslu, 84 SDs, 0 SdLazy, 753 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital310 mio100 ax106 hnf99 lsp92 ukn57 mio100 lsp36 div100 bol105 ite100 ukn100 eq165 hnf90 smp94 dnf172 smp82 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 180ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...