./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer --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 30ab881e1a71a9d76a9921c34ce47cc9425d2331 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:52,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:52,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:52,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:52,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:52,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:52,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:52,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:52,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:52,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:52,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:52,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:52,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:52,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:52,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:52,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:52,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:52,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:52,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:52,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:52,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:52,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:52,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:52,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:52,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:52,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:52,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:52,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:52,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:52,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:52,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:52,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:52,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:52,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:52,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:52,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:52,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:52,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:52,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:52,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:52,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:52,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:52,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:52,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:52,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:52,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:52,252 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:52,252 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:52,252 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:52,252 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:52,253 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:52,253 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:52,253 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:52,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:52,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:52,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:52,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:52,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:52,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:52,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:52,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:52,255 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:52,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:52,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:52,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:52,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:52,256 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:52,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:52,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:52,256 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:52,257 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:52,257 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer 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 -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2019-10-22 08:59:52,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:52,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:52,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:52,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:52,311 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:52,311 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i [2019-10-22 08:59:52,358 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/data/dc6010c21/dd3df7271c4948a1830e542035c9c05b/FLAG95f3fe7ad [2019-10-22 08:59:52,771 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:52,772 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca.i [2019-10-22 08:59:52,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/data/dc6010c21/dd3df7271c4948a1830e542035c9c05b/FLAG95f3fe7ad [2019-10-22 08:59:52,792 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/data/dc6010c21/dd3df7271c4948a1830e542035c9c05b [2019-10-22 08:59:52,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:52,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:52,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:52,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:52,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:52,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:52" (1/1) ... [2019-10-22 08:59:52,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468cb35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:52, skipping insertion in model container [2019-10-22 08:59:52,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:52" (1/1) ... [2019-10-22 08:59:52,810 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:52,842 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:53,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:53,183 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:53,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:53,261 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:53,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53 WrapperNode [2019-10-22 08:59:53,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:53,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:53,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:53,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:53,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:53,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:53,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:53,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:53,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... [2019-10-22 08:59:53,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:53,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:53,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:53,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:53,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_895217a6-28be-4cf9-8397-f40381322480/bin/uautomizer/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-10-22 08:59:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:53,621 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:53,621 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:59:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:53 BoogieIcfgContainer [2019-10-22 08:59:53,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:53,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:53,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:53,627 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:53,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:53,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:52" (1/3) ... [2019-10-22 08:59:53,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:53, skipping insertion in model container [2019-10-22 08:59:53,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:53,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:53" (2/3) ... [2019-10-22 08:59:53,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:53, skipping insertion in model container [2019-10-22 08:59:53,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:53,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:53" (3/3) ... [2019-10-22 08:59:53,632 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca.i [2019-10-22 08:59:53,684 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:53,684 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:53,684 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:53,684 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:53,684 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:53,684 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:53,685 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:53,685 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:53,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-10-22 08:59:53,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:53,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:53,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:53,731 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:53,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:53,732 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:53,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-10-22 08:59:53,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:53,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:53,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:53,733 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:53,733 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:53,741 INFO L791 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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, 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; 11#L551-2true [2019-10-22 08:59:53,742 INFO L793 eck$LassoCheckResult]: Loop: 11#L551-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 12#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; 7#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 11#L551-2true [2019-10-22 08:59:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:59:53,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762360256] [2019-10-22 08:59:53,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,883 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-10-22 08:59:53,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999225920] [2019-10-22 08:59:53,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-10-22 08:59:53,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261724752] [2019-10-22 08:59:53,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:53,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:54,091 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-22 08:59:54,246 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-10-22 08:59:54,377 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:54,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:54,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:54,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:54,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:54,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:54,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:54,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:54,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration1_Lasso [2019-10-22 08:59:54,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:54,379 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:54,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,603 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-22 08:59:54,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,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-10-22 08:59:54,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-10-22 08:59:54,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-10-22 08:59:54,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:54,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:55,070 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:55,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:55,139 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:55,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:55,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:55,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:55,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:55,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:55,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:55,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,169 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:55,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:55,170 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:55,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:55,180 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:55,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:55,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:55,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:55,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:55,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:55,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:55,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:55,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:55,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:55,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,307 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:55,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,312 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:55,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:55,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:55,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:55,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:55,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:55,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:55,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:55,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:55,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:55,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:55,369 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:55,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:55,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:55,377 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:55,377 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:59:55,377 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:55,378 INFO L512 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-10-22 08:59:55,408 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:55,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:55,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:55,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:55,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,523 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-10-22 08:59:55,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-10-22 08:59:55,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2019-10-22 08:59:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-10-22 08:59:55,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:59:55,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:55,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 08:59:55,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:55,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2019-10-22 08:59:55,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2019-10-22 08:59:55,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:55,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:55,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-10-22 08:59:55,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:55,607 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:59:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-10-22 08:59:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-22 08:59:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-10-22 08:59:55,634 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:59:55,634 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:59:55,634 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:55,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-10-22 08:59:55,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,636 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:55,636 INFO L791 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, 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; 145#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 153#L550-1 assume !main_#t~short6; 146#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 147#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 151#L551-2 [2019-10-22 08:59:55,636 INFO L793 eck$LassoCheckResult]: Loop: 151#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 155#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; 157#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 156#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 151#L551-2 [2019-10-22 08:59:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2019-10-22 08:59:55,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337532602] [2019-10-22 08:59:55,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337532602] [2019-10-22 08:59:55,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:55,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:55,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153856945] [2019-10-22 08:59:55,674 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2019-10-22 08:59:55,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684837876] [2019-10-22 08:59:55,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,689 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,798 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-22 08:59:55,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:55,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:55,828 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:59:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,839 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-10-22 08:59:55,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:55,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-10-22 08:59:55,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2019-10-22 08:59:55,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:55,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:59:55,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-10-22 08:59:55,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:55,843 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:59:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-10-22 08:59:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:59:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:59:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 08:59:55,844 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:59:55,844 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:59:55,844 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:55,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 08:59:55,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:55,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,846 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:55,847 INFO L791 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, 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; 182#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 191#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; 184#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 185#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 188#L551-2 [2019-10-22 08:59:55,847 INFO L793 eck$LassoCheckResult]: Loop: 188#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 190#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; 194#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 193#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 188#L551-2 [2019-10-22 08:59:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2019-10-22 08:59:55,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875076356] [2019-10-22 08:59:55,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2019-10-22 08:59:55,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762754983] [2019-10-22 08:59:55,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,908 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2019-10-22 08:59:55,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144805156] [2019-10-22 08:59:55,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,960 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:56,250 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-22 08:59:56,320 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:56,321 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:56,321 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:56,321 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:56,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:56,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:56,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:56,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:56,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration3_Lasso [2019-10-22 08:59:56,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:56,322 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:56,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,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-10-22 08:59:56,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:56,824 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:56,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:56,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:56,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:56,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:56,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,850 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:56,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,855 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:56,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,858 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:56,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:56,874 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:56,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:56,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:56,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:56,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:56,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:56,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:56,890 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:56,890 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:56,896 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:56,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:56,900 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:56,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:56,902 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:56,902 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:56,902 INFO L512 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2019-10-22 08:59:56,926 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:56,927 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:56,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:56,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:56,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:56,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:57,001 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-10-22 08:59:57,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:59:57,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2019-10-22 08:59:57,027 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-10-22 08:59:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:59:57,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:57,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:57,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 08:59:57,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-10-22 08:59:57,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:57,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2019-10-22 08:59:57,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:59:57,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:57,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2019-10-22 08:59:57,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:57,030 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 08:59:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2019-10-22 08:59:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 08:59:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:59:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-22 08:59:57,032 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 08:59:57,032 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 08:59:57,032 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:57,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-10-22 08:59:57,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:57,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:57,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:57,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2019-10-22 08:59:57,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:57,034 INFO L791 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, 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; 317#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 333#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; 332#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 330#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 329#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 327#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; 318#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 319#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 323#L551-2 [2019-10-22 08:59:57,034 INFO L793 eck$LassoCheckResult]: Loop: 323#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 325#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; 328#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 331#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 323#L551-2 [2019-10-22 08:59:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2019-10-22 08:59:57,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967619255] [2019-10-22 08:59:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2019-10-22 08:59:57,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293098486] [2019-10-22 08:59:57,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,076 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2019-10-22 08:59:57,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747447027] [2019-10-22 08:59:57,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,218 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-22 08:59:57,626 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2019-10-22 08:59:57,734 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-22 08:59:57,736 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:57,736 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:57,736 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:57,736 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:57,736 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:57,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:57,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:57,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:57,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration4_Lasso [2019-10-22 08:59:57,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:57,737 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:57,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,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-10-22 08:59:57,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,271 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:58,272 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:58,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,276 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,276 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,280 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,285 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:58,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,285 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:59:58,285 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:58,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:58,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:58,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,295 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,307 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,312 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,316 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,316 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,320 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:58,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:58,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:58,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:58,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:58,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:58,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:58,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:58,335 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:58,338 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:58,338 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:58,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:58,339 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:58,339 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:58,339 INFO L512 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-10-22 08:59:58,372 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:58,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:58,450 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-10-22 08:59:58,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:58,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-10-22 08:59:58,478 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-10-22 08:59:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:59:58,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:58,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:58,526 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-10-22 08:59:58,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:58,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-10-22 08:59:58,560 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-10-22 08:59:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-10-22 08:59:58,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:58,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,561 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:58,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:58,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:58,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:58,637 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-10-22 08:59:58,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:58,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-10-22 08:59:58,672 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-10-22 08:59:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:59:58,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:58,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:59:58,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 08:59:58,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:58,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-10-22 08:59:58,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:59:58,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2019-10-22 08:59:58,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:59:58,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:59:58,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2019-10-22 08:59:58,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:58,677 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 08:59:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2019-10-22 08:59:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2019-10-22 08:59:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:59:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-10-22 08:59:58,678 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:59:58,678 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:59:58,678 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:58,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-10-22 08:59:58,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:59:58,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:58,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:58,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:59:58,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:58,681 INFO L791 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, 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; 641#L551-2 [2019-10-22 08:59:58,681 INFO L793 eck$LassoCheckResult]: Loop: 641#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 649#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; 643#L550-3 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 644#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 641#L551-2 [2019-10-22 08:59:58,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:59:58,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335852700] [2019-10-22 08:59:58,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2019-10-22 08:59:58,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801846060] [2019-10-22 08:59:58,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2019-10-22 08:59:58,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216584738] [2019-10-22 08:59:58,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,716 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,881 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:58,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:58,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:58,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:58,881 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:58,881 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:58,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:58,881 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:58,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca.i_Iteration5_Lasso [2019-10-22 08:59:58,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:58,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:58,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,308 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:59,308 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:59,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,310 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,310 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,315 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,326 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:59,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,328 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:59,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,338 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,345 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 08:59:59,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,354 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:59,355 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:59,355 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:59,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:59,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:59:59,356 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:59,356 INFO L512 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-10-22 08:59:59,394 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:59,396 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:59,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:59,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:59,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:59:59,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:59,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:59,479 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-10-22 08:59:59,479 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-10-22 08:59:59,538 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2019-10-22 08:59:59,539 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-10-22 08:59:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:59:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:59:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:59,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 08:59:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:59,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-10-22 08:59:59,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:59,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:59,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:59,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:59,542 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:59,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:59,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:59,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:59,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:59 BoogieIcfgContainer [2019-10-22 08:59:59,554 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:59,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:59,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:59,555 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:59,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:53" (3/4) ... [2019-10-22 08:59:59,559 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:59,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:59,562 INFO L168 Benchmark]: Toolchain (without parser) took 6766.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 941.8 MB in the beginning and 1.0 GB in the end (delta: -77.7 MB). Peak memory consumption was 107.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,563 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:59,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,565 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,566 INFO L168 Benchmark]: RCFGBuilder took 280.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,567 INFO L168 Benchmark]: BuchiAutomizer took 5931.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:59,568 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:59,570 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5931.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax108 hnf100 lsp87 ukn62 mio100 lsp39 div100 bol100 ite100 ukn100 eq185 hnf88 smp97 dnf162 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms 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...