./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/sum05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/reducercommutativity/sum05_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 48db2505a59cdca75fbfbfb4403b26f347fcdcda ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:55:56,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:55:56,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:55:56,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:55:56,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:55:56,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:55:56,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:55:56,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:55:56,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:55:56,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:55:56,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:55:56,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:55:56,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:55:56,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:55:56,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:55:56,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:55:56,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:55:56,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:55:56,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:55:56,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:55:56,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:55:56,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:55:56,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:55:56,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:55:56,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:55:56,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:55:56,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:55:56,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:55:56,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:55:56,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:55:56,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:55:56,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:55:56,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:55:56,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:55:56,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:55:56,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:55:56,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:55:56,642 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:55:56,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:55:56,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:55:56,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:55:56,647 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:55:56,647 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:55:56,647 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:55:56,647 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:55:56,649 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:55:56,649 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:55:56,649 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:55:56,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:55:56,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:55:56,651 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:55:56,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:55:56,652 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:55:56,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:55:56,652 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:55:56,653 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:55:56,654 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:55:56,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:55:56,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:55:56,654 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:55:56,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:55:56,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:55:56,655 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:55:56,657 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:55:56,657 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48db2505a59cdca75fbfbfb4403b26f347fcdcda [2019-01-14 04:55:56,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:55:56,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:55:56,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:55:56,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:55:56,735 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:55:56,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2019-01-14 04:55:56,792 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4436f91/0e16119dd302484197c3118bf03f46f9/FLAG28e157026 [2019-01-14 04:55:57,169 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:55:57,169 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2019-01-14 04:55:57,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4436f91/0e16119dd302484197c3118bf03f46f9/FLAG28e157026 [2019-01-14 04:55:57,562 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4436f91/0e16119dd302484197c3118bf03f46f9 [2019-01-14 04:55:57,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:55:57,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:55:57,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:55:57,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:55:57,571 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:55:57,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd106d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57, skipping insertion in model container [2019-01-14 04:55:57,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:55:57,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:55:57,843 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:55:57,860 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:55:57,890 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:55:57,907 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:55:57,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57 WrapperNode [2019-01-14 04:55:57,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:55:57,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:55:57,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:55:57,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:55:57,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:55:57,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:55:57,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:55:57,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:55:57,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:57,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:58,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:58,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:58,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (1/1) ... [2019-01-14 04:55:58,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:55:58,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:55:58,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:55:58,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:55:58,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (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-14 04:55:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:55:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:55:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:55:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:55:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:55:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:55:58,658 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:55:58,658 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-14 04:55:58,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:55:58 BoogieIcfgContainer [2019-01-14 04:55:58,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:55:58,660 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:55:58,660 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:55:58,664 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:55:58,665 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:55:58,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:55:57" (1/3) ... [2019-01-14 04:55:58,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156e4662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:55:58, skipping insertion in model container [2019-01-14 04:55:58,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:55:58,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:55:57" (2/3) ... [2019-01-14 04:55:58,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@156e4662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:55:58, skipping insertion in model container [2019-01-14 04:55:58,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:55:58,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:55:58" (3/3) ... [2019-01-14 04:55:58,669 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2019-01-14 04:55:58,724 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:55:58,725 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:55:58,725 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:55:58,725 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:55:58,726 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:55:58,726 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:55:58,726 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:55:58,726 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:55:58,726 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:55:58,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 04:55:58,762 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 04:55:58,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:58,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:58,767 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:55:58,768 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:58,768 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:55:58,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 04:55:58,771 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 04:55:58,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:55:58,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:55:58,771 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 04:55:58,772 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:55:58,777 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2019-01-14 04:55:58,778 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2019-01-14 04:55:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 04:55:58,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:58,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 04:55:58,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:58,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:58,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:58,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:55:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 04:55:58,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:55:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:55:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:55:58,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:55:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:55:59,217 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:55:59,376 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 04:55:59,387 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:55:59,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:55:59,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:55:59,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:55:59,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:55:59,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:55:59,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:55:59,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:55:59,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 04:55:59,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:55:59,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:55:59,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-14 04:55:59,419 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-14 04:55:59,423 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-14 04:55:59,430 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-14 04:55:59,432 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-14 04:55:59,445 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-14 04:55:59,448 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-14 04:55:59,451 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-14 04:55:59,454 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-14 04:55:59,457 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-14 04:55:59,464 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-14 04:55:59,468 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-14 04:55:59,470 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-14 04:55:59,473 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-14 04:55:59,488 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-14 04:55:59,558 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-14 04:55:59,563 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-14 04:55:59,573 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-14 04:56:00,000 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:56:00,214 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:00,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:00,222 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-14 04:56:00,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,232 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-14 04:56:00,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,238 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-14 04:56:00,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,243 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-14 04:56:00,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,249 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-14 04:56:00,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:00,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,261 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-14 04:56:00,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,266 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-14 04:56:00,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,272 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-14 04:56:00,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,279 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-14 04:56:00,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,285 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-14 04:56:00,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:00,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:56:00,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,306 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-14 04:56:00,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,316 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-14 04:56:00,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,321 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-14 04:56:00,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,334 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-14 04:56:00,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,342 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-14 04:56:00,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,343 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:00,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,350 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:00,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,378 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-14 04:56:00,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:00,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,395 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-14 04:56:00,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:00,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:00,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:00,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,406 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-14 04:56:00,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:00,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:00,438 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-14 04:56:00,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:00,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:00,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:00,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:00,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:00,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:00,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:00,576 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-14 04:56:00,577 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:56:00,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:00,584 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:00,585 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:00,585 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-01-14 04:56:00,608 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:56:00,616 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:56:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:00,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:00,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:00,779 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-14 04:56:00,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:00,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-01-14 04:56:00,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2019-01-14 04:56:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2019-01-14 04:56:00,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 04:56:00,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:00,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 04:56:00,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:00,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 04:56:00,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:00,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2019-01-14 04:56:00,967 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:00,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2019-01-14 04:56:00,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:56:00,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:00,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-01-14 04:56:00,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:00,974 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 04:56:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-01-14 04:56:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 04:56:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:56:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-14 04:56:00,997 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 04:56:00,998 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-14 04:56:00,998 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:56:00,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-14 04:56:00,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:00,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:00,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:00,999 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 04:56:01,000 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:01,000 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 145#L23-3 assume !(main_~i~1 < 5); 144#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 137#L9-3 [2019-01-14 04:56:01,000 INFO L796 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 138#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 137#L9-3 [2019-01-14 04:56:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-14 04:56:01,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:01,075 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-14 04:56:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:01,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:56:01,078 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-01-14 04:56:01,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:01,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:56:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:56:01,189 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 04:56:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:01,204 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-14 04:56:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:56:01,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-01-14 04:56:01,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:01,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2019-01-14 04:56:01,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:56:01,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:01,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-01-14 04:56:01,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:01,210 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-14 04:56:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-01-14 04:56:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-14 04:56:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:56:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-14 04:56:01,213 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-14 04:56:01,213 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-14 04:56:01,213 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:56:01,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-01-14 04:56:01,214 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:01,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:01,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:01,215 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:56:01,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:01,215 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 5); 189#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L9-3 [2019-01-14 04:56:01,215 INFO L796 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 182#L9-3 [2019-01-14 04:56:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-14 04:56:01,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:01,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:01,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:01,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:01,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:56:01,351 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-01-14 04:56:01,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:56:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:56:01,502 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 04:56:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:01,529 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-01-14 04:56:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:56:01,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-01-14 04:56:01,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:01,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2019-01-14 04:56:01,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:56:01,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:01,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2019-01-14 04:56:01,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:01,533 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-14 04:56:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2019-01-14 04:56:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-14 04:56:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 04:56:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-14 04:56:01,536 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 04:56:01,536 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 04:56:01,536 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:56:01,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-01-14 04:56:01,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:01,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:01,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:01,538 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 04:56:01,538 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:01,538 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 254#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 264#L23-3 assume !(main_~i~1 < 5); 253#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 246#L9-3 [2019-01-14 04:56:01,538 INFO L796 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L9-3 [2019-01-14 04:56:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-14 04:56:01,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:01,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:01,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:01,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:56:01,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:56:01,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:56:01,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:01,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:01,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:56:01,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-01-14 04:56:01,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:01,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:01,894 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:56:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:56:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:56:01,985 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-14 04:56:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:02,065 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-01-14 04:56:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:56:02,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-01-14 04:56:02,067 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2019-01-14 04:56:02,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:56:02,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:02,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-14 04:56:02,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:02,069 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-14 04:56:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-14 04:56:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-14 04:56:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 04:56:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-14 04:56:02,072 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 04:56:02,072 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 04:56:02,072 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:56:02,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-01-14 04:56:02,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:02,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:02,073 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-14 04:56:02,074 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:02,074 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 329#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 5); 328#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 321#L9-3 [2019-01-14 04:56:02,074 INFO L796 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 322#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 321#L9-3 [2019-01-14 04:56:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-14 04:56:02,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:02,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:02,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:02,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:56:02,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 04:56:02,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:56:02,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:02,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:02,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 04:56:02,262 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-01-14 04:56:02,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:56:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:56:02,379 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-01-14 04:56:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:02,417 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-14 04:56:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:56:02,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-01-14 04:56:02,424 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2019-01-14 04:56:02,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:56:02,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:02,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2019-01-14 04:56:02,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:02,425 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 04:56:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2019-01-14 04:56:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-14 04:56:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 04:56:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-14 04:56:02,428 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 04:56:02,428 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 04:56:02,428 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:56:02,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-01-14 04:56:02,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:02,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:02,429 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-14 04:56:02,430 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:02,430 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 415#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 420#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 5); 414#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 407#L9-3 [2019-01-14 04:56:02,430 INFO L796 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 408#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 407#L9-3 [2019-01-14 04:56:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-14 04:56:02,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:02,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:02,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:02,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 04:56:02,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 04:56:02,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:56:02,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:56:02,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 04:56:02,614 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-01-14 04:56:02,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:56:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:56:02,675 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-01-14 04:56:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:02,718 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-01-14 04:56:02,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:56:02,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-01-14 04:56:02,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2019-01-14 04:56:02,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:56:02,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:56:02,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-01-14 04:56:02,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:02,722 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 04:56:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-01-14 04:56:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-14 04:56:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 04:56:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-14 04:56:02,727 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 04:56:02,728 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 04:56:02,729 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:56:02,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-01-14 04:56:02,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:56:02,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:02,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:02,731 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-14 04:56:02,731 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:02,731 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 516#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 523#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 522#L23-3 assume !(main_~i~1 < 5); 510#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 503#L9-3 [2019-01-14 04:56:02,731 INFO L796 eck$LassoCheckResult]: Loop: 503#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 504#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 503#L9-3 [2019-01-14 04:56:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-14 04:56:02,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-01-14 04:56:02,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-01-14 04:56:02,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:02,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:03,331 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-01-14 04:56:03,472 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 04:56:03,475 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:03,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:03,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:03,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:03,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:03,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:03,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:03,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:03,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-14 04:56:03,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:03,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:03,482 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-14 04:56:03,486 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-14 04:56:03,488 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-14 04:56:03,491 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-14 04:56:03,615 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-14 04:56:03,618 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-14 04:56:03,622 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-14 04:56:03,624 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-14 04:56:03,625 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-14 04:56:03,630 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-14 04:56:03,632 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-14 04:56:03,635 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-14 04:56:03,637 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-14 04:56:03,640 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-14 04:56:03,644 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-14 04:56:03,646 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-14 04:56:03,649 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-14 04:56:03,651 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-14 04:56:03,654 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-14 04:56:03,657 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-14 04:56:03,686 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-14 04:56:03,695 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-14 04:56:04,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:04,203 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:04,203 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-14 04:56:04,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:04,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:04,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:04,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,209 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-14 04:56:04,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:04,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:04,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:04,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,214 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-14 04:56:04,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:04,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:04,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,224 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-14 04:56:04,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:04,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:04,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,234 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-14 04:56:04,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,234 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 04:56:04,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,239 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:56:04,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:04,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,247 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-14 04:56:04,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:04,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:04,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:04,260 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-14 04:56:04,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:04,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:04,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:04,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:04,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:04,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:04,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:04,296 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:56:04,296 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:56:04,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:04,300 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:04,300 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:04,300 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_sum_~x.base)_1) = -8*ULTIMATE.start_sum_~i~0 + 9*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 Supporting invariants [] [2019-01-14 04:56:04,356 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:56:04,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:56:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:04,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:04,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:04,477 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-14 04:56:04,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:04,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 04:56:04,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2019-01-14 04:56:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 04:56:04,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 04:56:04,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:04,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-14 04:56:04,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:04,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-14 04:56:04,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:04,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-14 04:56:04,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:04,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2019-01-14 04:56:04,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 04:56:04,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 04:56:04,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-01-14 04:56:04,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:04,517 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 04:56:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-01-14 04:56:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 04:56:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 04:56:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 04:56:04,519 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 04:56:04,519 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 04:56:04,519 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:56:04,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-01-14 04:56:04,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:04,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:04,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:04,521 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:04,521 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:04,521 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 654#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 655#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 659#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 666#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 665#L23-3 assume !(main_~i~1 < 5); 653#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 645#L9-3 assume !(sum_~i~0 < 5); 643#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 644#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 663#L9-8 [2019-01-14 04:56:04,521 INFO L796 eck$LassoCheckResult]: Loop: 663#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 664#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 663#L9-8 [2019-01-14 04:56:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2019-01-14 04:56:04,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:04,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:56:04,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:04,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:56:04,598 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2019-01-14 04:56:04,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:56:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:56:04,652 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 04:56:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:04,720 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-01-14 04:56:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:56:04,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-01-14 04:56:04,722 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:04,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 04:56:04,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:56:04,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:56:04,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2019-01-14 04:56:04,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:04,723 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 04:56:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2019-01-14 04:56:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-14 04:56:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 04:56:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-14 04:56:04,726 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-14 04:56:04,726 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-14 04:56:04,726 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:56:04,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-01-14 04:56:04,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:04,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:04,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:04,727 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:04,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:04,727 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 721#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 722#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 733#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 732#L23-3 assume !(main_~i~1 < 5); 720#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 712#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 713#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 714#L9-3 assume !(sum_~i~0 < 5); 710#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 711#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 729#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 730#L9-7 [2019-01-14 04:56:04,727 INFO L796 eck$LassoCheckResult]: Loop: 730#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 731#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 730#L9-7 [2019-01-14 04:56:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2019-01-14 04:56:04,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:56:04,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:04,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:04,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:04,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 04:56:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 04:56:05,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2019-01-14 04:56:05,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:05,278 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:56:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:56:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:56:05,340 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 04:56:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:05,403 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-01-14 04:56:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:56:05,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2019-01-14 04:56:05,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:05,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 04:56:05,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 04:56:05,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 04:56:05,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2019-01-14 04:56:05,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:05,408 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 04:56:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2019-01-14 04:56:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-14 04:56:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 04:56:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 04:56:05,411 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 04:56:05,411 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 04:56:05,411 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:56:05,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2019-01-14 04:56:05,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:05,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:05,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:05,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:05,413 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:05,413 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 860#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 869#L23-3 assume !(main_~i~1 < 5); 855#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 845#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 846#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 847#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 852#L9-3 assume !(sum_~i~0 < 5); 843#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 844#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 866#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 867#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 864#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 865#L9-7 [2019-01-14 04:56:05,413 INFO L796 eck$LassoCheckResult]: Loop: 865#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 868#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 865#L9-7 [2019-01-14 04:56:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2019-01-14 04:56:05,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 04:56:05,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:05,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:05,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:05,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 04:56:05,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:05,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 04:56:05,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2019-01-14 04:56:05,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:05,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:05,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:05,954 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:56:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:56:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:56:05,967 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-14 04:56:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:06,035 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-14 04:56:06,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:56:06,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2019-01-14 04:56:06,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:06,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2019-01-14 04:56:06,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 04:56:06,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 04:56:06,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2019-01-14 04:56:06,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:06,039 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-14 04:56:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2019-01-14 04:56:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-01-14 04:56:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 04:56:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 04:56:06,043 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 04:56:06,043 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 04:56:06,044 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:56:06,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-01-14 04:56:06,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:06,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:06,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:06,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:06,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:06,046 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1016#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1012#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1033#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1027#L23-3 assume !(main_~i~1 < 5); 1011#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1001#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1002#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1003#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1004#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1008#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1026#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1025#L9-3 assume !(sum_~i~0 < 5); 999#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1000#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1022#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1024#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1035#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1020#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L9-7 [2019-01-14 04:56:06,046 INFO L796 eck$LassoCheckResult]: Loop: 1021#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1032#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L9-7 [2019-01-14 04:56:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2019-01-14 04:56:06,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:06,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 04:56:06,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:06,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:06,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:56:06,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:56:06,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:56:06,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 04:56:06,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:06,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 04:56:06,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2019-01-14 04:56:06,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:06,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:06,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:06,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:56:06,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:56:06,322 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-01-14 04:56:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:06,562 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-01-14 04:56:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:56:06,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2019-01-14 04:56:06,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:06,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2019-01-14 04:56:06,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-14 04:56:06,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-14 04:56:06,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2019-01-14 04:56:06,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:06,566 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-01-14 04:56:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2019-01-14 04:56:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-01-14 04:56:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 04:56:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-14 04:56:06,571 INFO L729 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-14 04:56:06,571 INFO L609 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-14 04:56:06,574 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:56:06,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2019-01-14 04:56:06,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:06,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:06,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:06,576 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:06,576 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:06,576 INFO L794 eck$LassoCheckResult]: Stem: 1197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1211#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1210#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1204#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1203#L23-3 assume !(main_~i~1 < 5); 1189#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1180#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1181#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1213#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1212#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1202#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1201#L9-3 assume !(sum_~i~0 < 5); 1178#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1179#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1198#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1199#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1200#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1218#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1216#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1215#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L9-7 [2019-01-14 04:56:06,576 INFO L796 eck$LassoCheckResult]: Loop: 1209#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1208#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L9-7 [2019-01-14 04:56:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2019-01-14 04:56:06,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:06,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-14 04:56:06,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:56:06,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:56:06,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 04:56:06,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 04:56:06,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 04:56:06,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-14 04:56:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:56:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 04:56:06,949 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:56:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2019-01-14 04:56:06,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:56:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:56:07,007 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-01-14 04:56:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:07,084 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-01-14 04:56:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:56:07,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2019-01-14 04:56:07,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:07,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2019-01-14 04:56:07,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 04:56:07,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 04:56:07,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2019-01-14 04:56:07,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:07,089 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-01-14 04:56:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2019-01-14 04:56:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-14 04:56:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 04:56:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-14 04:56:07,092 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-14 04:56:07,092 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-14 04:56:07,092 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:56:07,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2019-01-14 04:56:07,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:56:07,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:07,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:07,093 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:07,093 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:07,094 INFO L794 eck$LassoCheckResult]: Stem: 1395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1394#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1390#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1391#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1416#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1414#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1412#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1410#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1408#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1406#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1405#L23-3 assume !(main_~i~1 < 5); 1389#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1379#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1380#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1381#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1382#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1386#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1421#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1420#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1419#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1418#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1402#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1401#L9-3 assume !(sum_~i~0 < 5); 1377#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1378#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1398#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1399#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1400#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1417#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1415#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1413#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1411#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1409#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1407#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-7 [2019-01-14 04:56:07,094 INFO L796 eck$LassoCheckResult]: Loop: 1404#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1403#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-7 [2019-01-14 04:56:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2019-01-14 04:56:07,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2019-01-14 04:56:07,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2019-01-14 04:56:07,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:07,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 04:56:07,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:56:07,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 04:56:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 04:56:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-14 04:56:07,775 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-01-14 04:56:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:56:08,088 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-14 04:56:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:56:08,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2019-01-14 04:56:08,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:08,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2019-01-14 04:56:08,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 04:56:08,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-14 04:56:08,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2019-01-14 04:56:08,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:08,092 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 04:56:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2019-01-14 04:56:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 04:56:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 04:56:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-14 04:56:08,094 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 04:56:08,095 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 04:56:08,095 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:56:08,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2019-01-14 04:56:08,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:56:08,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:56:08,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:56:08,096 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:56:08,096 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:56:08,097 INFO L794 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1536#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1535#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1533#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1531#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1529#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1525#L23-3 assume !(main_~i~1 < 5); 1510#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1505#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1506#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1507#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1534#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1532#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1530#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1528#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1527#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1524#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1523#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1522#L9-3 assume !(sum_~i~0 < 5); 1503#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1504#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1519#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1520#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1521#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1544#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1543#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1542#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1541#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1540#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1539#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1538#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1537#L9-8 assume !(sum_~i~0 < 5); 1516#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1517#L12-1 main_#t~ret7 := sum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1508#L32-3 [2019-01-14 04:56:08,097 INFO L796 eck$LassoCheckResult]: Loop: 1508#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1509#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1508#L32-3 [2019-01-14 04:56:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2019-01-14 04:56:08,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:08,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:08,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:56:08,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2019-01-14 04:56:08,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:08,212 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2019-01-14 04:56:08,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:56:08,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:56:08,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:56:08,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:56:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:56:08,708 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 04:56:08,856 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 04:56:11,723 WARN L181 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 321 DAG size of output: 245 [2019-01-14 04:56:37,987 WARN L181 SmtUtils]: Spent 26.21 s on a formula simplification. DAG size of input: 137 DAG size of output: 134 [2019-01-14 04:56:37,990 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:56:37,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:56:37,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:56:37,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:56:37,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:56:37,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:56:37,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:56:37,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:56:37,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-14 04:56:37,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:56:37,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:56:38,000 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-14 04:56:38,025 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-14 04:56:38,050 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-14 04:56:38,077 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-14 04:56:38,100 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-14 04:56:38,101 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-14 04:56:38,103 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-14 04:56:38,112 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-14 04:56:38,113 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-14 04:56:38,116 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-14 04:56:38,118 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-14 04:56:38,122 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-14 04:56:38,124 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-14 04:56:38,125 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-14 04:56:38,128 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-14 04:56:38,713 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-14 04:56:39,451 WARN L181 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-01-14 04:56:39,590 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-14 04:56:39,595 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-14 04:56:40,059 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-01-14 04:56:40,717 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-14 04:56:40,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:56:40,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:56:40,800 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-14 04:56:40,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,805 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-14 04:56:40,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,807 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-14 04:56:40,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,814 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-14 04:56:40,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:40,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:40,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,822 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-14 04:56:40,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,824 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-14 04:56:40,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,830 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-14 04:56:40,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:40,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:40,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,844 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-14 04:56:40,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,846 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-14 04:56:40,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,855 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-14 04:56:40,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,857 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-14 04:56:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,864 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-14 04:56:40,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,871 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-14 04:56:40,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,875 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-14 04:56:40,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,877 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-14 04:56:40,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:40,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:40,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,891 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-14 04:56:40,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:56:40,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:56:40,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:56:40,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:56:40,893 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-14 04:56:40,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:56:40,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:56:40,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:56:40,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:56:40,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:56:40,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:56:40,926 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:56:40,943 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:56:40,943 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:56:40,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:56:40,946 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:56:40,946 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:56:40,946 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2019-01-14 04:56:41,690 INFO L297 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2019-01-14 04:56:41,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:56:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:56:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:41,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:56:41,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:56:41,795 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-14 04:56:41,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:56:41,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 04:56:41,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2019-01-14 04:56:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:56:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:56:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 04:56:41,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2019-01-14 04:56:41,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:41,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2019-01-14 04:56:41,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:41,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2019-01-14 04:56:41,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:56:41,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-01-14 04:56:41,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:41,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-01-14 04:56:41,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:56:41,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:56:41,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:56:41,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:56:41,825 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:41,825 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:41,825 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:56:41,825 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:56:41,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:56:41,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:56:41,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:56:41,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:56:41 BoogieIcfgContainer [2019-01-14 04:56:41,832 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:56:41,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:56:41,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:56:41,833 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:56:41,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:55:58" (3/4) ... [2019-01-14 04:56:41,837 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:56:41,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:56:41,838 INFO L168 Benchmark]: Toolchain (without parser) took 44271.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 252.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 145.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,839 INFO L168 Benchmark]: CDTParser took 0.16 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-14 04:56:41,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.20 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,840 INFO L168 Benchmark]: Boogie Preprocessor took 155.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,841 INFO L168 Benchmark]: RCFGBuilder took 536.79 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,842 INFO L168 Benchmark]: BuchiAutomizer took 43171.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.8 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:56:41,843 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:56:41,847 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.16 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 340.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.20 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 536.79 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43171.78 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.8 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.1s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 41.2s. Construction of modules took 0.8s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 226 SDtfs, 195 SDslu, 446 SDs, 0 SdLazy, 315 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital556 mio100 ax100 hnf99 lsp125 ukn44 mio100 lsp59 div101 bol100 ite100 ukn100 eq166 hnf85 smp91 dnf154 smp83 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...