./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-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/b.09_assume-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 25885afdfdd91cf9312b78ad87a032f4ef31fe0c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:45,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:45,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:45,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:45,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:45,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:45,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:45,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:45,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:45,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:45,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:45,954 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:45,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:45,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:45,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:45,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:45,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:45,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:45,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:45,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:45,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:45,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:45,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:45,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:45,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:45,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:45,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:45,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:45,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:45,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:45,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:45,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:45,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:45,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:45,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:45,993 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:46,027 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:46,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:46,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:46,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:46,030 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:46,030 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:46,030 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:46,030 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:46,031 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:46,031 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:46,031 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:46,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:46,031 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:46,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:46,032 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:46,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:46,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:46,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:46,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:46,033 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:46,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:46,034 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:46,034 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:46,035 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:46,035 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 -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-11-28 23:19:46,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:46,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:46,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:46,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:46,114 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:46,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:46,184 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6483a8c5/ae729dd36827406c8a2c115d699a075a/FLAG9b30abbbc [2018-11-28 23:19:46,728 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:46,729 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:46,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6483a8c5/ae729dd36827406c8a2c115d699a075a/FLAG9b30abbbc [2018-11-28 23:19:47,019 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6483a8c5/ae729dd36827406c8a2c115d699a075a [2018-11-28 23:19:47,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:47,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:47,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:47,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:47,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:47,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:47" (1/1) ... [2018-11-28 23:19:47,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e0c10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:47, skipping insertion in model container [2018-11-28 23:19:47,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:47" (1/1) ... [2018-11-28 23:19:47,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:47,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:47,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:47,552 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:47,619 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:47,760 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:47,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:47 WrapperNode [2018-11-28 23:19:47,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:47,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:47,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:47,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:47,772 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:47" (1/1) ... [2018-11-28 23:19:47,789 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:47" (1/1) ... [2018-11-28 23:19:47,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:47,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:47,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:47,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:47,826 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:47" (1/1) ... [2018-11-28 23:19:47,826 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:47" (1/1) ... [2018-11-28 23:19:47,830 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:47" (1/1) ... [2018-11-28 23:19:47,830 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:47" (1/1) ... [2018-11-28 23:19:47,836 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:47" (1/1) ... [2018-11-28 23:19:47,844 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:47" (1/1) ... [2018-11-28 23:19:47,846 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:47" (1/1) ... [2018-11-28 23:19:47,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:47,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:47,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:47,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:47,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:47" (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:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:48,367 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:48,367 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:19:48,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:48 BoogieIcfgContainer [2018-11-28 23:19:48,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:48,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:48,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:48,375 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:48,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:48,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:47" (1/3) ... [2018-11-28 23:19:48,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f934c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:48, skipping insertion in model container [2018-11-28 23:19:48,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:48,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:47" (2/3) ... [2018-11-28 23:19:48,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f934c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:48, skipping insertion in model container [2018-11-28 23:19:48,379 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:48,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:48" (3/3) ... [2018-11-28 23:19:48,382 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:48,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:48,443 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:48,443 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:48,443 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:48,444 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:48,444 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:48,444 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:48,444 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:48,444 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:48,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:19:48,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:48,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:48,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:48,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:48,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:48,493 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:48,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:19:48,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:48,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:48,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:48,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:48,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:48,506 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 7#L558-3true [2018-11-28 23:19:48,507 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2018-11-28 23:19:48,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-28 23:19:48,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:48,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:48,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:48,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2018-11-28 23:19:48,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:48,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:48,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:48,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:48,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2018-11-28 23:19:48,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:48,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:48,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:49,078 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 23:19:49,271 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:19:50,384 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-11-28 23:19:50,546 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 23:19:50,561 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:50,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:50,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:50,563 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:50,563 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:50,563 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:50,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:50,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:50,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 23:19:50,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:50,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:50,594 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:50,632 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:50,655 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:50,679 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:50,684 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:50,688 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:50,696 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:50,703 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:50,711 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:50,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:50,723 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:50,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:50,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:50,733 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:50,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:50,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:51,317 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-28 23:19:51,484 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-28 23:19:51,485 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:51,496 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:51,498 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:51,499 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:51,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:51,503 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:51,883 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:19:52,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:52,461 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:52,463 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:52,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,472 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:52,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,476 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:52,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,479 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:52,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,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:52,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,486 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:52,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,494 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:52,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,498 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:52,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,506 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:52,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,540 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:52,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,547 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:52,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,551 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:52,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,560 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:52,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,563 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:52,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,566 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:52,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:52,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:52,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:52,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,568 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:52,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,569 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:52,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,572 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:52,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,585 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:52,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,625 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:52,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,626 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:52,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,631 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:52,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,655 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:52,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:52,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:52,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:52,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:52,664 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:52,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:52,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:52,668 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:19:52,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:52,686 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:19:52,687 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:19:52,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:52,951 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:19:52,953 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 23:19:52,956 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:52,959 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:19:52,960 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:52,962 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-28 23:19:53,587 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:19:53,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:53,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:53,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:53,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:53,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-28 23:19:53,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:53,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:53,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-11-28 23:19:53,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:53,846 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2018-11-28 23:19:53,852 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:53,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:53,900 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-28 23:19:54,050 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:19:54,054 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 31 treesize of output 30 [2018-11-28 23:19:54,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:54,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 23:19:54,123 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:54,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 21 [2018-11-28 23:19:54,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 23:19:54,237 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:54,248 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:54,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 23 [2018-11-28 23:19:54,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 23:19:54,275 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:54,302 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:54,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-28 23:19:54,399 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 24 treesize of output 17 [2018-11-28 23:19:54,400 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:54,433 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 17 treesize of output 12 [2018-11-28 23:19:54,433 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:54,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:19:54,478 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:54,513 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:54,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:54,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:54,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:54,698 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-11-28 23:19:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:54,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:54,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:54,981 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-11-28 23:19:55,003 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 49 treesize of output 42 [2018-11-28 23:19:55,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:55,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:55,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:55,075 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 32 treesize of output 45 [2018-11-28 23:19:55,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:55,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:55,118 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2018-11-28 23:19:55,150 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:55,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 23:19:55,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-28 23:19:55,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2018-11-28 23:19:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-28 23:19:55,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:19:55,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:19:55,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 23:19:55,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-11-28 23:19:55,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:55,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2018-11-28 23:19:55,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:55,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:19:55,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-28 23:19:55,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:55,336 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-28 23:19:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-28 23:19:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-28 23:19:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:19:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 23:19:55,363 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:19:55,363 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:19:55,363 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:55,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 23:19:55,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:55,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:55,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:55,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:55,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:55,365 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-28 23:19:55,365 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-28 23:19:55,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2018-11-28 23:19:55,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2018-11-28 23:19:55,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2018-11-28 23:19:55,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,712 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:19:56,092 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2018-11-28 23:19:56,206 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 23:19:56,210 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:56,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:56,210 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:56,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:56,211 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:56,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:56,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:56,211 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:56,211 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 23:19:56,211 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:56,211 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:56,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:56,224 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:56,225 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:56,227 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:56,229 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:56,231 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:56,812 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-28 23:19:56,973 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-28 23:19:56,974 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:56,977 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:56,978 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:56,981 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:56,984 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:56,987 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:57,028 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:57,030 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:57,031 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:57,033 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:57,036 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:57,040 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:57,045 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:57,048 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:57,050 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:57,414 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 23:19:57,941 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:19:57,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:57,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:57,999 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:58,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:58,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:58,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:58,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,003 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:58,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:58,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:58,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:58,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,005 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:58,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,009 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:58,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,017 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:58,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:58,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:58,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:58,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,019 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:58,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,025 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:58,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:58,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,035 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:58,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:58,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:58,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,046 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:58,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,060 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:58,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,062 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:58,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,064 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:58,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,071 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:58,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,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:58,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,096 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:58,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:58,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:58,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:58,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:58,109 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:58,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:58,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:58,112 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:19:58,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:58,126 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:19:58,129 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:19:58,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:58,224 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:19:58,225 INFO L444 ModelExtractionUtils]: 43 out of 51 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:19:58,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:58,228 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:19:58,228 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:58,228 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:58,742 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:19:58,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:58,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:58,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:58,816 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-11-28 23:19:58,820 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:58,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:58,854 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-28 23:19:58,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 23:19:58,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:59,006 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 31 treesize of output 30 [2018-11-28 23:19:59,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 23:19:59,065 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:59,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,073 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 5 treesize of output 1 [2018-11-28 23:19:59,073 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-28 23:19:59,139 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 19 treesize of output 12 [2018-11-28 23:19:59,139 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:19:59,166 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 23:19:59,186 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:59,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 21 [2018-11-28 23:19:59,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 23:19:59,253 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,259 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:59,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:19:59,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:59,371 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2018-11-28 23:19:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:59,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:59,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:59,542 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 32 treesize of output 33 [2018-11-28 23:19:59,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:59,548 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 33 treesize of output 22 [2018-11-28 23:19:59,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:19:59,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:59,636 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 34 treesize of output 43 [2018-11-28 23:19:59,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:59,646 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 23 treesize of output 16 [2018-11-28 23:19:59,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:59,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 23:19:59,666 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:59,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 23:19:59,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 23:19:59,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-11-28 23:19:59,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 23:19:59,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 23:19:59,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:59,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 23:19:59,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:59,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:19:59,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:59,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 23:19:59,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:59,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2018-11-28 23:19:59,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:59,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:19:59,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-28 23:19:59,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:59,765 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 23:19:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-28 23:19:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 23:19:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:19:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-28 23:19:59,770 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 23:19:59,770 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 23:19:59,770 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:59,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-28 23:19:59,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:59,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:59,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:59,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:59,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:59,774 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-28 23:19:59,774 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-28 23:19:59,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2018-11-28 23:19:59,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2018-11-28 23:19:59,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:59,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:59,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:59,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2018-11-28 23:19:59,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,011 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-28 23:20:00,671 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2018-11-28 23:20:00,963 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-28 23:20:00,967 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:00,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:00,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:00,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:00,967 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:00,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:00,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:00,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:00,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 23:20:00,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:00,968 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:00,972 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:20:00,979 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:20:00,981 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:20:00,983 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:20:00,985 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:20:00,987 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:20:00,989 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:20:00,992 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:20:00,994 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:20:00,998 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:20:00,999 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:20:01,001 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:20:01,003 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:20:01,006 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:20:01,383 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-28 23:20:01,534 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-28 23:20:01,535 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:20:01,538 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:20:01,540 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:20:01,543 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:20:01,546 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:20:01,548 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:20:01,550 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:20:01,557 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:20:01,875 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-28 23:20:02,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:02,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:02,225 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:20:02,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,231 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:20:02,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,237 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:20:02,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,246 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:20:02,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,251 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:20:02,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,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:20:02,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,263 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:20:02,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,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:20:02,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,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:20:02,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,278 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:20:02,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,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:20:02,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,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:20:02,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,290 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:20:02,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,296 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:20:02,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,309 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:20:02,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,319 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:20:02,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,333 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:20:02,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,334 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:02,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,336 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:02,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,343 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:20:02,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,349 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:20:02,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,362 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:20:02,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,384 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:02,411 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:02,414 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:20:02,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:02,415 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:02,415 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:02,415 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-28 23:20:02,554 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:20:02,555 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:02,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:02,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:02,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 23:20:02,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:02,639 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-28 23:20:02,643 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:20:02,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:02,715 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-28 23:20:02,727 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 31 treesize of output 30 [2018-11-28 23:20:02,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:02,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 23:20:02,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:02,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-11-28 23:20:02,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-28 23:20:02,914 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-28 23:20:03,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2018-11-28 23:20:03,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:03,237 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 26 treesize of output 25 [2018-11-28 23:20:03,237 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:03,353 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:20:03,536 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 25 treesize of output 37 [2018-11-28 23:20:03,541 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 26 treesize of output 25 [2018-11-28 23:20:03,542 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:03,577 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:20:03,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 20 [2018-11-28 23:20:03,579 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:03,600 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:03,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2018-11-28 23:20:03,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 25 [2018-11-28 23:20:03,778 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:03,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-28 23:20:03,891 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-11-28 23:20:03,991 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 23 treesize of output 22 [2018-11-28 23:20:03,991 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-28 23:20:04,078 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:04,137 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:20:04,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 23:20:04,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:20:04,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:20:04,323 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:74, output treesize:85 [2018-11-28 23:20:04,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-11-28 23:20:04,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:04,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:04,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 22 [2018-11-28 23:20:04,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,716 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 29 treesize of output 22 [2018-11-28 23:20:04,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-28 23:20:04,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:05,093 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 23:20:05,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 18 [2018-11-28 23:20:05,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 23:20:05,281 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,406 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-28 23:20:05,406 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 19 [2018-11-28 23:20:05,469 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,512 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-28 23:20:05,513 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 23:20:05,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:20:05,593 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2018-11-28 23:20:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:05,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:05,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,716 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 32 treesize of output 33 [2018-11-28 23:20:05,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,757 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 33 treesize of output 22 [2018-11-28 23:20:05,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-28 23:20:05,839 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:20:05,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-11-28 23:20:05,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-28 23:20:06,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2018-11-28 23:20:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:20:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-28 23:20:06,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:20:06,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-28 23:20:06,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-28 23:20:06,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2018-11-28 23:20:06,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:06,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2018-11-28 23:20:06,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:20:06,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:20:06,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-11-28 23:20:06,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:06,120 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 23:20:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-11-28 23:20:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-11-28 23:20:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:20:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-28 23:20:06,124 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 23:20:06,124 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-28 23:20:06,124 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:06,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-28 23:20:06,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:06,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:06,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:06,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:20:06,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:06,128 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-28 23:20:06,128 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-28 23:20:06,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2018-11-28 23:20:06,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,752 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-28 23:20:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:06,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:06,915 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:20:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:20:06,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 23:20:06,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:06,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,059 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:20:07,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,088 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:20:07,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,121 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-28 23:20:07,147 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:20:07,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,255 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-28 23:20:07,260 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 31 treesize of output 30 [2018-11-28 23:20:07,260 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 25 [2018-11-28 23:20:07,315 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 45 [2018-11-28 23:20:07,388 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 34 treesize of output 33 [2018-11-28 23:20:07,388 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:07,468 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 22 treesize of output 23 [2018-11-28 23:20:07,476 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:20:07,476 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,483 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2018-11-28 23:20:07,562 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 31 treesize of output 30 [2018-11-28 23:20:07,562 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 21 [2018-11-28 23:20:07,596 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,612 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:07,645 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:20:07,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:20:07,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 23:20:07,706 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:88, output treesize:70 [2018-11-28 23:20:07,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 23:20:07,825 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 28 treesize of output 27 [2018-11-28 23:20:07,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-28 23:20:07,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-11-28 23:20:07,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,951 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 47 treesize of output 27 [2018-11-28 23:20:07,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:08,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:08,026 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 23:20:08,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:08,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:08,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:08,076 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:69 [2018-11-28 23:20:08,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-11-28 23:20:08,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 [2018-11-28 23:20:08,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:08,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 15 [2018-11-28 23:20:08,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:08,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 11 [2018-11-28 23:20:08,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:08,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:08,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:08,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2018-11-28 23:20:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:08,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 23:20:08,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:08,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2018-11-28 23:20:08,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:08,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:08,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:08,599 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-28 23:20:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:20:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:20:08,640 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-28 23:20:08,984 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-28 23:20:09,328 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-28 23:20:09,485 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-28 23:20:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:09,567 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 23:20:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:20:09,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-11-28 23:20:09,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:09,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2018-11-28 23:20:09,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:20:09,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:20:09,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-28 23:20:09,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:09,575 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 23:20:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-28 23:20:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-28 23:20:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:20:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 23:20:09,577 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:20:09,577 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 23:20:09,577 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:20:09,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 23:20:09,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:09,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:09,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:09,579 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:09,579 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:09,579 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;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~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, 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);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 819#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 820#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6; 821#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 825#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 826#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 833#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 829#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 830#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 823#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 824#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 827#L559-2 [2018-11-28 23:20:09,579 INFO L796 eck$LassoCheckResult]: Loop: 827#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 828#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 835#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 834#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 832#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 827#L559-2 [2018-11-28 23:20:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2018-11-28 23:20:09,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:09,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:10,190 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-28 23:20:10,821 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2018-11-28 23:20:11,032 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-11-28 23:20:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:11,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:11,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:20:11,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:20:11,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:11,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:11,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,196 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:20:11,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,217 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:20:11,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 23:20:11,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-11-28 23:20:11,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,273 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:20:11,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-28 23:20:11,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-11-28 23:20:11,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,362 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 23 treesize of output 16 [2018-11-28 23:20:11,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-11-28 23:20:11,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 23:20:11,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:20:11,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 23:20:11,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,419 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-28 23:20:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:11,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-28 23:20:11,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:11,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2018-11-28 23:20:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:11,625 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-28 23:20:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:20:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:20:11,672 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-28 23:20:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:11,790 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-28 23:20:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:20:11,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-28 23:20:11,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:11,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-28 23:20:11,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:11,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:11,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:11,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:11,793 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:11,793 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:11,793 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:11,793 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:11,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:11,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:11,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:11,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:11 BoogieIcfgContainer [2018-11-28 23:20:11,801 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:11,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:11,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:11,802 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:11,802 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:48" (3/4) ... [2018-11-28 23:20:11,806 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:11,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:11,807 INFO L168 Benchmark]: Toolchain (without parser) took 24783.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 946.0 MB in the beginning and 943.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:11,808 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:11,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:11,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:11,809 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 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:20:11,809 INFO L168 Benchmark]: RCFGBuilder took 515.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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:11,809 INFO L168 Benchmark]: BuchiAutomizer took 23431.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 154.9 MB). Peak memory consumption was 390.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:11,810 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:11,813 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.88 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 515.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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23431.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 154.9 MB). Peak memory consumption was 390.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 943.1 MB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.8s. Construction of modules took 0.3s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 111 SDslu, 43 SDs, 0 SdLazy, 179 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital551 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 295ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...