./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/a.08-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 b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:21,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:21,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:21,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:21,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:21,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:21,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:21,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:21,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:21,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:21,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:21,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:21,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:21,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:21,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:21,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:21,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:21,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:21,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:21,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:21,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:21,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:21,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:21,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:21,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:21,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:21,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:21,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:21,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:21,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:21,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:21,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:21,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:21,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:21,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:21,558 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:21,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:21,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:21,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:21,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:21,598 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:21,598 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:21,598 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:21,598 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:21,599 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:21,600 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:21,600 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:21,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:21,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:21,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:21,604 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:21,604 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:21,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:21,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:21,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:21,605 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:21,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:21,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:21,606 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:21,606 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:21,607 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 -> b38ec4f461710d1db3d0a9a3fa7176d30b2ef06a [2018-11-28 23:19:21,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:21,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:21,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:21,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:21,674 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:21,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:21,738 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03dfb5e4/8b52c03b9a6941689f54c0c9f8ef73e0/FLAG5ef6de3ae [2018-11-28 23:19:22,248 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:22,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:22,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03dfb5e4/8b52c03b9a6941689f54c0c9f8ef73e0/FLAG5ef6de3ae [2018-11-28 23:19:22,530 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03dfb5e4/8b52c03b9a6941689f54c0c9f8ef73e0 [2018-11-28 23:19:22,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:22,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:22,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:22,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:22,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:22,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:22" (1/1) ... [2018-11-28 23:19:22,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718715e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:22, skipping insertion in model container [2018-11-28 23:19:22,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:22" (1/1) ... [2018-11-28 23:19:22,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:22,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:22,970 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:22,982 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:23,037 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:23,094 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:23,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:23 WrapperNode [2018-11-28 23:19:23,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:23,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:23,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:23,095 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:23,174 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:23" (1/1) ... [2018-11-28 23:19:23,192 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:23" (1/1) ... [2018-11-28 23:19:23,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:23,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:23,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:23,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:23,239 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:23" (1/1) ... [2018-11-28 23:19:23,239 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:23" (1/1) ... [2018-11-28 23:19:23,246 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:23" (1/1) ... [2018-11-28 23:19:23,247 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:23" (1/1) ... [2018-11-28 23:19:23,252 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:23" (1/1) ... [2018-11-28 23:19:23,256 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:23" (1/1) ... [2018-11-28 23:19:23,258 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:23" (1/1) ... [2018-11-28 23:19:23,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:23,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:23,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:23,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:23,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:23" (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:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:23,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:23,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:23,710 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:19:23,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:23 BoogieIcfgContainer [2018-11-28 23:19:23,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:23,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:23,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:23,716 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:23,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:23,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:22" (1/3) ... [2018-11-28 23:19:23,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f191034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:23, skipping insertion in model container [2018-11-28 23:19:23,719 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:23,719 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:23" (2/3) ... [2018-11-28 23:19:23,720 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f191034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:23, skipping insertion in model container [2018-11-28 23:19:23,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:23,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:23" (3/3) ... [2018-11-28 23:19:23,723 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.08-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:23,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:23,802 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:23,802 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:23,802 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:23,804 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:23,804 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:23,805 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:23,805 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:23,805 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:23,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:19:23,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:19:23,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:23,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:23,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:23,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:23,854 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:23,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:19:23,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:19:23,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:23,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:23,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:23,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:23,868 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem11, 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); 8#L555-5true [2018-11-28 23:19:23,868 INFO L796 eck$LassoCheckResult]: Loop: 8#L555-5true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 11#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647; 5#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 + test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 8#L555-5true [2018-11-28 23:19:23,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:23,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:23,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2018-11-28 23:19:24,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:24,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2018-11-28 23:19:24,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:24,913 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-28 23:19:25,636 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-11-28 23:19:26,037 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 23:19:26,066 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:26,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:26,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:26,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:26,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:26,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:26,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:26,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:26,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.08-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 23:19:26,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:26,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:26,106 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:26,132 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:26,137 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:26,141 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:26,145 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:26,148 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:26,155 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:26,159 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:26,165 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:26,178 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:26,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:26,185 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:26,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:26,627 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-11-28 23:19:26,777 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-28 23:19:26,778 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:26,780 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:26,801 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:27,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:27,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:27,558 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:27,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,567 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:27,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,570 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:27,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,573 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:27,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,577 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:27,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,580 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:27,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:27,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:27,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,588 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:27,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,591 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:27,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:27,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:27,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,599 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:27,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,603 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:27,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:27,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:27,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,609 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:27,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:27,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:27,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:27,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,612 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:27,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:27,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:27,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:27,618 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:27,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:27,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:27,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:27,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:27,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:27,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:27,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:27,702 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:27,702 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:19:27,704 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:27,706 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:27,706 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:27,707 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) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483646 Supporting invariants [] [2018-11-28 23:19:27,840 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 23:19:27,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:27,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:27,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:27,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:28,127 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-28 23:19:28,215 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:28,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:28,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-28 23:19:28,453 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 9 states. [2018-11-28 23:19:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 23:19:28,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 23:19:28,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:28,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:19:28,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:28,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:19:28,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:28,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2018-11-28 23:19:28,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:19:28,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 15 transitions. [2018-11-28 23:19:28,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:19:28,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:28,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-28 23:19:28,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:28,491 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-28 23:19:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-28 23:19:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-28 23:19:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 23:19:28,517 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:19:28,518 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:19:28,518 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:28,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 23:19:28,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:19:28,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:28,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:28,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:28,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:28,520 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;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~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem11, 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); 175#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 181#L555-1 [2018-11-28 23:19:28,520 INFO L796 eck$LassoCheckResult]: Loop: 181#L555-1 assume !test_fun_#t~short8; 177#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 + test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 178#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 181#L555-1 [2018-11-28 23:19:28,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:19:28,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:28,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:28,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:28,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2018-11-28 23:19:28,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:28,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:28,677 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:28,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:28,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:28,681 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:19:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:19:28,685 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:19:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:28,707 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 23:19:28,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:19:28,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:19:28,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:28,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-28 23:19:28,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:28,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:28,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:28,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:28,711 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:28,711 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:28,711 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:28,711 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:28,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:28,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:28,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:28,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:28 BoogieIcfgContainer [2018-11-28 23:19:28,718 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:28,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:28,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:28,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:28,719 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:23" (3/4) ... [2018-11-28 23:19:28,723 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:28,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:28,723 INFO L168 Benchmark]: Toolchain (without parser) took 6188.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 952.7 MB in the beginning and 800.1 MB in the end (delta: 152.6 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:28,725 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:28,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:28,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:28,727 INFO L168 Benchmark]: Boogie Preprocessor took 34.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:28,728 INFO L168 Benchmark]: RCFGBuilder took 449.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:28,729 INFO L168 Benchmark]: BuchiAutomizer took 5006.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 800.1 MB in the end (delta: 294.2 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:28,729 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.2 GB. Free memory is still 800.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:28,734 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.15 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 557.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.31 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 449.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5006.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 800.1 MB in the end (delta: 294.2 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.2 GB. Free memory is still 800.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 * 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 -1 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483646 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 10 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital285 mio100 ax106 hnf100 lsp92 ukn56 mio100 lsp36 div100 bol100 ite100 ukn100 eq198 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...