./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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.03-no-inv_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 e1996219c6dbc0f4aa6a0486eb748fdb92fa73f6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:47:34,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:34,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:34,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:34,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:34,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:34,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:34,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:34,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:34,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:34,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:34,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:34,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:34,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:34,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:34,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:34,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:34,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:34,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:34,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:34,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:34,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:34,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:34,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:34,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:34,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:34,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:34,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:34,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:34,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:34,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:34,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:34,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:34,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:34,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:34,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:34,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:47:34,224 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:34,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:34,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:34,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:34,226 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:34,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:34,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:34,227 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:34,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:34,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:34,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:34,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:34,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:34,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:34,229 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:34,229 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:34,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:34,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:34,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:34,229 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:34,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:34,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:34,230 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:34,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:34,232 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 -> e1996219c6dbc0f4aa6a0486eb748fdb92fa73f6 [2019-01-01 21:47:34,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:34,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:34,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:34,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:34,307 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:34,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:34,393 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2111061/8f03c54e099648d9b882a059867d8dd3/FLAG61cab3d60 [2019-01-01 21:47:34,984 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:34,985 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:35,011 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2111061/8f03c54e099648d9b882a059867d8dd3/FLAG61cab3d60 [2019-01-01 21:47:35,257 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2111061/8f03c54e099648d9b882a059867d8dd3 [2019-01-01 21:47:35,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:35,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:35,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:35,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:35,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:35,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:35" (1/1) ... [2019-01-01 21:47:35,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502bbd48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:35, skipping insertion in model container [2019-01-01 21:47:35,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:35" (1/1) ... [2019-01-01 21:47:35,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:35,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:35,796 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:35,809 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:35,888 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:36,036 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:36,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36 WrapperNode [2019-01-01 21:47:36,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:36,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:36,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:36,038 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:36,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:36,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:36,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:36,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:36,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (1/1) ... [2019-01-01 21:47:36,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:36,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:36,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:36,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:36,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (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 [2019-01-01 21:47:36,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:36,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:36,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:36,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:36,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:36,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:36,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:36,614 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:47:36,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:36 BoogieIcfgContainer [2019-01-01 21:47:36,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:36,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:36,617 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:36,621 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:36,622 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:36,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:35" (1/3) ... [2019-01-01 21:47:36,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49659b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:36, skipping insertion in model container [2019-01-01 21:47:36,625 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:36,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:36" (2/3) ... [2019-01-01 21:47:36,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49659b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:36, skipping insertion in model container [2019-01-01 21:47:36,626 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:36,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:36" (3/3) ... [2019-01-01 21:47:36,628 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:36,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:36,695 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:36,695 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:36,695 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:36,696 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:36,696 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:36,696 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:36,696 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:36,696 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:36,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:47:36,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:36,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:36,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:36,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:36,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:36,764 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:36,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:47:36,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:36,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:36,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:36,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:36,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:36,779 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 8#L556-5true [2019-01-01 21:47:36,779 INFO L796 eck$LassoCheckResult]: Loop: 8#L556-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 11#L556-1true assume !test_fun_#t~short10; 5#L556-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 + test_fun_#t~mem12, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 8#L556-5true [2019-01-01 21:47:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:47:36,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:36,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-01-01 21:47:36,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:36,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:36,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:36,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:37,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:37,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:47:37,072 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:47:37,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:47:37,092 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-01 21:47:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:37,161 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 21:47:37,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:47:37,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:47:37,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:37,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-01-01 21:47:37,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:47:37,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:47:37,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-01 21:47:37,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:37,172 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:47:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-01 21:47:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:47:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:47:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-01 21:47:37,206 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:47:37,206 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:47:37,206 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:37,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-01 21:47:37,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:37,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:37,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:37,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:37,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:37,208 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 33#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 34#L556-5 [2019-01-01 21:47:37,208 INFO L796 eck$LassoCheckResult]: Loop: 34#L556-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 37#L556-1 assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 35#L556-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 + test_fun_#t~mem12, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 34#L556-5 [2019-01-01 21:47:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:47:37,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-01-01 21:47:37,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:37,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-01-01 21:47:37,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:37,999 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-01 21:47:38,133 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:47:38,849 WARN L181 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-01 21:47:39,220 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:47:39,234 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:39,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:39,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:39,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:39,235 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:39,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:39,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:39,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:39,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03-no-inv_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-01 21:47:39,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:39,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:39,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,724 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-01-01 21:47:39,886 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-01 21:47:39,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:39,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:40,546 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:47:40,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:40,639 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:40,641 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 [2019-01-01 21:47:40,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,650 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 [2019-01-01 21:47:40,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,653 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 [2019-01-01 21:47:40,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,656 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 [2019-01-01 21:47:40,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,658 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 [2019-01-01 21:47:40,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,661 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 [2019-01-01 21:47:40,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,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 [2019-01-01 21:47:40,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,667 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 [2019-01-01 21:47:40,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,669 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 [2019-01-01 21:47:40,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,673 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 [2019-01-01 21:47:40,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:40,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:40,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,689 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 [2019-01-01 21:47:40,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,697 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 [2019-01-01 21:47:40,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:40,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:40,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,708 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 [2019-01-01 21:47:40,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:40,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:40,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,717 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 [2019-01-01 21:47:40,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,722 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 [2019-01-01 21:47:40,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:40,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:40,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:40,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,727 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 [2019-01-01 21:47:40,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:40,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:40,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:40,736 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 [2019-01-01 21:47:40,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:40,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:40,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:40,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:40,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:40,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:40,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:40,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:40,815 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:47:40,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:40,826 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:47:40,827 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:40,827 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483647 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1 >= 0] [2019-01-01 21:47:40,890 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-01-01 21:47:40,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:40,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:41,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:41,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:47:41,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-01 21:47:41,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-01-01 21:47:41,296 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 [2019-01-01 21:47:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:47:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-01 21:47:41,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:47:41,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:41,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:47:41,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:41,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:47:41,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:41,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:47:41,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:41,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:47:41,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:41,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:41,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:41,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:41,302 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:41,302 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:41,302 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:41,302 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:41,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:41,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:41,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:41,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:41 BoogieIcfgContainer [2019-01-01 21:47:41,310 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:41,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:41,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:41,311 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:41,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:36" (3/4) ... [2019-01-01 21:47:41,315 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:41,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:41,316 INFO L168 Benchmark]: Toolchain (without parser) took 6053.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 794.3 MB in the end (delta: 157.1 MB). Peak memory consumption was 270.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:41,318 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:41,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:41,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:41,320 INFO L168 Benchmark]: Boogie Preprocessor took 33.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:41,321 INFO L168 Benchmark]: RCFGBuilder took 487.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:41,321 INFO L168 Benchmark]: BuchiAutomizer took 4693.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 794.3 MB in the end (delta: 287.6 MB). Peak memory consumption was 287.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:41,322 INFO L168 Benchmark]: Witness Printer took 4.92 ms. Allocated memory is still 1.1 GB. Free memory is still 794.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:41,331 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 772.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 487.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4693.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 794.3 MB in the end (delta: 287.6 MB). Peak memory consumption was 287.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.92 ms. Allocated memory is still 1.1 GB. Free memory is still 794.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital201 mio100 ax108 hnf100 lsp89 ukn70 mio100 lsp34 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf150 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...