./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a7013a4cfa859e3e95189f90d363983a25fcd0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:48,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:48,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:48,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:48,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:48,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:48,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:48,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:48,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:48,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:48,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:48,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:48,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:48,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:48,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:48,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:48,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:48,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:48,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:48,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:48,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:48,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:48,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:48,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:48,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:48,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:48,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:48,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:48,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:48,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:48,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:48,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:48,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:48,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:48,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:48,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:48,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:48,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:48,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:48,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:48,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:48,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:48,357 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:48,357 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:48,358 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:48,358 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:48,358 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:48,359 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:48,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:48,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:48,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:48,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:48,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:48,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:48,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:48,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:48,361 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:48,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:48,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:48,362 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:48,363 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:48,364 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2018-11-28 23:21:48,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:48,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:48,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:48,437 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:48,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:48,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-28 23:21:48,498 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c393abd/c297ca75b87d4dea9d46799a4343724a/FLAG2f9144817 [2018-11-28 23:21:48,974 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:48,975 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/twisted-alloca_true-termination.c.i [2018-11-28 23:21:48,988 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c393abd/c297ca75b87d4dea9d46799a4343724a/FLAG2f9144817 [2018-11-28 23:21:49,281 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0c393abd/c297ca75b87d4dea9d46799a4343724a [2018-11-28 23:21:49,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:49,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:49,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:49,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:49,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:49,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7316e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49, skipping insertion in model container [2018-11-28 23:21:49,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:49,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:49,766 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:49,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:49,854 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:49,998 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:49,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49 WrapperNode [2018-11-28 23:21:49,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:49,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:50,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:50,001 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:50,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:50,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:50,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:50,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:50,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:50,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:50,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:50,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:50,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:50,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:50,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:50,689 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:50,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50 BoogieIcfgContainer [2018-11-28 23:21:50,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:50,691 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:50,691 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:50,695 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:50,696 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:49" (1/3) ... [2018-11-28 23:21:50,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62238f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:50, skipping insertion in model container [2018-11-28 23:21:50,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (2/3) ... [2018-11-28 23:21:50,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62238f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:50, skipping insertion in model container [2018-11-28 23:21:50,699 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50" (3/3) ... [2018-11-28 23:21:50,702 INFO L375 chiAutomizerObserver]: Analyzing ICFG twisted-alloca_true-termination.c.i [2018-11-28 23:21:50,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:50,765 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:50,765 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:50,765 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:50,765 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:50,765 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:50,765 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:50,765 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:50,766 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:50,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:21:50,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:21:50,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:50,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:50,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:21:50,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,808 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:50,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:21:50,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:21:50,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:50,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:50,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:21:50,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,818 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2018-11-28 23:21:50,819 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2018-11-28 23:21:50,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:21:50,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:50,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:50,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2018-11-28 23:21:51,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:51,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 23:21:51,065 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:51,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:21:51,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:21:51,081 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 23:21:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:51,089 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 23:21:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:21:51,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 23:21:51,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:21:51,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-28 23:21:51,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:51,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:51,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:21:51,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:51,102 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:21:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:21:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:21:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:21:51,133 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:51,133 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:21:51,133 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:51,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:21:51,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:21:51,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:51,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:51,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:21:51,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:51,137 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2018-11-28 23:21:51,137 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2018-11-28 23:21:51,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:21:51,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2018-11-28 23:21:51,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:51,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2018-11-28 23:21:51,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:51,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,679 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:21:52,204 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 23:21:53,276 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-28 23:21:53,475 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-28 23:21:53,487 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:53,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:53,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:53,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:53,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:53,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:53,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:53,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:53,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:53,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:53,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:53,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,422 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-11-28 23:21:54,743 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-11-28 23:21:54,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:55,060 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-11-28 23:21:55,810 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:21:55,910 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:55,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:55,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:55,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:55,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:55,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:55,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:55,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:55,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:55,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:55,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:55,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:55,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:55,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:55,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:55,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:55,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:55,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:55,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:55,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:55,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,019 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:56,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,023 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:56,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:56,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:56,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:56,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:56,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,068 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:56,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:56,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:56,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:56,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:56,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:56,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:56,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:56,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:56,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:56,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:56,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:56,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:56,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:56,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:56,211 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:56,214 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:56,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:56,218 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:56,218 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:56,220 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2018-11-28 23:21:56,578 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 23:21:56,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:21:56,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:56,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:56,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:56,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:21:56,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-28 23:21:56,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:21:56,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-28 23:21:56,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:21:56,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:21:56,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:21:56,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-28 23:21:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:56,861 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:21:56,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-28 23:21:56,912 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2018-11-28 23:21:56,915 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 [2018-11-28 23:21:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:21:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:21:56,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-28 23:21:56,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:56,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-28 23:21:56,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:56,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-28 23:21:56,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:56,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2018-11-28 23:21:56,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:56,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2018-11-28 23:21:56,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:21:56,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:21:56,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-28 23:21:56,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:56,928 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 23:21:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-28 23:21:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:21:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:21:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-28 23:21:56,933 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:21:56,933 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-28 23:21:56,933 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:56,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-28 23:21:56,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:56,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:56,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:56,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:21:56,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:56,936 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 267#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 268#L569 goto; 272#L560 [2018-11-28 23:21:56,936 INFO L796 eck$LassoCheckResult]: Loop: 272#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 278#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 279#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 272#L560 [2018-11-28 23:21:56,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:56,937 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-28 23:21:56,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:56,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-11-28 23:21:56,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:56,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:56,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2018-11-28 23:21:56,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:57,209 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:21:57,326 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-28 23:21:57,755 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2018-11-28 23:21:57,961 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-28 23:21:57,963 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:57,963 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:57,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:57,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:57,964 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:57,964 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:57,964 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:57,964 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:57,964 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:21:57,964 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:57,965 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:57,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,497 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2018-11-28 23:21:58,634 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-11-28 23:21:58,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:58,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:59,112 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-11-28 23:21:59,630 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:59,630 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:59,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:59,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:59,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:59,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,710 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:59,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:59,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,740 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:59,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:59,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,766 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:59,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,777 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:59,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:59,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,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 [2018-11-28 23:21:59,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,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 [2018-11-28 23:21:59,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:59,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:59,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:59,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:59,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:59,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:59,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:59,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:59,875 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:59,888 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:59,888 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:59,888 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:59,890 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:59,891 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:59,891 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 Supporting invariants [] [2018-11-28 23:22:00,348 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-28 23:22:00,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:00,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:00,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:00,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:00,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:00,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:00,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 23:22:00,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:00,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 23:22:00,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:00,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:00,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:00,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:00,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 23:22:00,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:00,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:00,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 23:22:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:00,775 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:22:00,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 23:22:00,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2018-11-28 23:22:00,809 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 [2018-11-28 23:22:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:22:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:22:00,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:22:00,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:22:00,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:22:00,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:00,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-28 23:22:00,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:00,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2018-11-28 23:22:00,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:22:00,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:22:00,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2018-11-28 23:22:00,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:00,816 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-11-28 23:22:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2018-11-28 23:22:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-28 23:22:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:22:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 23:22:00,819 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:22:00,819 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:22:00,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:22:00,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 23:22:00,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:00,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:00,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:00,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:00,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:22:00,823 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 506#L569 goto; 507#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 515#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6; 503#L564 goto; 504#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 510#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 511#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 516#L569 goto; 517#L560 [2018-11-28 23:22:00,823 INFO L796 eck$LassoCheckResult]: Loop: 517#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 513#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 514#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 517#L560 [2018-11-28 23:22:00,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2018-11-28 23:22:00,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:00,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2018-11-28 23:22:00,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2018-11-28 23:22:00,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:01,219 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:22:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:01,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:22:01,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:22:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:01,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:01,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 23:22:01,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 23:22:01,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:01,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:01,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:01,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-28 23:22:01,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-11-28 23:22:01,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:01,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 42 [2018-11-28 23:22:01,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:01,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 23:22:01,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-11-28 23:22:01,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 23:22:01,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-28 23:22:01,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 23:22:01,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:01,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-28 23:22:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:01,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:22:01,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-28 23:22:02,060 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-28 23:22:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:22:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:22:02,062 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-28 23:22:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:02,303 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-28 23:22:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:22:02,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2018-11-28 23:22:02,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:02,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 23 transitions. [2018-11-28 23:22:02,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:22:02,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:22:02,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-28 23:22:02,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:02,307 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-28 23:22:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-28 23:22:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-11-28 23:22:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:22:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:22:02,310 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:22:02,310 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:22:02,310 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:22:02,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:22:02,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:02,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:02,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:02,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:02,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:22:02,312 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 612#L569 goto; 613#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 620#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 621#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 609#L564 goto; 610#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 615#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 616#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 622#L569 goto; 623#L560 [2018-11-28 23:22:02,312 INFO L796 eck$LassoCheckResult]: Loop: 623#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 618#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 619#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 623#L560 [2018-11-28 23:22:02,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2018-11-28 23:22:02,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:02,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:22:02,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:22:02,536 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:22:02,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2018-11-28 23:22:02,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:02,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:22:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:22:02,698 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 23:22:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:02,730 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-28 23:22:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:22:02,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-28 23:22:02,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:02,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 23:22:02,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:22:02,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:22:02,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 23:22:02,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:02,736 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:22:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 23:22:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 23:22:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:22:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 23:22:02,740 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:22:02,740 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:22:02,740 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:22:02,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-28 23:22:02,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:02,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:02,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:02,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:02,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:22:02,744 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 653#L569 goto; 654#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 662#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 663#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 656#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 667#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 666#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 650#L564 goto; 651#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 657#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 658#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 664#L569 goto; 665#L560 [2018-11-28 23:22:02,744 INFO L796 eck$LassoCheckResult]: Loop: 665#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 660#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 661#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 665#L560 [2018-11-28 23:22:02,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2018-11-28 23:22:02,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2018-11-28 23:22:02,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:02,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:02,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:02,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2018-11-28 23:22:02,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:02,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:02,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:02,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:03,230 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:22:03,594 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-28 23:22:05,312 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2018-11-28 23:22:05,747 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-28 23:22:05,750 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:05,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:05,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:05,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:05,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:05,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:05,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:05,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:05,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: twisted-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:22:05,751 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:05,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:05,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:05,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,450 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-11-28 23:22:06,614 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-28 23:22:06,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:06,965 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-28 23:22:07,381 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:07,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:07,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:07,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:07,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:07,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,478 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:07,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:07,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:07,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:07,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,522 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:07,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:07,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:07,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:07,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:07,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:07,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:07,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:07,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:07,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:07,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:07,546 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:22:07,547 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:22:07,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:07,548 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:07,548 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:07,548 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 Supporting invariants [] [2018-11-28 23:22:07,837 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 23:22:07,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:07,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:07,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:07,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:07,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:07,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:07,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 23:22:07,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:07,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 23:22:07,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 23:22:08,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:08,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:08,072 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 23:22:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:08,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:22:08,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:22:08,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:22:08,141 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 [2018-11-28 23:22:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:22:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:22:08,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:08,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:08,142 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:08,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:08,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 23:22:08,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 23:22:08,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 23:22:08,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:08,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:22:08,334 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 23:22:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:08,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:22:08,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:22:08,419 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 51 states and 59 transitions. Complement of second has 9 states. [2018-11-28 23:22:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:22:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 23:22:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:08,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:22:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:08,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:22:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:08,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-28 23:22:08,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:08,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2018-11-28 23:22:08,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:22:08,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:22:08,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2018-11-28 23:22:08,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:22:08,431 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-28 23:22:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2018-11-28 23:22:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-28 23:22:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:22:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-28 23:22:08,436 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 23:22:08,437 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-28 23:22:08,437 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:22:08,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-28 23:22:08,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:22:08,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:08,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:08,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:08,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:22:08,441 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1051#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1052#L569 goto; 1053#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1075#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1068#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1069#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1083#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1082#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1081#L564 goto; 1079#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1056#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1057#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 1072#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1074#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1071#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1070#L569 goto; 1066#L560 [2018-11-28 23:22:08,441 INFO L796 eck$LassoCheckResult]: Loop: 1066#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1060#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem7;havoc f_#t~mem6;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~post9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1061#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1066#L560 [2018-11-28 23:22:08,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:08,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2018-11-28 23:22:08,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:08,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:08,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:22:08,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:22:08,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:22:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:08,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:08,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 23:22:08,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 23:22:08,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:22:08,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-28 23:22:08,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2018-11-28 23:22:08,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 23:22:08,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-28 23:22:08,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:22:08,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:6 [2018-11-28 23:22:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:22:09,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:22:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 23:22:09,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:22:09,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2018-11-28 23:22:09,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:09,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:09,211 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:22:09,385 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-11-28 23:22:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:22:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:22:09,386 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-11-28 23:22:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:09,592 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-28 23:22:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:22:09,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-11-28 23:22:09,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:09,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-28 23:22:09,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:22:09,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:22:09,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:22:09,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:09,595 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,595 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,595 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:09,595 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:22:09,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:22:09,596 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:09,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:22:09,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:09 BoogieIcfgContainer [2018-11-28 23:22:09,604 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:09,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:09,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:09,605 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:09,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50" (3/4) ... [2018-11-28 23:22:09,609 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:22:09,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:09,610 INFO L168 Benchmark]: Toolchain (without parser) took 20322.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 952.7 MB in the beginning and 934.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,611 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:09,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,613 INFO L168 Benchmark]: Boogie Preprocessor took 57.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:09,613 INFO L168 Benchmark]: RCFGBuilder took 557.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,614 INFO L168 Benchmark]: BuchiAutomizer took 18913.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 934.3 MB in the end (delta: 176.6 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:09,615 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:09,619 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.17 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 709.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 557.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18913.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 934.3 MB in the end (delta: 176.6 MB). Peak memory consumption was 353.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 16.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 60 SDslu, 134 SDs, 0 SdLazy, 170 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital879 mio100 ax103 hnf100 lsp94 ukn41 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf88 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms 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...