./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.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_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/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 6191f76ca1968cb0b63f42b60887059af617e3ab .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:43:28,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:43:28,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:43:28,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:43:28,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:43:28,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:43:28,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:43:28,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:43:28,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:43:28,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:43:28,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:43:28,503 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:43:28,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:43:28,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:43:28,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:43:28,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:43:28,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:43:28,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:43:28,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:43:28,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:43:28,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:43:28,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:43:28,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:43:28,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:43:28,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:43:28,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:43:28,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:43:28,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:43:28,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:43:28,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:43:28,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:43:28,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:43:28,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:43:28,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:43:28,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:43:28,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:43:28,519 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:43:28,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:43:28,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:43:28,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:43:28,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:43:28,529 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:43:28,529 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:43:28,529 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:43:28,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:43:28,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:43:28,531 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:43:28,532 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:43:28,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:43:28,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:43:28,532 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:43:28,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:43:28,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:43:28,532 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:43:28,533 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:43:28,533 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_7b9ad444-4048-4e41-8993-c13782834f60/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 -> 6191f76ca1968cb0b63f42b60887059af617e3ab [2018-11-10 07:43:28,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:43:28,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:43:28,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:43:28,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:43:28,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:43:28,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 07:43:28,616 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/data/085a42a35/886db8094a8b4e00af1be5ee2325bca7/FLAG919f44c2a [2018-11-10 07:43:28,973 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:43:28,973 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 07:43:28,981 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/data/085a42a35/886db8094a8b4e00af1be5ee2325bca7/FLAG919f44c2a [2018-11-10 07:43:28,993 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/bin-2019/uautomizer/data/085a42a35/886db8094a8b4e00af1be5ee2325bca7 [2018-11-10 07:43:28,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:43:28,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:43:28,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:43:28,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:43:29,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:43:29,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:43:28" (1/1) ... [2018-11-10 07:43:29,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a654587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29, skipping insertion in model container [2018-11-10 07:43:29,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:43:28" (1/1) ... [2018-11-10 07:43:29,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:43:29,040 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:43:29,201 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:43:29,208 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:43:29,243 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:43:29,254 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:43:29,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29 WrapperNode [2018-11-10 07:43:29,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:43:29,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:43:29,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:43:29,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:43:29,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:43:29,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:43:29,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:43:29,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:43:29,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... [2018-11-10 07:43:29,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:43:29,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:43:29,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:43:29,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:43:29,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/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 07:43:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:43:29,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:43:29,768 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:43:29,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:29 BoogieIcfgContainer [2018-11-10 07:43:29,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:43:29,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:43:29,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:43:29,772 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:43:29,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:29,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:43:28" (1/3) ... [2018-11-10 07:43:29,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4693776b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:43:29, skipping insertion in model container [2018-11-10 07:43:29,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:29,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:29" (2/3) ... [2018-11-10 07:43:29,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4693776b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:43:29, skipping insertion in model container [2018-11-10 07:43:29,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:29,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:29" (3/3) ... [2018-11-10 07:43:29,776 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 07:43:29,815 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:43:29,815 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:43:29,815 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:43:29,815 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:43:29,815 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:43:29,815 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:43:29,815 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:43:29,815 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:43:29,815 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:43:29,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-10 07:43:29,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 07:43:29,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:29,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:29,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:43:29,848 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, 1] [2018-11-10 07:43:29,848 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:43:29,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states. [2018-11-10 07:43:29,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 07:43:29,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:29,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:29,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 07:43:29,851 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, 1] [2018-11-10 07:43:29,856 INFO L793 eck$LassoCheckResult]: Stem: 45#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~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;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 33#L242true assume !(~r1~0 == 0);init_~tmp~0 := 0; 31#L242-1true init_#res := init_~tmp~0; 77#L367true main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 15#L439-3true [2018-11-10 07:43:29,857 INFO L795 eck$LassoCheckResult]: Loop: 15#L439-3true assume true; 34#L439-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L113true assume !(~mode1~0 % 256 != 0); 72#L129true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 68#L129-2true ~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; 3#L113-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; 90#L141true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 60#L144true assume !(node2_~m2~0 != ~nomsg~0); 56#L144-1true ~mode2~0 := 0; 87#L141-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; 62#L166true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 41#L169true assume !(node3_~m3~0 != ~nomsg~0); 37#L169-1true ~mode3~0 := 0; 78#L166-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; 69#L191true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 50#L194true assume !(node4_~m4~0 != ~nomsg~0); 49#L194-1true ~mode4~0 := 0; 36#L191-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 52#L216true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 5#L219true assume !(node5_~m5~0 != ~nomsg~0); 4#L219-1true ~mode5~0 := 0; 48#L216-2true assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 83#L375true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 84#L375-1true check_#res := check_~tmp~1; 39#L395true main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;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; 65#L469true assume !(assert_~arg % 256 == 0); 26#L464true assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 15#L439-3true [2018-11-10 07:43:29,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2018-11-10 07:43:29,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:29,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:29,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:29,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:29,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:29,986 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 07:43:29,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:29,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:43:29,991 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:29,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:29,991 INFO L82 PathProgramCache]: Analyzing trace with hash -593397871, now seen corresponding path program 1 times [2018-11-10 07:43:29,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:29,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:30,090 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 07:43:30,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:30,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:43:30,092 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:43:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:43:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:43:30,105 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-11-10 07:43:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:30,172 INFO L93 Difference]: Finished difference Result 93 states and 153 transitions. [2018-11-10 07:43:30,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:43:30,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 153 transitions. [2018-11-10 07:43:30,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 07:43:30,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 86 states and 116 transitions. [2018-11-10 07:43:30,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 07:43:30,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 07:43:30,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 116 transitions. [2018-11-10 07:43:30,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:30,184 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 07:43:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 116 transitions. [2018-11-10 07:43:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 07:43:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 07:43:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2018-11-10 07:43:30,209 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 07:43:30,209 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 116 transitions. [2018-11-10 07:43:30,209 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:43:30,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 116 transitions. [2018-11-10 07:43:30,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 07:43:30,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:30,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:30,212 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:30,212 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, 1] [2018-11-10 07:43:30,213 INFO L793 eck$LassoCheckResult]: Stem: 259#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~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;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 222#L242 assume ~r1~0 == 0; 247#L243 assume ~id1~0 >= 0; 276#L244 assume ~st1~0 == 0; 257#L245 assume ~send1~0 == ~id1~0; 258#L246 assume ~mode1~0 % 256 == 0; 280#L247 assume ~id2~0 >= 0; 232#L248 assume ~st2~0 == 0; 233#L249 assume ~send2~0 == ~id2~0; 268#L250 assume ~mode2~0 % 256 == 0; 271#L251 assume ~id3~0 >= 0; 213#L252 assume ~st3~0 == 0; 214#L253 assume ~send3~0 == ~id3~0; 249#L254 assume ~mode3~0 % 256 == 0; 223#L255 assume ~id4~0 >= 0; 224#L256 assume ~st4~0 == 0; 260#L257 assume ~send4~0 == ~id4~0; 281#L258 assume ~mode4~0 % 256 == 0; 235#L259 assume ~id5~0 >= 0; 236#L260 assume ~st5~0 == 0; 269#L261 assume ~send5~0 == ~id5~0; 272#L262 assume ~mode5~0 % 256 == 0; 215#L263 assume ~id1~0 != ~id2~0; 216#L264 assume ~id1~0 != ~id3~0; 250#L265 assume ~id1~0 != ~id4~0; 225#L266 assume ~id1~0 != ~id5~0; 226#L267 assume ~id2~0 != ~id3~0; 261#L268 assume ~id2~0 != ~id4~0; 282#L269 assume ~id2~0 != ~id5~0; 237#L270 assume ~id3~0 != ~id4~0; 238#L271 assume ~id3~0 != ~id5~0; 239#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 244#L242-1 init_#res := init_~tmp~0; 245#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 219#L439-3 [2018-11-10 07:43:30,213 INFO L795 eck$LassoCheckResult]: Loop: 219#L439-3 assume true; 220#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 208#L113 assume !(~mode1~0 % 256 != 0); 209#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 278#L129-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; 199#L113-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; 200#L141 assume !(~mode2~0 % 256 != 0); 240#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 241#L154-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; 265#L141-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; 275#L166 assume !(~mode3~0 % 256 != 0); 217#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 211#L179-2 ~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; 212#L166-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; 279#L191 assume !(~mode4~0 % 256 != 0); 229#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 227#L204-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; 228#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 248#L216 assume !(~mode5~0 % 256 != 0); 266#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 284#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 202#L216-2 assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 262#L375 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 230#L375-1 check_#res := check_~tmp~1; 252#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;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; 253#L469 assume !(assert_~arg % 256 == 0); 234#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 219#L439-3 [2018-11-10 07:43:30,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2018-11-10 07:43:30,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1723032425, now seen corresponding path program 1 times [2018-11-10 07:43:30,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:30,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:30,347 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 07:43:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:43:30,348 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:43:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:43:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:43:30,349 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-10 07:43:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:30,402 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2018-11-10 07:43:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:43:30,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 118 transitions. [2018-11-10 07:43:30,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 07:43:30,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 113 transitions. [2018-11-10 07:43:30,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 07:43:30,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 07:43:30,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2018-11-10 07:43:30,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:30,406 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 07:43:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2018-11-10 07:43:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 07:43:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 07:43:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2018-11-10 07:43:30,409 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 07:43:30,410 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-10 07:43:30,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:43:30,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 113 transitions. [2018-11-10 07:43:30,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 07:43:30,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:30,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:30,412 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:30,412 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, 1, 1, 1] [2018-11-10 07:43:30,413 INFO L793 eck$LassoCheckResult]: Stem: 446#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~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;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 407#L242 assume ~r1~0 == 0; 434#L243 assume ~id1~0 >= 0; 463#L244 assume ~st1~0 == 0; 443#L245 assume ~send1~0 == ~id1~0; 444#L246 assume ~mode1~0 % 256 == 0; 467#L247 assume ~id2~0 >= 0; 419#L248 assume ~st2~0 == 0; 420#L249 assume ~send2~0 == ~id2~0; 454#L250 assume ~mode2~0 % 256 == 0; 458#L251 assume ~id3~0 >= 0; 400#L252 assume ~st3~0 == 0; 401#L253 assume ~send3~0 == ~id3~0; 435#L254 assume ~mode3~0 % 256 == 0; 408#L255 assume ~id4~0 >= 0; 409#L256 assume ~st4~0 == 0; 447#L257 assume ~send4~0 == ~id4~0; 468#L258 assume ~mode4~0 % 256 == 0; 422#L259 assume ~id5~0 >= 0; 423#L260 assume ~st5~0 == 0; 456#L261 assume ~send5~0 == ~id5~0; 459#L262 assume ~mode5~0 % 256 == 0; 402#L263 assume ~id1~0 != ~id2~0; 403#L264 assume ~id1~0 != ~id3~0; 437#L265 assume ~id1~0 != ~id4~0; 412#L266 assume ~id1~0 != ~id5~0; 413#L267 assume ~id2~0 != ~id3~0; 448#L268 assume ~id2~0 != ~id4~0; 469#L269 assume ~id2~0 != ~id5~0; 424#L270 assume ~id3~0 != ~id4~0; 425#L271 assume ~id3~0 != ~id5~0; 426#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 431#L242-1 init_#res := init_~tmp~0; 432#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 410#L439-3 [2018-11-10 07:43:30,413 INFO L795 eck$LassoCheckResult]: Loop: 410#L439-3 assume true; 411#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 395#L113 assume !(~mode1~0 % 256 != 0); 396#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 465#L129-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; 386#L113-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; 387#L141 assume !(~mode2~0 % 256 != 0); 427#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 428#L154-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; 452#L141-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; 462#L166 assume !(~mode3~0 % 256 != 0); 404#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 398#L179-2 ~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; 399#L166-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; 466#L191 assume !(~mode4~0 % 256 != 0); 416#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 414#L204-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; 415#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 436#L216 assume !(~mode5~0 % 256 != 0); 453#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 471#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 389#L216-2 assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 449#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 392#L376 assume ~r1~0 >= 5; 393#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 417#L375-1 check_#res := check_~tmp~1; 439#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;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; 440#L469 assume !(assert_~arg % 256 == 0); 421#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 410#L439-3 [2018-11-10 07:43:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2018-11-10 07:43:30,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash 855932633, now seen corresponding path program 1 times [2018-11-10 07:43:30,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:30,476 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 07:43:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:30,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:43:30,477 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:43:30,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:43:30,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:43:30,477 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-10 07:43:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:30,501 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2018-11-10 07:43:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:43:30,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2018-11-10 07:43:30,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-10 07:43:30,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2018-11-10 07:43:30,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 07:43:30,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2018-11-10 07:43:30,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2018-11-10 07:43:30,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:30,505 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 07:43:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2018-11-10 07:43:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 07:43:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 07:43:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2018-11-10 07:43:30,511 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 07:43:30,511 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2018-11-10 07:43:30,511 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:43:30,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2018-11-10 07:43:30,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2018-11-10 07:43:30,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:30,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:30,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:30,514 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, 1, 1, 1, 1] [2018-11-10 07:43:30,514 INFO L793 eck$LassoCheckResult]: Stem: 669#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;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~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;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 632#L242 assume ~r1~0 == 0; 656#L243 assume ~id1~0 >= 0; 686#L244 assume ~st1~0 == 0; 667#L245 assume ~send1~0 == ~id1~0; 668#L246 assume ~mode1~0 % 256 == 0; 690#L247 assume ~id2~0 >= 0; 641#L248 assume ~st2~0 == 0; 642#L249 assume ~send2~0 == ~id2~0; 678#L250 assume ~mode2~0 % 256 == 0; 681#L251 assume ~id3~0 >= 0; 622#L252 assume ~st3~0 == 0; 623#L253 assume ~send3~0 == ~id3~0; 658#L254 assume ~mode3~0 % 256 == 0; 633#L255 assume ~id4~0 >= 0; 634#L256 assume ~st4~0 == 0; 670#L257 assume ~send4~0 == ~id4~0; 691#L258 assume ~mode4~0 % 256 == 0; 644#L259 assume ~id5~0 >= 0; 645#L260 assume ~st5~0 == 0; 679#L261 assume ~send5~0 == ~id5~0; 682#L262 assume ~mode5~0 % 256 == 0; 624#L263 assume ~id1~0 != ~id2~0; 625#L264 assume ~id1~0 != ~id3~0; 662#L265 assume ~id1~0 != ~id4~0; 637#L266 assume ~id1~0 != ~id5~0; 638#L267 assume ~id2~0 != ~id3~0; 671#L268 assume ~id2~0 != ~id4~0; 692#L269 assume ~id2~0 != ~id5~0; 646#L270 assume ~id3~0 != ~id4~0; 647#L271 assume ~id3~0 != ~id5~0; 648#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 653#L242-1 init_#res := init_~tmp~0; 654#L367 main_#t~ret26 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 694#L439-3 [2018-11-10 07:43:30,514 INFO L795 eck$LassoCheckResult]: Loop: 694#L439-3 assume true; 735#L439-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 734#L113 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 619#L117 assume !(node1_~m1~0 != ~nomsg~0); 627#L117-1 ~mode1~0 := 0; 628#L113-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; 731#L141 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 729#L144 assume !(node2_~m2~0 != ~nomsg~0); 726#L144-1 ~mode2~0 := 0; 724#L141-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; 723#L166 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 722#L169 assume !(node3_~m3~0 != ~nomsg~0); 717#L169-1 ~mode3~0 := 0; 716#L166-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; 715#L191 assume !(~mode4~0 % 256 != 0); 711#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 710#L204-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; 708#L191-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 707#L216 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 704#L219 assume !(node5_~m5~0 != ~nomsg~0); 701#L219-1 ~mode5~0 := 0; 700#L216-2 assume { :end_inline_node5 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 699#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 698#L376 assume !(~r1~0 >= 5); 696#L379 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 == 0; 697#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 739#L375-1 check_#res := check_~tmp~1; 738#L395 main_#t~ret27 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;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; 737#L469 assume !(assert_~arg % 256 == 0); 736#L464 assume { :end_inline_assert } true;main_#t~post28 := main_~i2~0;main_~i2~0 := main_#t~post28 + 1;havoc main_#t~post28; 694#L439-3 [2018-11-10 07:43:30,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2018-11-10 07:43:30,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash -953350166, now seen corresponding path program 1 times [2018-11-10 07:43:30,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:30,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 88718362, now seen corresponding path program 1 times [2018-11-10 07:43:30,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:30,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:30,614 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 07:43:30,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:30,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:43:31,019 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 143 [2018-11-10 07:43:31,852 WARN L179 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2018-11-10 07:43:31,859 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:43:31,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:43:31,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:43:31,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:43:31,860 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 07:43:31,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:43:31,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:43:31,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:43:31,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 07:43:31,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:43:31,861 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:43:31,893 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 07:43:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:31,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:31,909 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 07:43:31,929 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 07:43:31,932 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 07:43:31,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 07:43:31,935 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 07:43:31,936 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 07:43:31,939 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 07:43:31,940 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 07:43:31,941 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 07:43:31,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 07:43:31,945 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 07:43:31,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 07:43:31,949 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 07:43:31,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 07:43:31,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 07:43:31,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 07:43:31,954 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 07:43:31,958 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 07:43:31,960 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 07:43:32,029 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 07:43:32,032 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 07:43:32,035 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 07:43:32,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 07:43:32,038 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 07:43:32,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 07:43:33,127 WARN L179 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-10 07:43:33,152 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:43:33,153 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/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 07:43:33,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 07:43:33,158 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b9ad444-4048-4e41-8993-c13782834f60/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 07:43:33,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 07:43:33,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 07:43:33,286 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 07:43:33,288 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:43:33,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:43:33,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:43:33,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:43:33,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:43:33,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:43:33,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:43:33,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:43:33,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 07:43:33,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:43:33,289 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:43:33,296 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 07:43:33,307 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 07:43:33,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 07:43:33,310 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 07:43:33,342 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 07:43:33,344 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 07:43:33,347 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 07:43:33,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,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 07:43:33,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,353 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 07:43:33,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 07:43:33,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,360 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 07:43:33,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,367 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 07:43:33,369 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 07:43:33,371 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 07:43:33,373 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 07:43:33,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:33,375 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 07:43:33,436 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 07:43:33,439 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 07:43:33,447 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 07:43:33,449 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 07:43:33,450 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 07:43:33,657 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 07:43:34,480 WARN L179 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-10 07:43:34,499 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:43:34,503 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:43:34,504 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 07:43:34,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:34,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,513 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 07:43:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:34,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:34,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,519 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 07:43:34,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,520 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:43:34,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:43:34,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,524 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 07:43:34,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:34,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:34,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:34,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,537 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 07:43:34,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:34,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:34,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,541 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 07:43:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:34,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,549 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 07:43:34,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:34,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:34,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,553 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 07:43:34,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:34,555 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 07:43:34,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:34,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:34,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:34,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:34,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:34,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:34,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:34,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:43:34,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:43:34,561 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:43:34,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:43:34,562 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 07:43:34,563 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:43:34,563 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-10 07:43:34,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 07:43:34,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:34,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:34,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:34,668 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 07:43:34,672 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 07:43:34,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 4 states. [2018-11-10 07:43:34,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 4 states. Result 226 states and 325 transitions. Complement of second has 6 states. [2018-11-10 07:43:34,712 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 07:43:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:43:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-10 07:43:34,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 30 letters. [2018-11-10 07:43:34,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:34,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 65 letters. Loop has 30 letters. [2018-11-10 07:43:34,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:34,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 35 letters. Loop has 60 letters. [2018-11-10 07:43:34,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:34,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 325 transitions. [2018-11-10 07:43:34,718 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:43:34,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 0 states and 0 transitions. [2018-11-10 07:43:34,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:43:34,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:43:34,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:43:34,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:34,720 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:34,720 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:43:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:43:34,720 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 07:43:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:34,720 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:43:34,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:43:34,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:43:34,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:43:34,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:34,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:34,721 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:43:34,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:43:34,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:43:34,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:43:34,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:43:34 BoogieIcfgContainer [2018-11-10 07:43:34,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:43:34,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:43:34,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:43:34,726 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:43:34,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:29" (3/4) ... [2018-11-10 07:43:34,729 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:43:34,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:43:34,729 INFO L168 Benchmark]: Toolchain (without parser) took 5733.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 960.8 MB in the beginning and 888.2 MB in the end (delta: 72.6 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:34,730 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:43:34,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.60 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:34,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:34,731 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:43:34,731 INFO L168 Benchmark]: RCFGBuilder took 413.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:34,731 INFO L168 Benchmark]: BuchiAutomizer took 4956.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 895.5 MB in the end (delta: 190.5 MB). Peak memory consumption was 269.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:34,732 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 888.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:43:34,734 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.60 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 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 73.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 413.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4956.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 895.5 MB in the end (delta: 190.5 MB). Peak memory consumption was 269.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 888.2 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 + 19 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 4.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 548 SDtfs, 180 SDslu, 783 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital650 mio100 ax109 hnf102 lsp15 ukn78 mio100 lsp100 div137 bol100 ite100 ukn100 eq188 hnf75 smp100 dnf707 smp49 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...