./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/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 32bit --witnessprinter.graph.data.programhash 8044e0aeebe72762497fc5ccaff76a34eb4c9821 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:11:11,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:11:11,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:11:11,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:11:11,261 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:11:11,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:11:11,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:11:11,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:11:11,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:11:11,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:11:11,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:11:11,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:11:11,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:11:11,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:11:11,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:11:11,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:11:11,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:11:11,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:11:11,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:11:11,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:11:11,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:11:11,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:11:11,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:11:11,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:11:11,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:11:11,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:11:11,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:11:11,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:11:11,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:11:11,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:11:11,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:11:11,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:11:11,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:11:11,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:11:11,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:11:11,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:11:11,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:11:11,294 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:11:11,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:11:11,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:11:11,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:11:11,295 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:11:11,295 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:11:11,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:11:11,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:11:11,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:11:11,298 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:11:11,298 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:11:11,298 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:11:11,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:11:11,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:11:11,298 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:11:11,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:11:11,299 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:11:11,299 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:11:11,299 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:11:11,300 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8044e0aeebe72762497fc5ccaff76a34eb4c9821 [2018-11-10 11:11:11,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:11:11,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:11:11,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:11:11,337 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:11:11,337 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:11:11,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 11:11:11,382 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/data/b2afc6e01/4f465d7786ed4bc6a9ef544dac9d0f07/FLAG195c1b436 [2018-11-10 11:11:11,766 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:11:11,767 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 11:11:11,775 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/data/b2afc6e01/4f465d7786ed4bc6a9ef544dac9d0f07/FLAG195c1b436 [2018-11-10 11:11:11,786 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/data/b2afc6e01/4f465d7786ed4bc6a9ef544dac9d0f07 [2018-11-10 11:11:11,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:11:11,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:11:11,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:11:11,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:11:11,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:11:11,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:11:11" (1/1) ... [2018-11-10 11:11:11,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c04b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:11, skipping insertion in model container [2018-11-10 11:11:11,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:11:11" (1/1) ... [2018-11-10 11:11:11,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:11:11,835 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:11:11,972 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:11:11,976 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:11:12,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:11:12,023 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:11:12,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12 WrapperNode [2018-11-10 11:11:12,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:11:12,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:11:12,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:11:12,024 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:11:12,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:11:12,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:11:12,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:11:12,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:11:12,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... [2018-11-10 11:11:12,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:11:12,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:11:12,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:11:12,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:11:12,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/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 [2018-11-10 11:11:12,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:11:12,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:11:12,518 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:11:12,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:11:12 BoogieIcfgContainer [2018-11-10 11:11:12,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:11:12,519 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:11:12,519 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:11:12,521 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:11:12,522 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:11:12,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:11:11" (1/3) ... [2018-11-10 11:11:12,523 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63056c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:11:12, skipping insertion in model container [2018-11-10 11:11:12,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:11:12,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:11:12" (2/3) ... [2018-11-10 11:11:12,523 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63056c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:11:12, skipping insertion in model container [2018-11-10 11:11:12,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:11:12,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:11:12" (3/3) ... [2018-11-10 11:11:12,524 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 11:11:12,559 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:11:12,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:11:12,560 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:11:12,560 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:11:12,560 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:11:12,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:11:12,560 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:11:12,561 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:11:12,561 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:11:12,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-10 11:11:12,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-10 11:11:12,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:11:12,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:11:12,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:11:12,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:12,600 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:11:12,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-10 11:11:12,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2018-11-10 11:11:12,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:11:12,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:11:12,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:11:12,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:12,611 INFO L793 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 22#L209true assume !(~r1~0 == 0);init_~tmp~0 := 0; 20#L209-1true init_#res := init_~tmp~0; 75#L302true main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 63#L368-3true [2018-11-10 11:11:12,611 INFO L795 eck$LassoCheckResult]: Loop: 63#L368-3true assume true; 76#L368-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 31#L106true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 39#L110true assume !(node1_~m1~0 != ~nomsg~0); 35#L110-1true ~mode1~0 := 0; 7#L106-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 64#L134true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 48#L137true assume !(node2_~m2~0 != ~nomsg~0); 47#L137-1true ~mode2~0 := 0; 77#L134-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 69#L159true assume !(~mode3~0 % 256 != 0); 34#L172true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 32#L172-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 46#L159-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 58#L184true assume !(~mode4~0 % 256 != 0); 3#L197true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 16#L197-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 54#L184-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 6#L310true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 8#L310-1true check_#res := check_~tmp~1; 49#L330true main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28#L395true assume !(assert_~arg % 256 == 0); 73#L390true assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 63#L368-3true [2018-11-10 11:11:12,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 28826826, now seen corresponding path program 1 times [2018-11-10 11:11:12,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:12,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:12,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:12,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:11:12,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:11:12,769 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:11:12,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1743598418, now seen corresponding path program 1 times [2018-11-10 11:11:12,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:12,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:12,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:11:12,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:11:12,858 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:11:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:11:12,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:11:12,869 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2018-11-10 11:11:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:11:12,919 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2018-11-10 11:11:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:11:12,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 124 transitions. [2018-11-10 11:11:12,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 11:11:12,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 70 states and 95 transitions. [2018-11-10 11:11:12,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-10 11:11:12,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 11:11:12,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 95 transitions. [2018-11-10 11:11:12,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:11:12,930 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 11:11:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 95 transitions. [2018-11-10 11:11:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 11:11:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 11:11:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2018-11-10 11:11:12,952 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 11:11:12,952 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 95 transitions. [2018-11-10 11:11:12,952 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:11:12,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 95 transitions. [2018-11-10 11:11:12,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 11:11:12,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:11:12,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:11:12,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:12,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:12,956 INFO L793 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 182#L209 assume ~r1~0 == 0; 200#L210 assume ~id1~0 >= 0; 224#L211 assume ~st1~0 == 0; 179#L212 assume ~send1~0 == ~id1~0; 180#L213 assume ~mode1~0 % 256 == 0; 228#L214 assume ~id2~0 >= 0; 186#L215 assume ~st2~0 == 0; 187#L216 assume ~send2~0 == ~id2~0; 217#L217 assume ~mode2~0 % 256 == 0; 232#L218 assume ~id3~0 >= 0; 169#L219 assume ~st3~0 == 0; 170#L220 assume ~send3~0 == ~id3~0; 201#L221 assume ~mode3~0 % 256 == 0; 226#L222 assume ~id4~0 >= 0; 207#L223 assume ~st4~0 == 0; 208#L224 assume ~send4~0 == ~id4~0; 229#L225 assume ~mode4~0 % 256 == 0; 188#L226 assume ~id1~0 != ~id2~0; 189#L227 assume ~id1~0 != ~id3~0; 218#L228 assume ~id1~0 != ~id4~0; 233#L229 assume ~id2~0 != ~id3~0; 171#L230 assume ~id2~0 != ~id4~0; 172#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 194#L209-1 init_#res := init_~tmp~0; 195#L302 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 234#L368-3 [2018-11-10 11:11:12,956 INFO L795 eck$LassoCheckResult]: Loop: 234#L368-3 assume true; 235#L368-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 211#L106 assume !(~mode1~0 % 256 != 0); 212#L122 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 220#L122-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 176#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 177#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 227#L137 assume !(node2_~m2~0 != ~nomsg~0); 184#L137-1 ~mode2~0 := 0; 199#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 236#L159 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 230#L162 assume !(node3_~m3~0 != ~nomsg~0); 222#L162-1 ~mode3~0 := 0; 210#L159-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 225#L184 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 196#L187 assume !(node4_~m4~0 != ~nomsg~0); 193#L187-1 ~mode4~0 := 0; 190#L184-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 173#L310 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 175#L310-1 check_#res := check_~tmp~1; 178#L330 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 204#L395 assume !(assert_~arg % 256 == 0); 205#L390 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 234#L368-3 [2018-11-10 11:11:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 1 times [2018-11-10 11:11:12,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1752210980, now seen corresponding path program 1 times [2018-11-10 11:11:13,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:11:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:11:13,065 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:11:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:11:13,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:11:13,066 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-11-10 11:11:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:11:13,116 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2018-11-10 11:11:13,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:11:13,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 97 transitions. [2018-11-10 11:11:13,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 11:11:13,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 92 transitions. [2018-11-10 11:11:13,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-10 11:11:13,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 11:11:13,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 92 transitions. [2018-11-10 11:11:13,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:11:13,121 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 11:11:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 92 transitions. [2018-11-10 11:11:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 11:11:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 11:11:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2018-11-10 11:11:13,126 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 11:11:13,126 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-10 11:11:13,126 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:11:13,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 92 transitions. [2018-11-10 11:11:13,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 11:11:13,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:11:13,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:11:13,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:13,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:13,130 INFO L793 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 337#L209 assume ~r1~0 == 0; 355#L210 assume ~id1~0 >= 0; 379#L211 assume ~st1~0 == 0; 334#L212 assume ~send1~0 == ~id1~0; 335#L213 assume ~mode1~0 % 256 == 0; 383#L214 assume ~id2~0 >= 0; 341#L215 assume ~st2~0 == 0; 342#L216 assume ~send2~0 == ~id2~0; 372#L217 assume ~mode2~0 % 256 == 0; 387#L218 assume ~id3~0 >= 0; 324#L219 assume ~st3~0 == 0; 325#L220 assume ~send3~0 == ~id3~0; 356#L221 assume ~mode3~0 % 256 == 0; 380#L222 assume ~id4~0 >= 0; 362#L223 assume ~st4~0 == 0; 363#L224 assume ~send4~0 == ~id4~0; 384#L225 assume ~mode4~0 % 256 == 0; 343#L226 assume ~id1~0 != ~id2~0; 344#L227 assume ~id1~0 != ~id3~0; 373#L228 assume ~id1~0 != ~id4~0; 388#L229 assume ~id2~0 != ~id3~0; 326#L230 assume ~id2~0 != ~id4~0; 327#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 349#L209-1 init_#res := init_~tmp~0; 350#L302 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 389#L368-3 [2018-11-10 11:11:13,131 INFO L795 eck$LassoCheckResult]: Loop: 389#L368-3 assume true; 390#L368-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 364#L106 assume !(~mode1~0 % 256 != 0); 365#L122 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 375#L122-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 330#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 331#L134 assume !(~mode2~0 % 256 != 0); 361#L147 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 353#L147-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 354#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 391#L159 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 385#L162 assume !(node3_~m3~0 != ~nomsg~0); 377#L162-1 ~mode3~0 := 0; 368#L159-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 381#L184 assume !(~mode4~0 % 256 != 0); 322#L197 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 323#L197-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 345#L184-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 328#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 329#L311 assume ~r1~0 >= 4; 347#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 332#L310-1 check_#res := check_~tmp~1; 333#L330 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 359#L395 assume !(assert_~arg % 256 == 0); 360#L390 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 389#L368-3 [2018-11-10 11:11:13,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 2 times [2018-11-10 11:11:13,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:13,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1785215064, now seen corresponding path program 1 times [2018-11-10 11:11:13,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:11:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:13,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:11:13,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:11:13,187 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:11:13,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:11:13,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:11:13,188 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. cyclomatic complexity: 23 Second operand 3 states. [2018-11-10 11:11:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:11:13,205 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2018-11-10 11:11:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:11:13,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2018-11-10 11:11:13,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 11:11:13,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2018-11-10 11:11:13,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2018-11-10 11:11:13,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2018-11-10 11:11:13,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2018-11-10 11:11:13,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:11:13,208 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 11:11:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2018-11-10 11:11:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-10 11:11:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 11:11:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2018-11-10 11:11:13,212 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 11:11:13,212 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2018-11-10 11:11:13,213 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:11:13,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2018-11-10 11:11:13,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 11:11:13,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:11:13,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:11:13,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:13,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:11:13,215 INFO L793 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 519#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet4;havoc main_#t~nondet4;~id1~0 := main_#t~nondet5;havoc main_#t~nondet5;~st1~0 := main_#t~nondet6;havoc main_#t~nondet6;~send1~0 := main_#t~nondet7;havoc main_#t~nondet7;~mode1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id2~0 := main_#t~nondet9;havoc main_#t~nondet9;~st2~0 := main_#t~nondet10;havoc main_#t~nondet10;~send2~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode2~0 := main_#t~nondet12;havoc main_#t~nondet12;~id3~0 := main_#t~nondet13;havoc main_#t~nondet13;~st3~0 := main_#t~nondet14;havoc main_#t~nondet14;~send3~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode3~0 := main_#t~nondet16;havoc main_#t~nondet16;~id4~0 := main_#t~nondet17;havoc main_#t~nondet17;~st4~0 := main_#t~nondet18;havoc main_#t~nondet18;~send4~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode4~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 520#L209 assume ~r1~0 == 0; 536#L210 assume ~id1~0 >= 0; 564#L211 assume ~st1~0 == 0; 517#L212 assume ~send1~0 == ~id1~0; 518#L213 assume ~mode1~0 % 256 == 0; 568#L214 assume ~id2~0 >= 0; 524#L215 assume ~st2~0 == 0; 525#L216 assume ~send2~0 == ~id2~0; 556#L217 assume ~mode2~0 % 256 == 0; 572#L218 assume ~id3~0 >= 0; 507#L219 assume ~st3~0 == 0; 508#L220 assume ~send3~0 == ~id3~0; 539#L221 assume ~mode3~0 % 256 == 0; 565#L222 assume ~id4~0 >= 0; 546#L223 assume ~st4~0 == 0; 547#L224 assume ~send4~0 == ~id4~0; 569#L225 assume ~mode4~0 % 256 == 0; 526#L226 assume ~id1~0 != ~id2~0; 527#L227 assume ~id1~0 != ~id3~0; 558#L228 assume ~id1~0 != ~id4~0; 573#L229 assume ~id2~0 != ~id3~0; 509#L230 assume ~id2~0 != ~id4~0; 510#L231 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 532#L209-1 init_#res := init_~tmp~0; 533#L302 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 577#L368-3 [2018-11-10 11:11:13,215 INFO L795 eck$LassoCheckResult]: Loop: 577#L368-3 assume true; 607#L368-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 606#L106 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 550#L110 assume !(node1_~m1~0 != ~nomsg~0); 542#L110-1 ~mode1~0 := 0; 555#L106-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 602#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 601#L137 assume !(node2_~m2~0 != ~nomsg~0); 598#L137-1 ~mode2~0 := 0; 596#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 595#L159 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 593#L162 assume !(node3_~m3~0 != ~nomsg~0); 589#L162-1 ~mode3~0 := 0; 588#L159-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 587#L184 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 585#L187 assume !(node4_~m4~0 != ~nomsg~0); 581#L187-1 ~mode4~0 := 0; 580#L184-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 579#L310 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 578#L311 assume !(~r1~0 >= 4); 529#L314 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 530#L315 assume ~r1~0 < 4;check_~tmp~1 := 1; 611#L310-1 check_#res := check_~tmp~1; 610#L330 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 609#L395 assume !(assert_~arg % 256 == 0); 608#L390 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 577#L368-3 [2018-11-10 11:11:13,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash 370924325, now seen corresponding path program 3 times [2018-11-10 11:11:13,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -294620476, now seen corresponding path program 1 times [2018-11-10 11:11:13,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:11:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:11:13,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1316558616, now seen corresponding path program 1 times [2018-11-10 11:11:13,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:11:13,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:11:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:11:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:11:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:13,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:11:13,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:11:13,757 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2018-11-10 11:11:14,184 WARN L179 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-11-10 11:11:14,191 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:11:14,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:11:14,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:11:14,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:11:14,193 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:11:14,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:11:14,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:11:14,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:11:14,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-10 11:11:14,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:11:14,194 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:11:14,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,716 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:11:14,717 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:11:14,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:11:14,721 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1582c2d-cf1b-4461-ae2a-821229cba252/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:11:14,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:11:14,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:11:14,927 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:11:14,928 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:11:14,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:11:14,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:11:14,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:11:14,928 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:11:14,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:11:14,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:11:14,929 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:11:14,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_false-unreach-call.1.ufo.BOUNDED-8.pals_true-termination.c_Iteration4_Loop [2018-11-10 11:11:14,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:11:14,929 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:11:14,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:14,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:11:15,373 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:11:15,376 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:11:15,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,408 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:11:15,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:11:15,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:11:15,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:11:15,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:11:15,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:11:15,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:11:15,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:11:15,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:11:15,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:11:15,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:11:15,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:11:15,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:11:15,465 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:11:15,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:11:15,467 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 11:11:15,469 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:11:15,469 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:11:15,469 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:11:15,470 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-10 11:11:15,471 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:11:15,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:11:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:15,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:11:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:11:15,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:11:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:11:15,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:11:15,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand 4 states. [2018-11-10 11:11:15,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 186 states and 265 transitions. Complement of second has 6 states. [2018-11-10 11:11:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:11:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:11:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-10 11:11:15,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 27 letters. Loop has 26 letters. [2018-11-10 11:11:15,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:11:15,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 53 letters. Loop has 26 letters. [2018-11-10 11:11:15,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:11:15,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 27 letters. Loop has 52 letters. [2018-11-10 11:11:15,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:11:15,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 265 transitions. [2018-11-10 11:11:15,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:11:15,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 0 states and 0 transitions. [2018-11-10 11:11:15,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:11:15,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:11:15,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:11:15,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:11:15,600 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:11:15,600 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:11:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:11:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:11:15,602 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 11:11:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:11:15,602 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 11:11:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:11:15,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 11:11:15,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:11:15,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:11:15,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:11:15,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:11:15,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:11:15,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:11:15,603 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:11:15,603 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:11:15,603 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:11:15,603 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:11:15,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:11:15,603 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:11:15,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:11:15,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:11:15 BoogieIcfgContainer [2018-11-10 11:11:15,609 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:11:15,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:11:15,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:11:15,610 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:11:15,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:11:12" (3/4) ... [2018-11-10 11:11:15,613 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:11:15,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:11:15,614 INFO L168 Benchmark]: Toolchain (without parser) took 3824.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 959.2 MB in the beginning and 922.1 MB in the end (delta: 37.0 MB). Peak memory consumption was 274.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,615 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:11:15,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,616 INFO L168 Benchmark]: Boogie Preprocessor took 70.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -236.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,617 INFO L168 Benchmark]: RCFGBuilder took 389.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,617 INFO L168 Benchmark]: BuchiAutomizer took 3090.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 219.8 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:11:15,617 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 1.3 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:11:15,620 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -236.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3090.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 219.8 MB). Peak memory consumption was 275.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.82 ms. Allocated memory is still 1.3 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 443 SDtfs, 146 SDslu, 636 SDs, 0 SdLazy, 32 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax118 hnf104 lsp17 ukn86 mio100 lsp100 div132 bol100 ite100 ukn100 eq172 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...