./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Urban-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/Urban-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 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:02,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:02,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:02,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:02,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:02,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:02,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:02,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:02,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:02,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:02,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:02,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:02,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:02,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:02,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:02,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:02,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:02,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:02,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:02,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:02,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:02,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:02,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:02,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:02,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:02,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:02,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:02,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:02,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:02,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:02,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:02,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:02,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:02,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:02,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:02,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:02,152 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:02,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:02,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:02,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:02,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:02,171 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:02,171 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:02,172 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:02,172 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:02,172 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:02,172 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:02,172 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:02,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:02,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:02,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:02,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:02,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:02,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:02,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:02,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:02,175 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:02,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:02,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:02,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:02,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:02,177 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:02,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:02,177 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:02,178 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:02,179 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:02,179 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 -> 9d3cc6bed79d5f36ef86c37a4cddb412902bd9be [2018-11-28 23:19:02,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:02,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:02,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:02,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:02,252 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:02,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-28 23:19:02,317 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed732326/2f352167be904d29837a4152043fac61/FLAG0776eaecb [2018-11-28 23:19:02,864 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:02,865 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2018-11-28 23:19:02,894 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed732326/2f352167be904d29837a4152043fac61/FLAG0776eaecb [2018-11-28 23:19:03,112 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed732326/2f352167be904d29837a4152043fac61 [2018-11-28 23:19:03,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:03,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:03,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:03,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:03,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:03,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4125e4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03, skipping insertion in model container [2018-11-28 23:19:03,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:03,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:03,604 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:03,629 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:03,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:03,842 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03 WrapperNode [2018-11-28 23:19:03,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:03,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:03,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:03,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:03,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:03,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:03,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:03,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:03,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... [2018-11-28 23:19:03,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:03,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:03,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:03,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:03,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:04,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:04,354 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:04,354 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:19:04,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04 BoogieIcfgContainer [2018-11-28 23:19:04,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:04,356 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:04,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:04,359 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:04,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:03" (1/3) ... [2018-11-28 23:19:04,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73ffda2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:04, skipping insertion in model container [2018-11-28 23:19:04,362 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:03" (2/3) ... [2018-11-28 23:19:04,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73ffda2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:04, skipping insertion in model container [2018-11-28 23:19:04,363 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:04,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04" (3/3) ... [2018-11-28 23:19:04,365 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2018-11-28 23:19:04,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:04,433 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:04,434 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:04,434 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:04,434 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:04,434 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:04,435 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:04,435 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:04,435 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:04,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:04,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:04,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:04,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:04,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:04,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:04,478 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:04,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:04,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:04,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:04,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:04,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:04,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:04,488 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L559-2true [2018-11-28 23:19:04,488 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 13#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 9#L551true assume main_#t~mem7 > 0;havoc main_#t~mem7; 7#L552true assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 8#L559-2true [2018-11-28 23:19:04,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:04,496 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:04,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:04,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2018-11-28 23:19:04,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:04,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2018-11-28 23:19:04,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:05,264 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-28 23:19:05,570 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 23:19:05,714 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:19:05,729 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:05,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:05,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:05,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:05,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:05,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:05,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:05,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:05,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:19:05,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:05,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:05,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:19: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:19:06,245 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-28 23:19:06,465 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-28 23:19:06,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:07,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:07,159 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:07,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:07,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:07,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:07,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:07,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,171 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:07,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,175 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:07,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:07,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:07,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:07,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:07,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:07,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:07,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:07,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:07,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:07,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:07,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:07,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:07,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,262 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:07,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:07,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:07,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:07,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:07,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:07,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:07,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:07,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:07,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:07,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:07,296 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:07,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:07,312 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:07,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:07,314 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:07,314 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:07,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-28 23:19:07,389 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:07,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:07,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:07,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:07,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:07,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:07,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-28 23:19:07,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 54 states and 72 transitions. Complement of second has 12 states. [2018-11-28 23:19:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-28 23:19:07,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-28 23:19:07,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:07,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 23:19:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-28 23:19:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:07,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2018-11-28 23:19:07,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:07,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 28 states and 43 transitions. [2018-11-28 23:19:07,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:19:07,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:19:07,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2018-11-28 23:19:07,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:07,886 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2018-11-28 23:19:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2018-11-28 23:19:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-11-28 23:19:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:19:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-11-28 23:19:07,918 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-28 23:19:07,918 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-28 23:19:07,918 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:07,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-11-28 23:19:07,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:07,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:07,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:07,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:07,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:07,920 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-11-28 23:19:07,921 INFO L796 eck$LassoCheckResult]: Loop: 184#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 174#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 175#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 179#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 184#L550-1 [2018-11-28 23:19:07,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:19:07,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 1 times [2018-11-28 23:19:07,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:07,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:07,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2018-11-28 23:19:07,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:08,256 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 23:19:08,483 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-28 23:19:08,635 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-11-28 23:19:08,805 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:19:08,808 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:08,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:08,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:08,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:08,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:08,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:08,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:08,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:08,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:19:08,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:08,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:08,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:08,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,646 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 23:19:09,766 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-28 23:19:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,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:19:09,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:19:09,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:19:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:09,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:10,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:10,527 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:10,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:10,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:10,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:10,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:10,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:10,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:10,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:10,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:10,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:10,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:10,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:10,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:10,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:10,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:10,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:10,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:10,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:10,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:10,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:10,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:10,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:10,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:10,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:10,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:10,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:10,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:10,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:10,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:10,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:10,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:10,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:10,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:10,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:10,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:10,552 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:10,553 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:10,553 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:10,553 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:10,553 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:10,553 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-28 23:19:10,752 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:10,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:10,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:10,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:11,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:11,011 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 32 treesize of output 33 [2018-11-28 23:19:11,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:11,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 23:19:11,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:11,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:11,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:11,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 23:19:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:11,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:11,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:19:11,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 43 states and 66 transitions. Complement of second has 9 states. [2018-11-28 23:19:11,132 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:19:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 23:19:11,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-28 23:19:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:19:11,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-28 23:19:11,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:11,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 66 transitions. [2018-11-28 23:19:11,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:11,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 64 transitions. [2018-11-28 23:19:11,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:19:11,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:19:11,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 64 transitions. [2018-11-28 23:19:11,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:11,141 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 64 transitions. [2018-11-28 23:19:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 64 transitions. [2018-11-28 23:19:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-28 23:19:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:19:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2018-11-28 23:19:11,147 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-11-28 23:19:11,147 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2018-11-28 23:19:11,147 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:11,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 61 transitions. [2018-11-28 23:19:11,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:11,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:11,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:11,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:11,149 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:11,150 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 333#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 357#L550-1 assume !main_#t~short6; 353#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 347#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-11-28 23:19:11,150 INFO L796 eck$LassoCheckResult]: Loop: 348#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 343#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 344#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 350#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 351#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 348#L559 [2018-11-28 23:19:11,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash 889571379, now seen corresponding path program 1 times [2018-11-28 23:19:11,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:11,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:11,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:19:11,271 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:19:11,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 1 times [2018-11-28 23:19:11,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,509 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-28 23:19:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:19:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:19:11,542 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. cyclomatic complexity: 27 Second operand 3 states. [2018-11-28 23:19:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:11,553 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-28 23:19:11,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:19:11,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2018-11-28 23:19:11,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:11,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 39 states and 50 transitions. [2018-11-28 23:19:11,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:19:11,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:19:11,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-11-28 23:19:11,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:11,561 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 23:19:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-11-28 23:19:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 23:19:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:19:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-28 23:19:11,565 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 23:19:11,565 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 23:19:11,565 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:11,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2018-11-28 23:19:11,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:19:11,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:11,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:11,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:11,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:11,567 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 424#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 434#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 447#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 438#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-11-28 23:19:11,568 INFO L796 eck$LassoCheckResult]: Loop: 439#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 445#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 450#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 425#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 426#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 439#L559 [2018-11-28 23:19:11,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 889569457, now seen corresponding path program 1 times [2018-11-28 23:19:11,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 2 times [2018-11-28 23:19:11,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -127775619, now seen corresponding path program 1 times [2018-11-28 23:19:11,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:11,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:11,804 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-28 23:19:12,021 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-11-28 23:19:12,079 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:12,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:12,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:12,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:12,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:12,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:12,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:12,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:12,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:19:12,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:12,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:12,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,245 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-11-28 23:19:12,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:12,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:12,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:12,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:12,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:12,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:12,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:12,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:12,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:12,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:12,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:12,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:12,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:12,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:12,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:12,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:12,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:12,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:12,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:12,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:12,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,877 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:12,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,881 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:12,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:12,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:12,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:12,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:12,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:12,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:12,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:12,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:12,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:12,931 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:12,952 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:19:12,952 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:19:12,953 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:12,955 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:12,955 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:12,955 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-28 23:19:12,991 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:12,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:13,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:13,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:13,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:13,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:13,075 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 27 treesize of output 30 [2018-11-28 23:19:13,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:13,087 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 30 treesize of output 21 [2018-11-28 23:19:13,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:13,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:13,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:13,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-28 23:19:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:13,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:13,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-28 23:19:13,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 85 transitions. Complement of second has 9 states. [2018-11-28 23:19:13,224 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:19:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-28 23:19:13,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-28 23:19:13,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:13,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:19:13,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:13,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-28 23:19:13,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:13,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2018-11-28 23:19:13,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 23:19:13,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 84 transitions. [2018-11-28 23:19:13,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:19:13,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-28 23:19:13,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 84 transitions. [2018-11-28 23:19:13,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:13,230 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-28 23:19:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 84 transitions. [2018-11-28 23:19:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-28 23:19:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 23:19:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-28 23:19:13,236 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-28 23:19:13,236 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-28 23:19:13,236 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:13,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2018-11-28 23:19:13,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 23:19:13,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:13,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:13,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:13,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:19:13,240 INFO L794 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 633#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 643#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 671#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 664#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-11-28 23:19:13,241 INFO L796 eck$LassoCheckResult]: Loop: 661#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 672#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 635#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 636#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 647#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 676#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 648#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 649#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 666#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 667#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 661#L559-2 [2018-11-28 23:19:13,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 2 times [2018-11-28 23:19:13,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash -552559553, now seen corresponding path program 1 times [2018-11-28 23:19:13,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:13,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:13,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:13,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:19:13,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:13,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:19:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:19:13,629 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-28 23:19:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:13,762 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-11-28 23:19:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:19:13,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 100 transitions. [2018-11-28 23:19:13,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-28 23:19:13,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 83 transitions. [2018-11-28 23:19:13,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-28 23:19:13,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 23:19:13,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2018-11-28 23:19:13,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:13,768 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-28 23:19:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2018-11-28 23:19:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-28 23:19:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:19:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2018-11-28 23:19:13,774 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-11-28 23:19:13,774 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2018-11-28 23:19:13,774 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:19:13,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2018-11-28 23:19:13,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-28 23:19:13,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:13,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:13,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:13,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:13,778 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 790#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 824#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 823#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 816#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 814#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 800#L559-2 [2018-11-28 23:19:13,778 INFO L796 eck$LassoCheckResult]: Loop: 800#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 801#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 791#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 792#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 804#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 800#L559-2 [2018-11-28 23:19:13,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 3 times [2018-11-28 23:19:13,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:13,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 35409683, now seen corresponding path program 2 times [2018-11-28 23:19:13,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:13,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:13,814 INFO L82 PathProgramCache]: Analyzing trace with hash 333922885, now seen corresponding path program 1 times [2018-11-28 23:19:13,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:13,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:14,072 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-28 23:19:14,771 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-28 23:19:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:14,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:19:14,945 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:19:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:14,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:15,332 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:19:15,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:15,526 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 33 treesize of output 34 [2018-11-28 23:19:15,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:15,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-28 23:19:15,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:15,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:15,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:15,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2018-11-28 23:19:15,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-28 23:19:15,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-28 23:19:15,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:15,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:15,697 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:19:15,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-28 23:19:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:19:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-28 23:19:15,845 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-11-28 23:19:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:19:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:19:15,892 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 18 Second operand 10 states. [2018-11-28 23:19:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:16,033 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-28 23:19:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:19:16,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-11-28 23:19:16,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-28 23:19:16,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 61 transitions. [2018-11-28 23:19:16,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:19:16,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:19:16,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2018-11-28 23:19:16,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:16,037 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-28 23:19:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2018-11-28 23:19:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-28 23:19:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 23:19:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-28 23:19:16,044 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-28 23:19:16,044 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-28 23:19:16,045 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:19:16,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2018-11-28 23:19:16,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-28 23:19:16,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:16,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:16,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:16,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:16,048 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 941#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 942#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 959#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 960#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 956#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-11-28 23:19:16,049 INFO L796 eck$LassoCheckResult]: Loop: 964#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 977#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 974#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 971#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 962#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 964#L559-2 [2018-11-28 23:19:16,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849425, now seen corresponding path program 1 times [2018-11-28 23:19:16,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:16,066 INFO L82 PathProgramCache]: Analyzing trace with hash 35409939, now seen corresponding path program 1 times [2018-11-28 23:19:16,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash 391181443, now seen corresponding path program 2 times [2018-11-28 23:19:16,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:16,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:16,256 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-28 23:19:16,527 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-11-28 23:19:16,587 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:16,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:16,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:16,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:16,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:16,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:16,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:16,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:16,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 23:19:16,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:16,589 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:16,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,773 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-11-28 23:19:16,887 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-28 23:19:16,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:16,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:17,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:17,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:17,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,464 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:17,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,465 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:17,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,501 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:17,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,502 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:17,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,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:19:17,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:17,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:17,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:17,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:17,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:17,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:17,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:17,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:17,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:17,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:17,541 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:17,541 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:17,542 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:17,542 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:17,542 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-28 23:19:17,670 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:17,672 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:17,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:17,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:17,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:17,756 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:17,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-28 23:19:17,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 78 states and 95 transitions. Complement of second has 11 states. [2018-11-28 23:19:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:19:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 23:19:17,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 23:19:17,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:17,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-28 23:19:17,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:17,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-28 23:19:17,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:17,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2018-11-28 23:19:17,836 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-11-28 23:19:17,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 89 transitions. [2018-11-28 23:19:17,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-28 23:19:17,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-28 23:19:17,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2018-11-28 23:19:17,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:17,838 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-11-28 23:19:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2018-11-28 23:19:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2018-11-28 23:19:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:19:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-11-28 23:19:17,846 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-11-28 23:19:17,846 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-11-28 23:19:17,846 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:19:17,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2018-11-28 23:19:17,847 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-28 23:19:17,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:17,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:17,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:19:17,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:17,851 INFO L794 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1182#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1224#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1221#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1218#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1216#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 1213#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1214#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1238#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1242#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-11-28 23:19:17,851 INFO L796 eck$LassoCheckResult]: Loop: 1207#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1239#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1240#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1212#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1208#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1207#L552 [2018-11-28 23:19:17,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash -125928585, now seen corresponding path program 1 times [2018-11-28 23:19:17,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:17,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:17,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:17,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash 51012381, now seen corresponding path program 2 times [2018-11-28 23:19:17,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:17,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:17,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1455202663, now seen corresponding path program 1 times [2018-11-28 23:19:17,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:17,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:17,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:18,059 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-11-28 23:19:18,544 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-11-28 23:19:18,631 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:18,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:18,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:18,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:18,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:18,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:18,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:18,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:18,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-28 23:19:18,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:18,633 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:18,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:18,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:18,955 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-11-28 23:19:19,066 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-28 23:19:19,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:19,591 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:19,591 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:19,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:19,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:19,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:19,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:19,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:19,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:19,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:19,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:19,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,618 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:19,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,623 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:19,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:19,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:19,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:19,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:19,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,650 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:19,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:19,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:19:19,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:19,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:19,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:19,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:19,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:19,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:19,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:19,680 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:19,684 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:19,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:19,685 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:19,685 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:19,686 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2018-11-28 23:19:19,754 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:19,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:19,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:19,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:19,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:19:19,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-28 23:19:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:19,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:19,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 23:19:19,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:19,911 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 28 treesize of output 19 [2018-11-28 23:19:19,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 23:19:19,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:19:19,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:19,949 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:19:19,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-28 23:19:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:20,008 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:19:20,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-28 23:19:20,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 169 states and 208 transitions. Complement of second has 10 states. [2018-11-28 23:19:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 23:19:20,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:19:20,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:20,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 23:19:20,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:20,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 23:19:20,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:20,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2018-11-28 23:19:20,115 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2018-11-28 23:19:20,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 187 transitions. [2018-11-28 23:19:20,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-28 23:19:20,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-28 23:19:20,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 187 transitions. [2018-11-28 23:19:20,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:20,118 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 187 transitions. [2018-11-28 23:19:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 187 transitions. [2018-11-28 23:19:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2018-11-28 23:19:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 23:19:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2018-11-28 23:19:20,130 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-11-28 23:19:20,130 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2018-11-28 23:19:20,130 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:19:20,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2018-11-28 23:19:20,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2018-11-28 23:19:20,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:20,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:20,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:20,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:20,135 INFO L794 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1542#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1543#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1601#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1604#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1605#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1610#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 1611#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-11-28 23:19:20,135 INFO L796 eck$LassoCheckResult]: Loop: 1554#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 1544#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 1545#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 1549#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 1550#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 1554#L550-1 [2018-11-28 23:19:20,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 2 times [2018-11-28 23:19:20,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2018-11-28 23:19:20,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2018-11-28 23:19:20,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:20,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:20,419 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 23:19:20,595 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-28 23:19:20,881 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2018-11-28 23:19:21,280 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-11-28 23:19:21,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:21,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:21,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:21,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:21,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:21,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:21,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:21,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:21,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-28 23:19:21,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:21,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:21,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,659 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-11-28 23:19:21,786 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-11-28 23:19:21,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:22,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:22,267 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:22,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:22,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:22,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:22,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,336 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:22,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:22,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:22,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:22,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:22,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:22,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:22,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:22,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:22,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:22,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:22,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:22,382 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:22,387 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:22,388 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:22,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:22,389 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:22,389 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:22,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-28 23:19:22,497 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:22,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:22,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:22,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:22,601 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 32 treesize of output 33 [2018-11-28 23:19:22,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:22,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 23:19:22,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 23:19:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:22,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:22,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-28 23:19:22,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 147 states and 182 transitions. Complement of second has 9 states. [2018-11-28 23:19:22,691 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:19:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 23:19:22,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:19:22,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:22,692 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:22,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:22,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:22,820 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 32 treesize of output 33 [2018-11-28 23:19:22,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:22,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 23:19:22,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:22,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 23:19:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:22,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:22,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-28 23:19:22,925 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 145 states and 182 transitions. Complement of second has 9 states. [2018-11-28 23:19:22,928 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:19:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-11-28 23:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:22,929 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:22,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:22,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:23,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:23,021 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 32 treesize of output 33 [2018-11-28 23:19:23,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:23,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 23:19:23,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:23,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:23,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:23,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 23:19:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:23,051 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:23,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2018-11-28 23:19:23,094 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48. Second operand 5 states. Result 214 states and 257 transitions. Complement of second has 8 states. [2018-11-28 23:19:23,102 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:19:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:19:23,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:19:23,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:23,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-28 23:19:23,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:23,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-28 23:19:23,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:23,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 257 transitions. [2018-11-28 23:19:23,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-28 23:19:23,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 157 states and 195 transitions. [2018-11-28 23:19:23,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-28 23:19:23,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-28 23:19:23,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 195 transitions. [2018-11-28 23:19:23,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:23,111 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 195 transitions. [2018-11-28 23:19:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 195 transitions. [2018-11-28 23:19:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2018-11-28 23:19:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 23:19:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2018-11-28 23:19:23,118 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-28 23:19:23,118 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-28 23:19:23,118 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:19:23,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 154 transitions. [2018-11-28 23:19:23,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-28 23:19:23,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:23,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:23,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-28 23:19:23,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:23,120 INFO L794 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2387#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 2388#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2432#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2433#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2476#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2427#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 2426#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2466#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2465#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2464#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-11-28 23:19:23,120 INFO L796 eck$LassoCheckResult]: Loop: 2408#L559 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(1 + main_#t~mem13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem13; 2409#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 2500#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 2499#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 2497#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 2408#L559 [2018-11-28 23:19:23,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -125928577, now seen corresponding path program 3 times [2018-11-28 23:19:23,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:23,141 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 3 times [2018-11-28 23:19:23,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:23,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:23,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:23,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1691624047, now seen corresponding path program 1 times [2018-11-28 23:19:23,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:23,355 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-28 23:19:23,790 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2018-11-28 23:19:23,874 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:23,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:23,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:23,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:23,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:23,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:23,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:23,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:23,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-28 23:19:23,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:23,875 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:23,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:23,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,076 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-11-28 23:19:24,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:24,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:24,571 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:24,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:24,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:24,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:24,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:24,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:24,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:24,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:24,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:24,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:24,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:24,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:24,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:24,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,588 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:24,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:24,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:24,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:24,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:24,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:24,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:24,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:24,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:24,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:24,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:24,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:24,654 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:24,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:24,657 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:24,658 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:24,658 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_7 Supporting invariants [] [2018-11-28 23:19:24,961 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:19:24,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,016 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 27 treesize of output 30 [2018-11-28 23:19:25,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,022 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 30 treesize of output 21 [2018-11-28 23:19:25,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-28 23:19:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,047 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:25,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-28 23:19:25,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-11-28 23:19:25,094 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:19:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:19:25,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:19:25,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,095 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:25,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,168 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 27 treesize of output 30 [2018-11-28 23:19:25,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,205 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 30 treesize of output 21 [2018-11-28 23:19:25,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-28 23:19:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,274 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:19:25,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-28 23:19:25,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 130 states and 164 transitions. Complement of second has 7 states. [2018-11-28 23:19:25,312 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:19:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:19:25,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:19:25,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,313 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:25,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,357 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 27 treesize of output 30 [2018-11-28 23:19:25,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,365 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 30 treesize of output 21 [2018-11-28 23:19:25,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2018-11-28 23:19:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:19:25,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2018-11-28 23:19:25,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42. Second operand 4 states. Result 159 states and 196 transitions. Complement of second has 6 states. [2018-11-28 23:19:25,431 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:19:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 23:19:25,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:19:25,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 23:19:25,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 23:19:25,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:25,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 196 transitions. [2018-11-28 23:19:25,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-28 23:19:25,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 129 states and 160 transitions. [2018-11-28 23:19:25,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-28 23:19:25,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-28 23:19:25,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 160 transitions. [2018-11-28 23:19:25,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:25,436 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 160 transitions. [2018-11-28 23:19:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 160 transitions. [2018-11-28 23:19:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-11-28 23:19:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 23:19:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2018-11-28 23:19:25,442 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-11-28 23:19:25,442 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2018-11-28 23:19:25,442 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:19:25,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 135 transitions. [2018-11-28 23:19:25,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-28 23:19:25,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:25,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:25,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:25,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-11-28 23:19:25,444 INFO L794 eck$LassoCheckResult]: Stem: 3166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3160#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem7, main_#t~nondet8, main_#t~mem9, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~mem14, main_#t~nondet15, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 3161#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3172#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3253#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3252#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3250#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3168#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3245#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3243#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3242#L551 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 3179#L559 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call write~int(main_#t~nondet15, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet15; 3180#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3266#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-11-28 23:19:25,444 INFO L796 eck$LassoCheckResult]: Loop: 3178#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3192#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3183#L552 assume 0 != main_#t~nondet8;havoc main_#t~nondet8;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;call write~int(main_#t~nondet10, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet10; 3188#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3186#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3187#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~short6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); 3264#L551 assume main_#t~mem7 > 0;havoc main_#t~mem7; 3169#L552 assume !(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11; 3170#L559-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := 0 != main_#t~mem4; 3177#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 3178#L550-3 [2018-11-28 23:19:25,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash -705255448, now seen corresponding path program 2 times [2018-11-28 23:19:25,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:25,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:25,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:19:25,584 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:19:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:19:25,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:19:25,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:19:25,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:25,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:19:25,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-28 23:19:25,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 23:19:25,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:25,701 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 28 treesize of output 19 [2018-11-28 23:19:25,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,713 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 23:19:25,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:19:25,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,746 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:19:25,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:9 [2018-11-28 23:19:25,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:19:25,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 23:19:25,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:25,851 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:19:25,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-28 23:19:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:25,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:19:25,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-28 23:19:25,872 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:19:25,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 757834051, now seen corresponding path program 1 times [2018-11-28 23:19:25,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:25,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:25,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:26,167 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-28 23:19:26,428 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-11-28 23:19:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:19:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:19:26,429 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. cyclomatic complexity: 34 Second operand 11 states. [2018-11-28 23:19:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:26,646 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-11-28 23:19:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:19:26,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions. [2018-11-28 23:19:26,650 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:26,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2018-11-28 23:19:26,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:26,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:26,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:26,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:26,650 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:26,650 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:26,651 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:26,653 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:19:26,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:26,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:26,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:26,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:26 BoogieIcfgContainer [2018-11-28 23:19:26,660 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:26,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:26,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:26,661 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:26,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:04" (3/4) ... [2018-11-28 23:19:26,670 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:26,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:26,671 INFO L168 Benchmark]: Toolchain (without parser) took 23553.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 950.0 MB in the beginning and 881.2 MB in the end (delta: 68.8 MB). Peak memory consumption was 442.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:26,674 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:26,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:26,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:26,677 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:26,679 INFO L168 Benchmark]: RCFGBuilder took 419.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:26,680 INFO L168 Benchmark]: BuchiAutomizer took 22304.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 212.8 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:26,681 INFO L168 Benchmark]: Witness Printer took 9.46 ms. Allocated memory is still 1.4 GB. Free memory is still 881.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:26,687 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.18 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 722.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.37 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.78 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 419.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22304.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 881.2 MB in the end (delta: 212.8 MB). Peak memory consumption was 461.9 MB. Max. memory is 11.5 GB. * Witness Printer took 9.46 ms. Allocated memory is still 1.4 GB. Free memory is still 881.2 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 - 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 11 terminating modules (4 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.2s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 18.7s. Construction of modules took 0.6s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 122 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 152 SDslu, 64 SDs, 0 SdLazy, 501 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax107 hnf100 lsp81 ukn66 mio100 lsp35 div100 bol103 ite100 ukn100 eq180 hnf88 smp97 dnf105 smp95 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 2 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...