./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/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-2e94e6a [2019-01-01 21:46:27,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:46:27,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:46:27,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:46:27,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:46:27,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:46:27,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:46:27,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:46:27,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:46:27,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:46:27,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:46:27,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:46:27,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:46:27,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:46:27,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:46:27,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:46:27,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:46:27,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:46:27,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:46:27,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:46:27,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:46:27,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:46:27,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:46:27,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:46:27,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:46:27,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:46:27,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:46:27,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:46:27,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:46:27,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:46:27,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:46:27,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:46:27,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:46:27,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:46:27,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:46:27,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:46:27,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:46:27,135 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:46:27,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:46:27,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:46:27,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:46:27,137 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:46:27,137 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:46:27,137 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:46:27,138 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:46:27,140 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:46:27,140 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:46:27,140 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:46:27,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:46:27,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:46:27,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:46:27,142 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:46:27,142 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:46:27,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:46:27,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:46:27,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:46:27,147 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:46:27,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:46:27,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:46:27,148 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:46:27,149 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:46:27,149 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 [2019-01-01 21:46:27,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:46:27,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:46:27,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:46:27,235 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:46:27,236 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:46:27,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2019-01-01 21:46:27,302 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144c716d/e96ef96e21bb45f19e1338e730afcd15/FLAGa54d910b3 [2019-01-01 21:46:27,880 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:46:27,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Urban-alloca_true-termination.c.i [2019-01-01 21:46:27,902 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144c716d/e96ef96e21bb45f19e1338e730afcd15/FLAGa54d910b3 [2019-01-01 21:46:28,112 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144c716d/e96ef96e21bb45f19e1338e730afcd15 [2019-01-01 21:46:28,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:46:28,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:46:28,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:46:28,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:46:28,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:46:28,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71849c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28, skipping insertion in model container [2019-01-01 21:46:28,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:46:28,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:46:28,591 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:46:28,617 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:46:28,774 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:46:28,825 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:46:28,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28 WrapperNode [2019-01-01 21:46:28,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:46:28,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:46:28,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:46:28,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:46:28,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:46:28,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:46:28,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:46:28,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:46:28,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... [2019-01-01 21:46:28,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:46:28,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:46:28,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:46:28,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:46:28,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:46:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:46:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:46:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:46:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:46:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:46:29,374 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:46:29,374 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:46:29,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:29 BoogieIcfgContainer [2019-01-01 21:46:29,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:46:29,376 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:46:29,376 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:46:29,379 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:46:29,380 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:29,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:46:28" (1/3) ... [2019-01-01 21:46:29,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53fef143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:46:29, skipping insertion in model container [2019-01-01 21:46:29,382 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:29,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:28" (2/3) ... [2019-01-01 21:46:29,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53fef143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:46:29, skipping insertion in model container [2019-01-01 21:46:29,383 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:46:29,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:29" (3/3) ... [2019-01-01 21:46:29,386 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-alloca_true-termination.c.i [2019-01-01 21:46:29,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:46:29,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:46:29,447 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:46:29,447 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:46:29,448 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:46:29,448 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:46:29,448 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:46:29,448 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:46:29,448 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:46:29,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:46:29,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:46:29,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:29,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:29,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:46:29,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:29,494 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:46:29,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:46:29,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:46:29,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:29,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:29,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:46:29,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:29,506 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.allocOnStack(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.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L559-2true [2019-01-01 21:46:29,506 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:46:29,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:29,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:29,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2019-01-01 21:46:29,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2019-01-01 21:46:29,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:29,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:29,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:29,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:30,176 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-01-01 21:46:30,382 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:46:30,677 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 21:46:30,790 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:30,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:30,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:30,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:30,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:30,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:30,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:30,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:30,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:46:30,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:30,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:30,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:30,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:30,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,421 WARN L181 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-01 21:46:31,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:32,379 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:32,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:32,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:32,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:32,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:32,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:32,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:32,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:32,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:32,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:32,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:32,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:32,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:32,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:32,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:32,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:32,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:32,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:32,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:32,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:32,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:32,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:32,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:32,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:32,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:32,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:32,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:32,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:32,610 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:32,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:32,617 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:32,619 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:32,620 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:46:32,620 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:32,621 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 [] [2019-01-01 21:46:32,673 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:32,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:32,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:32,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:32,880 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 [2019-01-01 21:46:32,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-01-01 21:46:33,107 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. [2019-01-01 21:46:33,114 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 [2019-01-01 21:46:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-01-01 21:46:33,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 21:46:33,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:33,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:46:33,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 21:46:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:33,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2019-01-01 21:46:33,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:33,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 28 states and 43 transitions. [2019-01-01 21:46:33,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:46:33,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 21:46:33,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2019-01-01 21:46:33,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:33,136 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2019-01-01 21:46:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2019-01-01 21:46:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2019-01-01 21:46:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:46:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2019-01-01 21:46:33,169 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-01-01 21:46:33,169 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2019-01-01 21:46:33,169 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:46:33,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2019-01-01 21:46:33,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:33,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:33,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:33,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:46:33,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:33,172 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.allocOnStack(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.allocOnStack(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 [2019-01-01 21:46:33,172 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:46:33,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:33,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:33,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 1 times [2019-01-01 21:46:33,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2019-01-01 21:46:33,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:33,479 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 21:46:33,678 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-01-01 21:46:33,952 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-01 21:46:34,273 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 21:46:34,278 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:34,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:34,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:34,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:34,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:34,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:34,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:34,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:34,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:46:34,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:34,279 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:34,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:34,923 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-01 21:46:35,042 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-01 21:46:35,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:35,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:35,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:35,685 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:35,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:35,860 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:35,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:35,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:35,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:35,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:35,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:35,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:35,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,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 [2019-01-01 21:46:35,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:35,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:35,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:35,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:35,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:35,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:35,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:35,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:35,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:35,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:35,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:35,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:35,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:35,943 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:35,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:35,945 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:46:35,945 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:35,945 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 [] [2019-01-01 21:46:35,987 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:35,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:36,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:36,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:36,296 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-01 21:46:36,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:36,332 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 [2019-01-01 21:46:36,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:36,352 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 [2019-01-01 21:46:36,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:36,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:36,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:36,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:46:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:36,381 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 [2019-01-01 21:46:36,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:46:36,435 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. [2019-01-01 21:46:36,437 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 [2019-01-01 21:46:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-01 21:46:36,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2019-01-01 21:46:36,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:36,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 21:46:36,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:36,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-01 21:46:36,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:36,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 66 transitions. [2019-01-01 21:46:36,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:36,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 64 transitions. [2019-01-01 21:46:36,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:46:36,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 21:46:36,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 64 transitions. [2019-01-01 21:46:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:36,445 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 64 transitions. [2019-01-01 21:46:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 64 transitions. [2019-01-01 21:46:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-01 21:46:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:46:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-01-01 21:46:36,450 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-01-01 21:46:36,450 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-01-01 21:46:36,450 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:46:36,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 61 transitions. [2019-01-01 21:46:36,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:36,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:36,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:36,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:46:36,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:36,455 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:36,455 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 889571379, now seen corresponding path program 1 times [2019-01-01 21:46:36,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:36,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:46:36,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:46:36,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:46:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 1 times [2019-01-01 21:46:36,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:36,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,707 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-01 21:46:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:46:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:46:36,738 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. cyclomatic complexity: 27 Second operand 3 states. [2019-01-01 21:46:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:36,752 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-01-01 21:46:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:46:36,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-01-01 21:46:36,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:36,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 39 states and 50 transitions. [2019-01-01 21:46:36,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:46:36,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:46:36,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-01-01 21:46:36,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:36,761 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 21:46:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-01-01 21:46:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 21:46:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:46:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-01 21:46:36,765 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 21:46:36,765 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 21:46:36,765 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:46:36,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-01 21:46:36,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:46:36,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:36,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:36,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:46:36,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:36,767 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:36,767 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash 889569457, now seen corresponding path program 1 times [2019-01-01 21:46:36,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:36,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 2 times [2019-01-01 21:46:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:36,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash -127775619, now seen corresponding path program 1 times [2019-01-01 21:46:36,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:36,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:36,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:36,959 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-01 21:46:37,257 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-01-01 21:46:37,345 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:37,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:37,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:37,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:37,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:37,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:37,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:37,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:37,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:46:37,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:37,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:37,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,572 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-01 21:46:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:37,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:38,303 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:38,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:38,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:38,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:38,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:38,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:38,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:38,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:38,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:38,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:38,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:38,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:38,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:38,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:38,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:38,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:38,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:38,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:38,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:38,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:38,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:38,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:38,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:38,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:38,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:38,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:38,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:38,449 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:46:38,450 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:46:38,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:38,452 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:38,452 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:38,452 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 [] [2019-01-01 21:46:38,620 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:38,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:38,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:38,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:38,693 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 [2019-01-01 21:46:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:38,698 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 [2019-01-01 21:46:38,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:38,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:38,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:38,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-01-01 21:46:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:38,761 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 [2019-01-01 21:46:38,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-01 21:46:38,850 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. [2019-01-01 21:46:38,852 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 [2019-01-01 21:46:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:46:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-01-01 21:46:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 21:46:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:46:38,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:38,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-01 21:46:38,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:38,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 85 transitions. [2019-01-01 21:46:38,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2019-01-01 21:46:38,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 84 transitions. [2019-01-01 21:46:38,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 21:46:38,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-01 21:46:38,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 84 transitions. [2019-01-01 21:46:38,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:38,858 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-01-01 21:46:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 84 transitions. [2019-01-01 21:46:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-01 21:46:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 21:46:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-01-01 21:46:38,866 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-01-01 21:46:38,866 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-01-01 21:46:38,866 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:46:38,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2019-01-01 21:46:38,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2019-01-01 21:46:38,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:38,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:38,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:38,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:46:38,872 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:38,872 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~short6;havoc main_#t~mem4;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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 2 times [2019-01-01 21:46:38,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:38,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:38,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -552559553, now seen corresponding path program 1 times [2019-01-01 21:46:38,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:38,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:38,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:38,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:39,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:46:39,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:46:39,167 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:46:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:46:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:46:39,168 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 21:46:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:39,283 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-01-01 21:46:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:46:39,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 100 transitions. [2019-01-01 21:46:39,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 21:46:39,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 67 states and 83 transitions. [2019-01-01 21:46:39,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-01 21:46:39,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 21:46:39,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2019-01-01 21:46:39,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:39,289 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-01 21:46:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2019-01-01 21:46:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-01-01 21:46:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:46:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-01-01 21:46:39,293 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-01-01 21:46:39,293 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-01-01 21:46:39,293 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:46:39,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2019-01-01 21:46:39,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:46:39,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:39,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:39,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:39,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:39,295 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:39,295 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 3 times [2019-01-01 21:46:39,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:39,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 35409683, now seen corresponding path program 2 times [2019-01-01 21:46:39,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:39,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:39,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 333922885, now seen corresponding path program 1 times [2019-01-01 21:46:39,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:39,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:46:39,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:46:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:39,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:39,805 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:46:39,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:39,864 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 [2019-01-01 21:46:39,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:39,870 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 [2019-01-01 21:46:39,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2019-01-01 21:46:39,890 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 [2019-01-01 21:46:39,893 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 [2019-01-01 21:46:39,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:39,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-01 21:46:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:39,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:46:39,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-01-01 21:46:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:46:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:46:40,068 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-01-01 21:46:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:40,189 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-01-01 21:46:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:46:40,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2019-01-01 21:46:40,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-01-01 21:46:40,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 50 states and 61 transitions. [2019-01-01 21:46:40,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 21:46:40,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 21:46:40,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 61 transitions. [2019-01-01 21:46:40,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:40,194 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-01-01 21:46:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 61 transitions. [2019-01-01 21:46:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-01 21:46:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 21:46:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-01-01 21:46:40,197 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-01-01 21:46:40,197 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-01-01 21:46:40,197 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:46:40,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2019-01-01 21:46:40,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-01-01 21:46:40,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:40,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:40,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:40,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:40,200 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:40,200 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:40,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849425, now seen corresponding path program 1 times [2019-01-01 21:46:40,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:40,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 35409939, now seen corresponding path program 1 times [2019-01-01 21:46:40,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:40,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:40,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash 391181443, now seen corresponding path program 2 times [2019-01-01 21:46:40,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:40,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:40,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:41,158 WARN L181 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-01-01 21:46:41,461 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-01-01 21:46:41,574 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:41,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:41,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:41,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:41,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:41,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:41,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:41,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:41,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-01 21:46:41,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:41,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:41,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:41,984 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-01-01 21:46:42,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:42,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:42,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:42,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:42,692 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:42,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:42,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:42,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:42,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:42,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:42,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,807 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:46:42,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,809 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:46:42,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:42,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:42,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:42,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:42,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:42,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:42,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:42,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:42,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:42,840 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:42,840 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:42,840 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:42,841 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:42,841 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:42,841 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 [] [2019-01-01 21:46:43,061 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:43,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:43,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:43,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:43,294 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 [2019-01-01 21:46:43,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 16 Second operand 6 states. [2019-01-01 21:46:43,382 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. [2019-01-01 21:46:43,383 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 [2019-01-01 21:46:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:46:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 21:46:43,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:46:43,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:43,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:46:43,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:43,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 10 letters. [2019-01-01 21:46:43,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:43,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2019-01-01 21:46:43,386 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2019-01-01 21:46:43,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 89 transitions. [2019-01-01 21:46:43,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-01 21:46:43,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-01 21:46:43,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 89 transitions. [2019-01-01 21:46:43,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:43,388 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-01-01 21:46:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 89 transitions. [2019-01-01 21:46:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-01-01 21:46:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 21:46:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-01-01 21:46:43,394 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-01-01 21:46:43,394 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-01-01 21:46:43,394 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:46:43,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2019-01-01 21:46:43,395 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2019-01-01 21:46:43,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:43,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:43,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:46:43,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:43,396 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:43,396 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -125928585, now seen corresponding path program 1 times [2019-01-01 21:46:43,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash 51012381, now seen corresponding path program 2 times [2019-01-01 21:46:43,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1455202663, now seen corresponding path program 1 times [2019-01-01 21:46:43,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:44,197 WARN L181 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-01 21:46:44,610 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-01-01 21:46:44,720 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:46:44,723 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:44,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:44,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:44,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:44,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:44,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:44,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:44,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:44,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration8_Lasso [2019-01-01 21:46:44,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:44,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:44,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:44,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:44,965 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-01 21:46:45,095 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-01 21:46:45,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:45,542 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:45,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:45,593 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:45,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:45,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:45,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:45,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:45,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:45,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:45,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:45,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:45,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:45,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 [2019-01-01 21:46:45,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:45,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:45,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:45,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:45,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:45,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:45,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:45,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:45,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:45,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:45,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:45,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:45,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:45,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:45,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:45,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 [2019-01-01 21:46:45,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:45,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:45,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:45,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:45,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:45,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:45,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:45,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:45,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:45,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:45,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:45,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:45,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:45,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:45,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:45,669 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:46:45,672 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:46:45,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:45,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:45,673 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:45,674 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 [] [2019-01-01 21:46:45,901 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:45,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:45,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:45,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-01 21:46:45,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:45,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:45,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2019-01-01 21:46:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:45,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:46,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:46,030 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 [2019-01-01 21:46:46,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:46,048 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 [2019-01-01 21:46:46,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:46,062 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 [2019-01-01 21:46:46,070 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 [2019-01-01 21:46:46,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:46,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:46,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:46,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:46,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-01-01 21:46:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:46,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:46:46,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 21:46:46,271 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. [2019-01-01 21:46:46,273 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 [2019-01-01 21:46:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-01 21:46:46,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:46:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:46:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:46,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 21:46:46,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:46,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2019-01-01 21:46:46,279 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2019-01-01 21:46:46,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 187 transitions. [2019-01-01 21:46:46,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-01-01 21:46:46,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-01-01 21:46:46,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 187 transitions. [2019-01-01 21:46:46,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:46,282 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 187 transitions. [2019-01-01 21:46:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 187 transitions. [2019-01-01 21:46:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 122. [2019-01-01 21:46:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 21:46:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-01-01 21:46:46,298 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-01-01 21:46:46,298 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-01-01 21:46:46,298 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:46:46,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 157 transitions. [2019-01-01 21:46:46,299 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2019-01-01 21:46:46,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:46,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:46,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:46,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:46,302 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:46,302 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 2 times [2019-01-01 21:46:46,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2019-01-01 21:46:46,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2019-01-01 21:46:46,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:46,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:46,695 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 21:46:46,865 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-01-01 21:46:47,161 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-01-01 21:46:47,674 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-01-01 21:46:47,677 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:47,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:47,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:47,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:47,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:47,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:47,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:47,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:47,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration9_Lasso [2019-01-01 21:46:47,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:47,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:47,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:47,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,118 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-01-01 21:46:48,232 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-01 21:46:48,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:48,689 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:48,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:48,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:48,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:48,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:48,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:48,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,910 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:46:48,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,914 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:46:48,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,943 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:46:48,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,944 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:46:48,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:48,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:48,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:48,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:48,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:48,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:48,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:48,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:48,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:48,970 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:48,970 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:48,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:48,971 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:48,971 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:48,971 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 [] [2019-01-01 21:46:49,047 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:49,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,128 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 [2019-01-01 21:46:49,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,133 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 [2019-01-01 21:46:49,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:46:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:49,157 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 [2019-01-01 21:46:49,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-01-01 21:46:49,227 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. [2019-01-01 21:46:49,230 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 [2019-01-01 21:46:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:46:49,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 21:46:49,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:49,231 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,358 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 [2019-01-01 21:46:49,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,362 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 [2019-01-01 21:46:49,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:46:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:49,386 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 [2019-01-01 21:46:49,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-01-01 21:46:49,450 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. [2019-01-01 21:46:49,452 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 [2019-01-01 21:46:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-01-01 21:46:49,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 21:46:49,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:49,453 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:49,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:49,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,536 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 [2019-01-01 21:46:49,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:49,543 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 [2019-01-01 21:46:49,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:49,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:46:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:49,568 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 [2019-01-01 21:46:49,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 157 transitions. cyclomatic complexity: 48 Second operand 5 states. [2019-01-01 21:46:49,609 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. [2019-01-01 21:46:49,616 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 [2019-01-01 21:46:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:46:49,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 21:46:49,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:49,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2019-01-01 21:46:49,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:49,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-01 21:46:49,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:49,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 257 transitions. [2019-01-01 21:46:49,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2019-01-01 21:46:49,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 157 states and 195 transitions. [2019-01-01 21:46:49,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-01-01 21:46:49,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-01 21:46:49,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 195 transitions. [2019-01-01 21:46:49,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:49,627 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 195 transitions. [2019-01-01 21:46:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 195 transitions. [2019-01-01 21:46:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2019-01-01 21:46:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 21:46:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2019-01-01 21:46:49,633 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-01-01 21:46:49,633 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-01-01 21:46:49,633 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:46:49,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 154 transitions. [2019-01-01 21:46:49,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-01 21:46:49,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:49,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:49,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2019-01-01 21:46:49,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:46:49,635 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:49,635 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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -125928577, now seen corresponding path program 3 times [2019-01-01 21:46:49,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:49,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 58400557, now seen corresponding path program 3 times [2019-01-01 21:46:49,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:49,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1691624047, now seen corresponding path program 1 times [2019-01-01 21:46:49,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:49,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:49,794 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-01-01 21:46:50,176 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2019-01-01 21:46:50,258 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:46:50,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:46:50,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:46:50,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:46:50,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:46:50,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:46:50,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:46:50,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:46:50,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-alloca_true-termination.c.i_Iteration10_Lasso [2019-01-01 21:46:50,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:46:50,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:46:50,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:50,459 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-01 21:46:50,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:46:51,121 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 21:46:51,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:46:51,139 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:46:51,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:46:51,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,188 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:46:51,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,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 [2019-01-01 21:46:51,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,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 [2019-01-01 21:46:51,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:46:51,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:46:51,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:46:51,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:46:51,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:46:51,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:46:51,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:46:51,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:46:51,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:46:51,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:46:51,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:46:51,281 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:46:51,289 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:46:51,289 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:46:51,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:46:51,290 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:46:51,290 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:46:51,291 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 [] [2019-01-01 21:46:51,358 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-01-01 21:46:51,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:46:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,415 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 [2019-01-01 21:46:51,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,422 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 [2019-01-01 21:46:51,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-01-01 21:46:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:51,439 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 [2019-01-01 21:46:51,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-01-01 21:46:51,486 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. [2019-01-01 21:46:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:46:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:46:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:46:51,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:46:51,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:51,488 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,528 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 [2019-01-01 21:46:51,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,533 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 [2019-01-01 21:46:51,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-01-01 21:46:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:51,557 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 [2019-01-01 21:46:51,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-01-01 21:46:51,597 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. [2019-01-01 21:46:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:46:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:46:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:46:51,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:46:51,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:51,599 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:46:51,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,643 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 [2019-01-01 21:46:51,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:51,683 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 [2019-01-01 21:46:51,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:51,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:9 [2019-01-01 21:46:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:51,732 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 [2019-01-01 21:46:51,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 154 transitions. cyclomatic complexity: 42 Second operand 4 states. [2019-01-01 21:46:51,768 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. [2019-01-01 21:46:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:46:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:46:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-01 21:46:51,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:46:51,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:51,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:46:51,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:51,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 21:46:51,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:51,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 196 transitions. [2019-01-01 21:46:51,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-01-01 21:46:51,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 129 states and 160 transitions. [2019-01-01 21:46:51,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 21:46:51,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 21:46:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 160 transitions. [2019-01-01 21:46:51,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:46:51,776 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 160 transitions. [2019-01-01 21:46:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 160 transitions. [2019-01-01 21:46:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-01-01 21:46:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 21:46:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2019-01-01 21:46:51,784 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2019-01-01 21:46:51,784 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 135 transitions. [2019-01-01 21:46:51,784 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:46:51,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 135 transitions. [2019-01-01 21:46:51,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-01 21:46:51,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:46:51,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:46:51,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:46:51,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2019-01-01 21:46:51,787 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.allocOnStack(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.allocOnStack(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~short6;havoc main_#t~mem4;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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:51,787 INFO L796 eck$LassoCheckResult]: Loop: 3178#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;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~short6;havoc main_#t~mem4;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 [2019-01-01 21:46:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash -705255448, now seen corresponding path program 2 times [2019-01-01 21:46:51,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:51,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:46:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:46:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:51,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:46:51,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:46:51,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:46:52,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:46:52,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:46:52,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:46:52,015 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 [2019-01-01 21:46:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-01-01 21:46:52,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:52,041 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 [2019-01-01 21:46:52,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:52,079 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 [2019-01-01 21:46:52,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,093 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 19 treesize of output 20 [2019-01-01 21:46:52,103 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 [2019-01-01 21:46:52,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-01-01 21:46:52,238 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 [2019-01-01 21:46:52,241 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 [2019-01-01 21:46:52,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:52,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-01-01 21:46:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:46:52,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:46:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-01-01 21:46:52,276 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:46:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:46:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash 757834051, now seen corresponding path program 1 times [2019-01-01 21:46:52,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:46:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:46:52,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:52,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:46:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:46:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:46:52,664 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-01-01 21:46:52,941 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-01 21:46:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:46:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:46:52,942 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. cyclomatic complexity: 34 Second operand 13 states. [2019-01-01 21:46:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:46:53,148 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-01-01 21:46:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:46:53,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 103 transitions. [2019-01-01 21:46:53,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:53,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 0 states and 0 transitions. [2019-01-01 21:46:53,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:46:53,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:46:53,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:46:53,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:46:53,150 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:53,151 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:53,151 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:53,151 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:46:53,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:46:53,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:53,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:46:53,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:46:53 BoogieIcfgContainer [2019-01-01 21:46:53,160 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:46:53,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:46:53,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:46:53,161 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:46:53,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:46:29" (3/4) ... [2019-01-01 21:46:53,165 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:46:53,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:46:53,166 INFO L168 Benchmark]: Toolchain (without parser) took 25049.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -291.0 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:53,167 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:53,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:53,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:53,169 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:53,169 INFO L168 Benchmark]: RCFGBuilder took 459.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:53,170 INFO L168 Benchmark]: BuchiAutomizer took 23784.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.2 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:53,171 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:53,175 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 459.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23784.55 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.2 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.7s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 20.2s. Construction of modules took 0.7s. 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, 154 SDslu, 62 SDs, 0 SdLazy, 503 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax107 hnf100 lsp81 ukn67 mio100 lsp33 div100 bol103 ite100 ukn100 eq180 hnf88 smp97 dnf161 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...