./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.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 f5878942b695ddbfe46daa43f5d95028455ef120 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:02,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:02,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:02,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:02,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:02,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:02,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:02,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:02,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:02,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:02,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:02,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:02,644 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:02,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:02,650 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:02,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:02,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:02,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:02,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:02,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:02,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:02,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:02,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:02,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:02,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:02,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:02,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:02,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:02,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:02,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:02,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:02,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:02,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:02,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:02,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:02,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:02,685 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:02,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:02,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:02,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:02,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:02,712 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:02,712 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:02,712 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:02,713 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:02,713 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:02,714 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:02,714 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:02,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:02,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:02,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:02,715 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:02,716 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:02,717 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:02,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:02,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:02,718 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:02,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:02,718 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:02,719 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:02,719 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:02,720 INFO L133 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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-11-28 23:19:02,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:02,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:02,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:02,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:02,784 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:02,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:02,845 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f9e483b/ae451e3087cd498aabd281c0284b22e2/FLAG641485a73 [2018-11-28 23:19:03,346 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:03,346 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:03,359 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f9e483b/ae451e3087cd498aabd281c0284b22e2/FLAG641485a73 [2018-11-28 23:19:03,649 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40f9e483b/ae451e3087cd498aabd281c0284b22e2 [2018-11-28 23:19:03,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:03,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:03,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:03,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:03,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:03,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9ec91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03, skipping insertion in model container [2018-11-28 23:19:03,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:03,734 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:04,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:04,125 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:04,199 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:04,334 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:04,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04 WrapperNode [2018-11-28 23:19:04,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:04,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:04,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:04,336 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:04,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:04,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:04,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:04,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:04,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (1/1) ... [2018-11-28 23:19:04,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:04,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:04,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:04,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:04,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (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 [2018-11-28 23:19:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:04,850 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:04,851 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:04,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04 BoogieIcfgContainer [2018-11-28 23:19:04,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:04,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:04,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:04,857 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:04,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:03" (1/3) ... [2018-11-28 23:19:04,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41349086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:04, skipping insertion in model container [2018-11-28 23:19:04,860 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:04" (2/3) ... [2018-11-28 23:19:04,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41349086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:04, skipping insertion in model container [2018-11-28 23:19:04,862 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04" (3/3) ... [2018-11-28 23:19:04,864 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:04,933 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:04,933 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:04,934 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:04,934 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:04,934 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:04,934 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:04,934 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:04,934 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:04,935 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:04,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:04,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:04,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:04,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:04,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:04,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:04,977 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:04,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:04,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:04,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:04,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:04,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:04,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:04,988 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2018-11-28 23:19:04,989 INFO L796 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 13#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L557-3true assume !true; 4#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2018-11-28 23:19:04,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:04,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:04,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-28 23:19:05,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:05,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:05,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:05,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:05,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:05,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:05,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:05,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:05,241 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 23:19:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:05,248 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-28 23:19:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:05,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 23:19:05,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:05,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-28 23:19:05,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:05,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:05,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 23:19:05,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:05,259 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 23:19:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:19:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 23:19:05,290 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:05,290 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:05,290 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:05,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 23:19:05,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:05,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:05,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:05,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:05,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:05,292 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-11-28 23:19:05,292 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 36#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 38#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 34#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 33#L555-3 [2018-11-28 23:19:05,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:19:05,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:05,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-28 23:19:05,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:05,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:05,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:05,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-28 23:19:05,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:05,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:05,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:05,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:05,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:19:06,212 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:19:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:19:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:19:06,254 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-28 23:19:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:06,375 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 23:19:06,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:19:06,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:19:06,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:06,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:19:06,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:06,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:06,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-28 23:19:06,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:06,382 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:19:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-28 23:19:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:19:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:19:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:19:06,384 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:19:06,384 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:19:06,384 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:06,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 23:19:06,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:06,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:06,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:06,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:06,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:19:06,386 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 62#L555-3 [2018-11-28 23:19:06,386 INFO L796 eck$LassoCheckResult]: Loop: 62#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 65#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 68#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 66#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 67#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 69#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 63#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 62#L555-3 [2018-11-28 23:19:06,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 23:19:06,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:06,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:06,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:06,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-11-28 23:19:06,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:06,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:06,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:06,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2018-11-28 23:19:06,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:06,810 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2018-11-28 23:19:07,634 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-28 23:19:07,756 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-28 23:19:07,772 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:07,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:07,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:07,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:07,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:07,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:07,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:07,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:07,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 23:19:07,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:07,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:07,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,344 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-11-28 23:19:08,494 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-11-28 23:19:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:09,255 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:09,258 INFO L122 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 [2018-11-28 23:19:09,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:09,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:09,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:09,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,267 INFO L122 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 [2018-11-28 23:19:09,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:09,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:09,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:09,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,270 INFO L122 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 [2018-11-28 23:19:09,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:09,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:09,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:09,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,273 INFO L122 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 [2018-11-28 23:19:09,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,283 INFO L122 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 [2018-11-28 23:19:09,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:09,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:09,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:09,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,286 INFO L122 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 [2018-11-28 23:19:09,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,294 INFO L122 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 [2018-11-28 23:19:09,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,304 INFO L122 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 [2018-11-28 23:19:09,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,324 INFO L122 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 [2018-11-28 23:19:09,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,345 INFO L122 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 [2018-11-28 23:19:09,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,346 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:09,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,353 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:09,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,365 INFO L122 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 [2018-11-28 23:19:09,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,401 INFO L122 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 [2018-11-28 23:19:09,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,402 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:09,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,407 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:09,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,428 INFO L122 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 [2018-11-28 23:19:09,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:09,484 INFO L122 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 [2018-11-28 23:19:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:09,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:09,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:09,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:09,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:09,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:09,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:09,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:09,531 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:09,534 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:09,537 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:09,539 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:09,539 INFO L520 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 23:19:10,028 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 23:19:10,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:10,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:10,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:10,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:10,238 INFO L478 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 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-28 23:19:10,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 26 [2018-11-28 23:19:10,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-28 23:19:10,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:10,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:10,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:10,411 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-11-28 23:19:10,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,454 INFO L478 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 34 treesize of output 37 [2018-11-28 23:19:10,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:10,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,587 INFO L478 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 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-28 23:19:10,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-28 23:19:10,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:10,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 36 treesize of output 26 [2018-11-28 23:19:10,662 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:10,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:10,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-11-28 23:19:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:10,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:19:10,804 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-28 23:19:11,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2018-11-28 23:19:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 23:19:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 23:19:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 23:19:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 23:19:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-28 23:19:11,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:11,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-11-28 23:19:11,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:19:11,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:19:11,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-28 23:19:11,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:11,072 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 23:19:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-28 23:19:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:19:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:19:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 23:19:11,076 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:19:11,076 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:19:11,076 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:11,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 23:19:11,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:11,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:11,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:11,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:11,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:19:11,079 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 239#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 240#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 248#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 258#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 249#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 250#L557-3 [2018-11-28 23:19:11,082 INFO L796 eck$LassoCheckResult]: Loop: 250#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 253#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 256#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 241#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 242#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 246#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 250#L557-3 [2018-11-28 23:19:11,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-28 23:19:11,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2018-11-28 23:19:11,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2018-11-28 23:19:11,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,527 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 23:19:12,031 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-28 23:19:12,186 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-28 23:19:12,189 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:12,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:12,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:12,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:12,190 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:12,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:12,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:12,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:12,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-28 23:19:12,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:12,191 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:12,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,586 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-28 23:19:12,705 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 23:19:12,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:13,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:13,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:13,467 INFO L122 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 [2018-11-28 23:19:13,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:13,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:13,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:13,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,473 INFO L122 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 [2018-11-28 23:19:13,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,480 INFO L122 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 [2018-11-28 23:19:13,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:13,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:13,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:13,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,482 INFO L122 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 [2018-11-28 23:19:13,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:13,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:13,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:13,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,485 INFO L122 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 [2018-11-28 23:19:13,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:13,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:13,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:13,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,487 INFO L122 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 [2018-11-28 23:19:13,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,492 INFO L122 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 [2018-11-28 23:19:13,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,527 INFO L122 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 [2018-11-28 23:19:13,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,541 INFO L122 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 [2018-11-28 23:19:13,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:13,557 INFO L122 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 [2018-11-28 23:19:13,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:13,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:13,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:13,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:13,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:13,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:13,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:13,649 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:19:13,649 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:19:13,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:13,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:13,651 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:13,651 INFO L520 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 [] [2018-11-28 23:19:13,850 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 23:19:13,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:13,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:13,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:13,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:14,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,112 INFO L478 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 3 case distinctions, treesize of input 38 treesize of output 54 [2018-11-28 23:19:14,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 36 [2018-11-28 23:19:14,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-28 23:19:14,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:14,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:14,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-11-28 23:19:14,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,837 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-28 23:19:14,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 33 [2018-11-28 23:19:14,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,899 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-11-28 23:19:14,903 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:19:14,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:14,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2018-11-28 23:19:14,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:14,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:14,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-11-28 23:19:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:15,006 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 [2018-11-28 23:19:15,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 23:19:15,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 51 states and 58 transitions. Complement of second has 17 states. [2018-11-28 23:19:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:19:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-28 23:19:15,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-28 23:19:15,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:15,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-28 23:19:15,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:15,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-28 23:19:15,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:15,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2018-11-28 23:19:15,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:19:15,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 43 states and 50 transitions. [2018-11-28 23:19:15,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:19:15,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:19:15,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-28 23:19:15,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:15,257 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-28 23:19:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-28 23:19:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-11-28 23:19:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:19:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-28 23:19:15,261 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 23:19:15,261 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 23:19:15,261 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:15,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-28 23:19:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:19:15,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:15,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:15,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:19:15,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:15,263 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 486#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 487#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 494#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 500#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 518#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 516#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-11-28 23:19:15,263 INFO L796 eck$LassoCheckResult]: Loop: 496#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 497#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-11-28 23:19:15,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 2 times [2018-11-28 23:19:15,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:15,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:15,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:15,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2018-11-28 23:19:15,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:15,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 3 times [2018-11-28 23:19:15,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:15,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:15,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:15,602 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:19:15,879 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:19:16,554 WARN L180 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-11-28 23:19:16,709 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-28 23:19:16,714 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:16,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:16,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:16,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:16,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:16,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:16,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:16,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:16,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 23:19:16,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:16,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:16,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,082 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-28 23:19:17,198 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-28 23:19:17,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,537 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-28 23:19:17,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:17,874 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:17,874 INFO L122 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 [2018-11-28 23:19:17,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:17,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:17,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:17,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,881 INFO L122 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 [2018-11-28 23:19:17,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,889 INFO L122 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 [2018-11-28 23:19:17,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,897 INFO L122 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 [2018-11-28 23:19:17,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:17,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:17,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:17,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,902 INFO L122 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 [2018-11-28 23:19:17,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:17,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:17,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:17,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,911 INFO L122 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 [2018-11-28 23:19:17,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,918 INFO L122 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 [2018-11-28 23:19:17,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,924 INFO L122 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 [2018-11-28 23:19:17,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:17,995 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:19:17,995 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:17,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:17,997 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 23:19:17,997 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:17,997 INFO L520 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)_3, ULTIMATE.start_test_fun_#t~mem7) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0] [2018-11-28 23:19:18,652 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-11-28 23:19:18,720 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:18,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:18,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:18,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:18,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:18,872 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:18,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:18,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:18,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:18,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:18,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:18,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:18,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:18,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:18,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 23:19:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:19,003 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:19,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:19:19,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 48 states and 56 transitions. Complement of second has 5 states. [2018-11-28 23:19:19,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:19:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:19:19,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:19,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:19:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:19,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-28 23:19:19,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:19:19,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 48 transitions. [2018-11-28 23:19:19,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:19:19,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:19:19,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-11-28 23:19:19,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:19,055 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-28 23:19:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-11-28 23:19:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-28 23:19:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:19:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-28 23:19:19,061 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-28 23:19:19,061 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-28 23:19:19,061 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:19:19,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-28 23:19:19,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:19:19,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:19,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:19,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:19:19,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:19:19,066 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 727#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 735#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 751#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 749#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 746#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 745#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 744#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 743#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 742#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 740#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 739#L557-3 [2018-11-28 23:19:19,066 INFO L796 eck$LassoCheckResult]: Loop: 739#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 738#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 737#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 736#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 722#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 723#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 741#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 739#L557-3 [2018-11-28 23:19:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 3 times [2018-11-28 23:19:19,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:19,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:19,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:19,412 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 23:19:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:19,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:19:19,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:19:19,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:19:19,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:19:19,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:19:19,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:19,591 INFO L478 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 11 treesize of output 8 [2018-11-28 23:19:19,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 23:19:19,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 23:19:19,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,690 INFO L478 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 25 treesize of output 28 [2018-11-28 23:19:19,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:19,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-28 23:19:19,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,935 INFO L478 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 3 case distinctions, treesize of input 36 treesize of output 52 [2018-11-28 23:19:19,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 34 [2018-11-28 23:19:19,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 47 [2018-11-28 23:19:19,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:20,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:20,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:20,072 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-11-28 23:19:20,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:19:20,122 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 23:19:20,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:20,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:20,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:20,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-11-28 23:19:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:20,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:19:20,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-28 23:19:20,200 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:19:20,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2018-11-28 23:19:20,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:19:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:19:20,367 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 23:19:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:20,625 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-28 23:19:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:19:20,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2018-11-28 23:19:20,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:20,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 22 states and 24 transitions. [2018-11-28 23:19:20,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:19:20,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:20,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-28 23:19:20,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:20,629 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-28 23:19:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-28 23:19:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-11-28 23:19:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:19:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 23:19:20,632 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:19:20,632 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 23:19:20,632 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:19:20,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 23:19:20,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:20,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:20,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:20,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:19:20,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:20,634 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 850#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 854#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 860#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 865#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 859#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 862#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 864#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 863#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 851#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 852#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 855#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 861#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-11-28 23:19:20,634 INFO L796 eck$LassoCheckResult]: Loop: 856#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 857#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-11-28 23:19:20,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 4 times [2018-11-28 23:19:20,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2018-11-28 23:19:20,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 5 times [2018-11-28 23:19:20,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,880 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:19:22,394 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2018-11-28 23:19:22,621 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-28 23:19:22,624 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:22,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:22,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:22,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:22,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:22,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:22,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:22,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:22,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-28 23:19:22,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:22,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:22,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,020 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-11-28 23:19:23,126 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-28 23:19:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,551 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 23:19:24,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:24,084 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:24,085 INFO L122 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 [2018-11-28 23:19:24,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,095 INFO L122 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 [2018-11-28 23:19:24,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,096 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:24,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:24,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,105 INFO L122 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 [2018-11-28 23:19:24,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:24,135 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:19:24,135 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:19:24,136 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:24,138 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:19:24,138 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:24,138 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7) = -1*ULTIMATE.start_test_fun_#t~mem6 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 1 >= 0] [2018-11-28 23:19:24,485 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:19:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:24,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:24,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 23:19:24,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 23:19:24,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 23:19:24,647 INFO L478 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 11 treesize of output 8 [2018-11-28 23:19:24,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 23:19:24,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 23:19:24,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:24,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:24,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:24,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:24,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:24,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:24,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,942 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-28 23:19:24,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 23 [2018-11-28 23:19:24,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:24,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 23:19:24,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:24,992 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-11-28 23:19:24,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 15 [2018-11-28 23:19:24,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 23:19:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,062 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:25,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:25,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:25,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:25,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 23:19:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 23:19:25,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 23:19:25,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:19:25,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 23:19:25,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 23:19:25,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,201 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:25,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 23:19:25,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 23:19:25,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 23:19:25,366 INFO L478 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 11 treesize of output 8 [2018-11-28 23:19:25,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 23:19:25,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 23:19:25,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:25,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:25,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:25,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:25,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:25,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:25,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,563 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-28 23:19:25,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 23 [2018-11-28 23:19:25,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 23:19:25,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,619 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-11-28 23:19:25,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 15 [2018-11-28 23:19:25,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 23:19:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,842 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:25,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 35 treesize of output 43 [2018-11-28 23:19:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:25,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 25 [2018-11-28 23:19:25,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 23:19:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 23:19:25,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 23:19:25,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:19:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-11-28 23:19:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 23:19:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,975 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:25,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:26,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:26,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 23:19:26,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 23:19:26,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 23:19:26,111 INFO L478 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 11 treesize of output 8 [2018-11-28 23:19:26,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-28 23:19:26,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 23:19:26,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:26,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:26,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:26,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 23:19:26,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 28 treesize of output 7 [2018-11-28 23:19:26,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-11-28 23:19:26,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,307 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-28 23:19:26,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 23 [2018-11-28 23:19:26,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 23:19:26,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,359 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-11-28 23:19:26,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 15 [2018-11-28 23:19:26,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-11-28 23:19:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:26,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:26,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,458 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:26,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:26,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:26,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:26,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:26,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:26,526 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-28 23:19:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:26,543 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-11-28 23:19:26,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-28 23:19:26,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 49 states and 57 transitions. Complement of second has 22 states. [2018-11-28 23:19:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 23:19:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-11-28 23:19:26,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-28 23:19:26,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:26,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:26,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:26,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 23:19:26,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:26,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-11-28 23:19:26,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:26,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 41 transitions. [2018-11-28 23:19:26,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:26,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:19:26,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-11-28 23:19:26,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:26,749 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 23:19:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-11-28 23:19:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2018-11-28 23:19:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:19:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 23:19:26,754 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:19:26,754 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:19:26,754 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:19:26,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-28 23:19:26,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:26,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:26,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:26,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 1, 1, 1, 1] [2018-11-28 23:19:26,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:26,758 INFO L794 eck$LassoCheckResult]: Stem: 1292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1288#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, 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_~c~0.base, test_fun_~c~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.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1289#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1293#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1302#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1295#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1296#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1304#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1305#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1310#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1300#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1301#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1290#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1291#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1294#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1303#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-11-28 23:19:26,758 INFO L796 eck$LassoCheckResult]: Loop: 1299#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1298#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-11-28 23:19:26,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash 883958124, now seen corresponding path program 6 times [2018-11-28 23:19:26,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:26,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:26,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 3 times [2018-11-28 23:19:26,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:26,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash -919766745, now seen corresponding path program 7 times [2018-11-28 23:19:26,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:26,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:26,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:29,220 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-11-28 23:19:29,440 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-28 23:19:29,444 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:29,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:29,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:29,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:29,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:29,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:29,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:29,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:29,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-28 23:19:29,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:29,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:29,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,778 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-11-28 23:19:29,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:29,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:30,406 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:30,406 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:30,407 INFO L122 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 [2018-11-28 23:19:30,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:30,417 INFO L122 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 [2018-11-28 23:19:30,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:30,421 INFO L122 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 [2018-11-28 23:19:30,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:30,425 INFO L122 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 [2018-11-28 23:19:30,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:30,443 INFO L122 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 [2018-11-28 23:19:30,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:30,453 INFO L122 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 [2018-11-28 23:19:30,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:30,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:30,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:30,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:30,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:30,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:30,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:30,486 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:19:30,486 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:30,487 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:30,488 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 23:19:30,488 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:30,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem7, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = 1*ULTIMATE.start_test_fun_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0] [2018-11-28 23:19:30,715 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2018-11-28 23:19:30,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:30,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:30,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:30,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:30,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:30,812 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:30,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:30,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:30,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:30,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:30,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:30,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:30,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:30,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:30,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 23:19:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:31,004 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:31,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:19:31,043 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-11-28 23:19:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:19:31,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:31,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:31,046 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:31,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:31,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:31,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:31,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,179 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:31,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:31,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:31,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:31,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:31,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:31,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:31,281 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 23:19:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:31,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:31,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:19:31,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-11-28 23:19:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:19:31,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:31,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:31,337 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:31,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:31,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:31,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:31,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,439 INFO L478 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 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:19:31,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 29 [2018-11-28 23:19:31,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:31,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:31,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 43 [2018-11-28 23:19:31,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 23:19:31,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:31,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:31,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-11-28 23:19:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:31,582 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 2 loop predicates [2018-11-28 23:19:31,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:19:31,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 39 states and 47 transitions. Complement of second has 4 states. [2018-11-28 23:19:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 23:19:31,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:31,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:31,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-28 23:19:31,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:31,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 23:19:31,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:31,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-28 23:19:31,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:31,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-28 23:19:31,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:31,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:31,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:31,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:31,632 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:31,632 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:31,632 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:31,632 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:19:31,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:31,632 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:31,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:31,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:31 BoogieIcfgContainer [2018-11-28 23:19:31,640 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:31,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:31,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:31,640 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:31,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04" (3/4) ... [2018-11-28 23:19:31,645 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:31,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:31,646 INFO L168 Benchmark]: Toolchain (without parser) took 27993.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.5 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -404.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:31,647 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:31,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:31,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:31,648 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:31,648 INFO L168 Benchmark]: RCFGBuilder took 439.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:31,649 INFO L168 Benchmark]: BuchiAutomizer took 26787.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -257.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:31,649 INFO L168 Benchmark]: Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:31,651 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 439.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26787.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -257.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + aux-x_ref-aux and consists of 3 locations. One nondeterministic module has affine ranking function -1 * aux-y_ref-aux + aux-x_ref-aux and consists of 12 locations. One nondeterministic module has affine ranking function aux-x_ref-aux + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.7s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 20.2s. Construction of modules took 0.5s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/4 HoareTripleCheckerStatistics: 57 SDtfs, 70 SDslu, 27 SDs, 0 SdLazy, 337 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital729 mio100 ax103 hnf100 lsp95 ukn33 mio100 lsp36 div100 bol100 ite100 ukn100 eq181 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...