./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.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_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/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 a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:17:14,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:17:14,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:17:14,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:17:14,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:17:14,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:17:14,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:17:14,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:17:14,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:17:14,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:17:14,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:17:14,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:17:14,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:17:14,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:17:14,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:17:14,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:17:14,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:17:14,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:17:14,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:17:14,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:17:14,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:17:14,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:17:14,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:17:14,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:17:14,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:17:14,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:17:14,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:17:14,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:17:14,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:17:14,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:17:14,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:17:14,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:17:14,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:17:14,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:17:14,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:17:14,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:17:14,633 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:17:14,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:17:14,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:17:14,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:17:14,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:17:14,641 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:17:14,642 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:17:14,642 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:17:14,642 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:17:14,642 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:17:14,642 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:17:14,642 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:17:14,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:17:14,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:17:14,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:17:14,644 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:17:14,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:17:14,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:17:14,645 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:17:14,645 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:17:14,646 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_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/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 -> a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 [2018-11-10 12:17:14,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:17:14,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:17:14,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:17:14,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:17:14,682 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:17:14,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 12:17:14,728 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/data/296dca265/902cc3f2c39b4b1295d815002fa7c9e2/FLAG7b5d08ca8 [2018-11-10 12:17:15,081 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:17:15,081 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 12:17:15,088 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/data/296dca265/902cc3f2c39b4b1295d815002fa7c9e2/FLAG7b5d08ca8 [2018-11-10 12:17:15,098 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/bin-2019/uautomizer/data/296dca265/902cc3f2c39b4b1295d815002fa7c9e2 [2018-11-10 12:17:15,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:17:15,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:17:15,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:17:15,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:17:15,104 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:17:15,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abbe121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15, skipping insertion in model container [2018-11-10 12:17:15,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:17:15,133 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:17:15,264 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:17:15,270 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:17:15,297 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:17:15,309 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:17:15,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15 WrapperNode [2018-11-10 12:17:15,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:17:15,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:17:15,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:17:15,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:17:15,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:17:15,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:17:15,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:17:15,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:17:15,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... [2018-11-10 12:17:15,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:17:15,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:17:15,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:17:15,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:17:15,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/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 12:17:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:17:15,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:17:15,718 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:17:15,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:17:15 BoogieIcfgContainer [2018-11-10 12:17:15,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:17:15,719 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:17:15,719 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:17:15,721 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:17:15,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:17:15,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:17:15" (1/3) ... [2018-11-10 12:17:15,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4300c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:17:15, skipping insertion in model container [2018-11-10 12:17:15,723 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:17:15,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:17:15" (2/3) ... [2018-11-10 12:17:15,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4300c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:17:15, skipping insertion in model container [2018-11-10 12:17:15,723 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:17:15,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:17:15" (3/3) ... [2018-11-10 12:17:15,724 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 12:17:15,754 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:17:15,755 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:17:15,755 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:17:15,755 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:17:15,755 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:17:15,755 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:17:15,755 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:17:15,755 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:17:15,755 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:17:15,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-10 12:17:15,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 12:17:15,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:15,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:15,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:17:15,785 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] [2018-11-10 12:17:15,785 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:17:15,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. [2018-11-10 12:17:15,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 12:17:15,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:15,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:15,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:17:15,789 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] [2018-11-10 12:17:15,796 INFO L793 eck$LassoCheckResult]: Stem: 34#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;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 3#L175true assume !(~r1~0 == 0);init_~tmp~0 := 0; 22#L175-1true init_#res := init_~tmp~0; 54#L240true main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 12#L300-3true [2018-11-10 12:17:15,797 INFO L795 eck$LassoCheckResult]: Loop: 12#L300-3true assume true; 36#L300-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 41#L99true assume !(~mode1~0 % 256 != 0); 6#L113true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 4#L113-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; 38#L99-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; 30#L125true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 35#L128true assume !(node2_~m2~0 != ~nomsg~0); 33#L128-1true ~mode2~0 := 0; 27#L125-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; 37#L150true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 23#L153true assume !(node3_~m3~0 != ~nomsg~0); 19#L153-1true ~mode3~0 := 0; 13#L150-2true assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 20#L248true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 18#L248-1true check_#res := check_~tmp~1; 51#L268true main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;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; 53#L324true assume !(assert_~arg % 256 == 0); 47#L319true assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 12#L300-3true [2018-11-10 12:17:15,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2018-11-10 12:17:15,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:15,923 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 12:17:15,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:17:15,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:17:15,928 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:17:15,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash -665068755, now seen corresponding path program 1 times [2018-11-10 12:17:15,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:15,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:15,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:15,997 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 12:17:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:17:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:17:15,999 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:17:16,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:17:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:17:16,015 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2018-11-10 12:17:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:17:16,075 INFO L93 Difference]: Finished difference Result 62 states and 97 transitions. [2018-11-10 12:17:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:17:16,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 97 transitions. [2018-11-10 12:17:16,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 12:17:16,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 75 transitions. [2018-11-10 12:17:16,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 12:17:16,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-10 12:17:16,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2018-11-10 12:17:16,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:16,085 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-10 12:17:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2018-11-10 12:17:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 12:17:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:17:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2018-11-10 12:17:16,106 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-10 12:17:16,106 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2018-11-10 12:17:16,106 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:17:16,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2018-11-10 12:17:16,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 12:17:16,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:16,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:16,108 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] [2018-11-10 12:17:16,109 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] [2018-11-10 12:17:16,109 INFO L793 eck$LassoCheckResult]: Stem: 179#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;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 137#L175 assume ~r1~0 == 0; 138#L176 assume ~id1~0 >= 0; 167#L177 assume ~st1~0 == 0; 185#L178 assume ~send1~0 == ~id1~0; 149#L179 assume ~mode1~0 % 256 == 0; 150#L180 assume ~id2~0 >= 0; 177#L181 assume ~st2~0 == 0; 160#L182 assume ~send2~0 == ~id2~0; 161#L183 assume ~mode2~0 % 256 == 0; 183#L184 assume ~id3~0 >= 0; 190#L185 assume ~st3~0 == 0; 141#L186 assume ~send3~0 == ~id3~0; 142#L187 assume ~mode3~0 % 256 == 0; 168#L188 assume ~id1~0 != ~id2~0; 186#L189 assume ~id1~0 != ~id3~0; 151#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 152#L175-1 init_#res := init_~tmp~0; 164#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 153#L300-3 [2018-11-10 12:17:16,109 INFO L795 eck$LassoCheckResult]: Loop: 153#L300-3 assume true; 154#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 181#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 172#L103 assume !(node1_~m1~0 != ~nomsg~0); 171#L103-1 ~mode1~0 := 0; 140#L99-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; 175#L125 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 176#L128 assume !(node2_~m2~0 != ~nomsg~0); 178#L128-1 ~mode2~0 := 0; 169#L125-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; 170#L150 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 165#L153 assume !(node3_~m3~0 != ~nomsg~0); 148#L153-1 ~mode3~0 := 0; 155#L150-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 156#L248 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 145#L248-1 check_#res := check_~tmp~1; 162#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;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; 189#L324 assume !(assert_~arg % 256 == 0); 188#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 153#L300-3 [2018-11-10 12:17:16,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2018-11-10 12:17:16,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 929215927, now seen corresponding path program 1 times [2018-11-10 12:17:16,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:16,213 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 12:17:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:17:16,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:17:16,214 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:17:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:17:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:17:16,218 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-10 12:17:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:17:16,259 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-10 12:17:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:17:16,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 77 transitions. [2018-11-10 12:17:16,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 12:17:16,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 72 transitions. [2018-11-10 12:17:16,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 12:17:16,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-10 12:17:16,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2018-11-10 12:17:16,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:16,263 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-10 12:17:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2018-11-10 12:17:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 12:17:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:17:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-10 12:17:16,267 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-10 12:17:16,267 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-10 12:17:16,267 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:17:16,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2018-11-10 12:17:16,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-10 12:17:16,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:16,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:16,269 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] [2018-11-10 12:17:16,269 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] [2018-11-10 12:17:16,269 INFO L793 eck$LassoCheckResult]: Stem: 304#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;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 262#L175 assume ~r1~0 == 0; 263#L176 assume ~id1~0 >= 0; 292#L177 assume ~st1~0 == 0; 310#L178 assume ~send1~0 == ~id1~0; 273#L179 assume ~mode1~0 % 256 == 0; 274#L180 assume ~id2~0 >= 0; 302#L181 assume ~st2~0 == 0; 284#L182 assume ~send2~0 == ~id2~0; 285#L183 assume ~mode2~0 % 256 == 0; 308#L184 assume ~id3~0 >= 0; 315#L185 assume ~st3~0 == 0; 266#L186 assume ~send3~0 == ~id3~0; 267#L187 assume ~mode3~0 % 256 == 0; 293#L188 assume ~id1~0 != ~id2~0; 311#L189 assume ~id1~0 != ~id3~0; 275#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 276#L175-1 init_#res := init_~tmp~0; 289#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 277#L300-3 [2018-11-10 12:17:16,269 INFO L795 eck$LassoCheckResult]: Loop: 277#L300-3 assume true; 278#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 306#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 297#L103 assume !(node1_~m1~0 != ~nomsg~0); 296#L103-1 ~mode1~0 := 0; 265#L99-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; 299#L125 assume !(~mode2~0 % 256 != 0); 282#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 283#L138-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; 294#L125-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; 295#L150 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 290#L153 assume !(node3_~m3~0 != ~nomsg~0); 272#L153-1 ~mode3~0 := 0; 279#L150-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 280#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 288#L249 assume ~r1~0 >= 3; 270#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 286#L248-1 check_#res := check_~tmp~1; 287#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;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; 314#L324 assume !(assert_~arg % 256 == 0); 313#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 277#L300-3 [2018-11-10 12:17:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2018-11-10 12:17:16,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:16,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 704146717, now seen corresponding path program 1 times [2018-11-10 12:17:16,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:17:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:16,327 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 12:17:16,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:17:16,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:17:16,328 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:17:16,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:17:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:17:16,328 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-10 12:17:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:17:16,364 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2018-11-10 12:17:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:17:16,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2018-11-10 12:17:16,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-10 12:17:16,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2018-11-10 12:17:16,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-10 12:17:16,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-10 12:17:16,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2018-11-10 12:17:16,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:16,368 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-10 12:17:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2018-11-10 12:17:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-10 12:17:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 12:17:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2018-11-10 12:17:16,372 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-10 12:17:16,372 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2018-11-10 12:17:16,373 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:17:16,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2018-11-10 12:17:16,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2018-11-10 12:17:16,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:17:16,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:17:16,375 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] [2018-11-10 12:17:16,375 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] [2018-11-10 12:17:16,375 INFO L793 eck$LassoCheckResult]: Stem: 452#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;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~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]; 426#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 409#L175 assume ~r1~0 == 0; 410#L176 assume ~id1~0 >= 0; 437#L177 assume ~st1~0 == 0; 457#L178 assume ~send1~0 == ~id1~0; 418#L179 assume ~mode1~0 % 256 == 0; 419#L180 assume ~id2~0 >= 0; 449#L181 assume ~st2~0 == 0; 429#L182 assume ~send2~0 == ~id2~0; 430#L183 assume ~mode2~0 % 256 == 0; 455#L184 assume ~id3~0 >= 0; 462#L185 assume ~st3~0 == 0; 411#L186 assume ~send3~0 == ~id3~0; 412#L187 assume ~mode3~0 % 256 == 0; 440#L188 assume ~id1~0 != ~id2~0; 458#L189 assume ~id1~0 != ~id3~0; 420#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 421#L175-1 init_#res := init_~tmp~0; 434#L240 main_#t~ret16 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 463#L300-3 [2018-11-10 12:17:16,375 INFO L795 eck$LassoCheckResult]: Loop: 463#L300-3 assume true; 486#L300-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 485#L99 assume !(~mode1~0 % 256 != 0); 484#L113 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 483#L113-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; 442#L99-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; 482#L125 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 480#L128 assume !(node2_~m2~0 != ~nomsg~0); 476#L128-1 ~mode2~0 := 0; 475#L125-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; 474#L150 assume !(~mode3~0 % 256 != 0); 470#L163 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 469#L163-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; 467#L150-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 466#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 465#L249 assume !(~r1~0 >= 3); 414#L252 assume ~st1~0 + ~st2~0 + ~st3~0 == 0; 415#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 490#L248-1 check_#res := check_~tmp~1; 489#L268 main_#t~ret17 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;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; 488#L324 assume !(assert_~arg % 256 == 0); 487#L319 assume { :end_inline_assert } true;main_#t~post18 := main_~i2~0;main_~i2~0 := main_#t~post18 + 1;havoc main_#t~post18; 463#L300-3 [2018-11-10 12:17:16,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2018-11-10 12:17:16,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1445837692, now seen corresponding path program 1 times [2018-11-10 12:17:16,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:17:16,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:17:16,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -525546760, now seen corresponding path program 1 times [2018-11-10 12:17:16,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:17:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:17:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:17:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:17:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:16,477 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 12:17:16,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:17:16,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:17:16,697 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-11-10 12:17:17,289 WARN L179 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-11-10 12:17:17,297 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:17:17,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:17:17,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:17:17,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:17:17,299 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:17:17,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:17:17,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:17:17,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:17:17,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 12:17:17,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:17:17,299 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:17:17,328 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 12:17:17,345 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 12:17:17,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 12:17:17,350 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 12:17:17,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 12:17:17,415 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 12:17:17,417 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 12:17:17,418 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 12:17:17,423 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 12:17:17,424 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 12:17:17,426 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 12:17:17,428 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 12:17:17,429 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 12:17:17,430 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 12:17:17,433 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 12:17:17,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 12:17:17,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 12:17:17,440 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 12:17:17,441 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 12:17:17,442 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 12:17:17,587 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:17:19,661 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-10 12:17:19,704 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:17:19,705 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/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 12:17:19,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:17:19,709 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a68f6b0c-0e7f-4b69-8bfa-e06577ada389/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 12:17:19,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:17:19,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:17:19,856 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:17:19,857 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:17:19,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:17:19,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:17:19,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:17:19,858 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:17:19,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:17:19,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:17:19,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:17:19,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 12:17:19,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:17:19,858 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:17:19,865 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 12:17:19,869 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 12:17:19,872 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 12:17:19,873 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 12:17:19,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 12:17:19,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 12:17:19,948 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 12:17:19,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 12:17:19,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 12:17:19,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 12:17:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:17:19,957 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 12:17:19,957 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 12:17:19,961 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 12:17:19,962 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 12:17:19,964 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 12:17:19,965 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 12:17:19,967 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 12:17:19,967 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 12:17:19,969 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 12:17:20,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 12:17:22,021 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 143 DAG size of output: 95 [2018-11-10 12:17:22,056 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:17:22,060 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:17:22,061 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 12:17:22,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,067 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 12:17:22,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,071 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 12:17:22,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:22,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:22,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,076 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 12:17:22,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,076 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-10 12:17:22,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,102 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-10 12:17:22,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,167 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 12:17:22,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,173 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 12:17:22,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:17:22,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:22,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:22,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,182 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 12:17:22,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:22,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:22,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,186 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 12:17:22,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,188 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 12:17:22,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,191 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 12:17:22,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:17:22,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:17:22,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,195 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 12:17:22,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,197 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 12:17:22,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,199 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 12:17:22,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:17:22,202 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 12:17:22,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:17:22,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:17:22,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:17:22,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:17:22,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:17:22,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:17:22,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:17:22,204 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:17:22,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:17:22,207 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:17:22,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:17:22,208 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:17:22,208 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:17:22,209 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-10 12:17:22,210 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:17:22,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:17:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:22,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:17:22,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:17:22,303 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 12:17:22,305 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 12:17:22,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 4 states. [2018-11-10 12:17:22,335 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 4 states. Result 147 states and 206 transitions. Complement of second has 6 states. [2018-11-10 12:17:22,336 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 12:17:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:17:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-10 12:17:22,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 22 letters. [2018-11-10 12:17:22,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:22,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 42 letters. Loop has 22 letters. [2018-11-10 12:17:22,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:22,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 20 letters. Loop has 44 letters. [2018-11-10 12:17:22,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:17:22,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 206 transitions. [2018-11-10 12:17:22,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:17:22,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 0 states and 0 transitions. [2018-11-10 12:17:22,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:17:22,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:17:22,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:17:22,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:22,342 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:22,342 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:17:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:17:22,343 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 12:17:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:17:22,343 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:17:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:17:22,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:17:22,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:17:22,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:17:22,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:17:22,344 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:17:22,344 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:17:22,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:17:22,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:17:22,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:17:22,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:17:22 BoogieIcfgContainer [2018-11-10 12:17:22,350 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:17:22,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:17:22,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:17:22,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:17:22,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:17:15" (3/4) ... [2018-11-10 12:17:22,353 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:17:22,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:17:22,354 INFO L168 Benchmark]: Toolchain (without parser) took 7253.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 963.0 MB in the beginning and 837.6 MB in the end (delta: 125.4 MB). Peak memory consumption was 492.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:22,354 INFO L168 Benchmark]: CDTParser took 0.15 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 12:17:22,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.90 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:22,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.76 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:22,355 INFO L168 Benchmark]: Boogie Preprocessor took 56.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:22,356 INFO L168 Benchmark]: RCFGBuilder took 324.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:22,356 INFO L168 Benchmark]: BuchiAutomizer took 6630.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 837.6 MB in the end (delta: 292.6 MB). Peak memory consumption was 494.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:17:22,357 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.4 GB. Free memory is still 837.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:17:22,359 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.15 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 208.90 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 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 26.76 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6630.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 837.6 MB in the end (delta: 292.6 MB). Peak memory consumption was 494.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.4 GB. Free memory is still 837.6 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 + 11 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 6.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 343 SDtfs, 163 SDslu, 496 SDs, 0 SdLazy, 32 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital478 mio100 ax107 hnf101 lsp26 ukn64 mio100 lsp100 div175 bol100 ite100 ukn100 eq164 hnf66 smp100 dnf4932 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 91ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 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...