./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.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_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/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 065f57545a05dc7becaaa98896b4977b9d686732 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:55:17,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:55:17,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:55:17,693 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:55:17,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:55:17,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:55:17,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:55:17,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:55:17,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:55:17,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:55:17,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:55:17,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:55:17,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:55:17,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:55:17,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:55:17,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:55:17,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:55:17,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:55:17,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:55:17,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:55:17,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:55:17,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:55:17,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:55:17,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:55:17,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:55:17,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:55:17,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:55:17,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:55:17,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:55:17,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:55:17,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:55:17,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:55:17,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:55:17,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:55:17,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:55:17,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:55:17,712 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:55:17,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:55:17,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:55:17,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:55:17,724 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:55:17,724 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:55:17,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:55:17,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:55:17,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:55:17,726 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:55:17,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:55:17,727 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:55:17,727 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:55:17,727 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:55:17,727 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_c69f21ef-b868-41a5-b794-45c8554de2c2/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 -> 065f57545a05dc7becaaa98896b4977b9d686732 [2018-11-10 05:55:17,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:55:17,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:55:17,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:55:17,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:55:17,762 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:55:17,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 05:55:17,807 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/data/af70cdd0e/31fccc3afecb48faa24617110b906ec1/FLAG97ff18a93 [2018-11-10 05:55:18,243 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:55:18,244 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 05:55:18,249 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/data/af70cdd0e/31fccc3afecb48faa24617110b906ec1/FLAG97ff18a93 [2018-11-10 05:55:18,258 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/data/af70cdd0e/31fccc3afecb48faa24617110b906ec1 [2018-11-10 05:55:18,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:55:18,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:55:18,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:55:18,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:55:18,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:55:18,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18, skipping insertion in model container [2018-11-10 05:55:18,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:55:18,307 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:55:18,455 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:55:18,461 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:55:18,495 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:55:18,508 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:55:18,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18 WrapperNode [2018-11-10 05:55:18,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:55:18,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:55:18,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:55:18,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:55:18,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:55:18,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:55:18,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:55:18,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:55:18,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... [2018-11-10 05:55:18,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:55:18,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:55:18,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:55:18,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:55:18,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/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 05:55:18,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:55:18,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:55:19,070 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:55:19,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:55:19 BoogieIcfgContainer [2018-11-10 05:55:19,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:55:19,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:55:19,071 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:55:19,073 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:55:19,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:55:19,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:55:18" (1/3) ... [2018-11-10 05:55:19,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f4cf1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:55:19, skipping insertion in model container [2018-11-10 05:55:19,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:55:19,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:55:18" (2/3) ... [2018-11-10 05:55:19,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f4cf1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:55:19, skipping insertion in model container [2018-11-10 05:55:19,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:55:19,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:55:19" (3/3) ... [2018-11-10 05:55:19,077 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 05:55:19,108 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:55:19,109 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:55:19,109 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:55:19,109 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:55:19,109 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:55:19,109 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:55:19,109 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:55:19,110 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:55:19,110 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:55:19,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2018-11-10 05:55:19,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 05:55:19,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:55:19,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:55:19,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,142 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 05:55:19,142 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:55:19,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states. [2018-11-10 05:55:19,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 05:55:19,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:55:19,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:55:19,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,147 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 05:55:19,154 INFO L793 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 49#L301true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 33#L304-1true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 88#L314true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 62#L317-1true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 122#L327true assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 100#L330-1true init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 11#L340true assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 8#L343-1true init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 58#L353true assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 35#L356-1true init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 92#L366true assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 86#L369-1true init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 141#L379true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 143#L379-1true init_#res := init_~tmp___5~0; 134#L500true main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 97#L611-3true [2018-11-10 05:55:19,155 INFO L795 eck$LassoCheckResult]: Loop: 97#L611-3true assume true; 94#L611-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 70#L124true assume !(~mode1~0 % 256 != 0); 64#L152true assume !(~r1~0 < 2); 63#L152-1true ~mode1~0 := 1; 67#L124-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 3#L175true assume !(~mode2~0 % 256 != 0); 137#L203true assume !(~r2~0 < 2); 136#L203-1true ~mode2~0 := 1; 16#L175-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 85#L226true assume !(~mode3~0 % 256 != 0); 43#L254true assume !(~r3~0 < 2); 42#L254-1true ~mode3~0 := 1; 76#L226-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 15#L508true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 18#L508-1true check_#res := check_~tmp~1; 96#L556true main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 113#L641true assume !(assert_~arg % 256 == 0); 83#L636true assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 97#L611-3true [2018-11-10 05:55:19,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2018293946, now seen corresponding path program 1 times [2018-11-10 05:55:19,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:19,311 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 05:55:19,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:19,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:19,316 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:55:19,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1820687993, now seen corresponding path program 1 times [2018-11-10 05:55:19,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:19,368 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 05:55:19,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:19,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:55:19,370 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:55:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:55:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:55:19,381 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-11-10 05:55:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:19,439 INFO L93 Difference]: Finished difference Result 143 states and 244 transitions. [2018-11-10 05:55:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:55:19,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 244 transitions. [2018-11-10 05:55:19,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 05:55:19,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 136 states and 208 transitions. [2018-11-10 05:55:19,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2018-11-10 05:55:19,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-10 05:55:19,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 208 transitions. [2018-11-10 05:55:19,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:55:19,451 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 208 transitions. [2018-11-10 05:55:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 208 transitions. [2018-11-10 05:55:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-10 05:55:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 05:55:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 208 transitions. [2018-11-10 05:55:19,478 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 208 transitions. [2018-11-10 05:55:19,478 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 208 transitions. [2018-11-10 05:55:19,478 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:55:19,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 208 transitions. [2018-11-10 05:55:19,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 05:55:19,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:55:19,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:55:19,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,481 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 05:55:19,482 INFO L793 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 317#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 358#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 360#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 320#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 398#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 395#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 318#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 308#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 309#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 363#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 364#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 351#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 416#L379 assume ~id1~0 != ~id2~0; 413#L380 assume ~id1~0 != ~id3~0; 347#L381 assume ~id2~0 != ~id3~0; 348#L382 assume ~id1~0 >= 0; 406#L383 assume ~id2~0 >= 0; 339#L384 assume ~id3~0 >= 0; 340#L385 assume ~r1~0 == 0; 393#L386 assume ~r2~0 == 0; 304#L387 assume ~r3~0 == 0; 305#L388 assume init_~r122~0 % 256 != 0; 386#L389 assume init_~r132~0 % 256 != 0; 387#L390 assume init_~r212~0 % 256 != 0; 409#L391 assume init_~r232~0 % 256 != 0; 345#L392 assume init_~r312~0 % 256 != 0; 346#L393 assume init_~r322~0 % 256 != 0; 405#L394 assume ~max1~0 == ~id1~0; 337#L395 assume ~max2~0 == ~id2~0; 338#L396 assume ~max3~0 == ~id3~0; 392#L397 assume ~st1~0 == 0; 302#L398 assume ~st2~0 == 0; 303#L399 assume ~st3~0 == 0; 384#L400 assume ~nl1~0 == 0; 385#L401 assume ~nl2~0 == 0; 408#L402 assume ~nl3~0 == 0; 343#L403 assume ~mode1~0 % 256 == 0; 344#L404 assume ~mode2~0 % 256 == 0; 404#L405 assume ~mode3~0 % 256 == 0; 335#L406 assume ~newmax1~0 % 256 != 0; 336#L407 assume ~newmax2~0 % 256 != 0; 388#L408 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 389#L379-1 init_#res := init_~tmp___5~0; 434#L500 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 412#L611-3 [2018-11-10 05:55:19,482 INFO L795 eck$LassoCheckResult]: Loop: 412#L611-3 assume true; 418#L611-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 402#L124 assume !(~mode1~0 % 256 != 0); 400#L152 assume !(~r1~0 < 2); 328#L152-1 ~mode1~0 := 1; 399#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 299#L175 assume !(~mode2~0 % 256 != 0); 300#L203 assume !(~r2~0 < 2); 373#L203-1 ~mode2~0 := 1; 324#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 325#L226 assume !(~mode3~0 % 256 != 0); 376#L254 assume !(~r3~0 < 2); 374#L254-1 ~mode3~0 := 1; 375#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 322#L508 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 312#L508-1 check_#res := check_~tmp~1; 326#L556 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 421#L641 assume !(assert_~arg % 256 == 0); 411#L636 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 412#L611-3 [2018-11-10 05:55:19,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 1 times [2018-11-10 05:55:19,482 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1820687993, now seen corresponding path program 2 times [2018-11-10 05:55:19,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:19,605 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 05:55:19,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:19,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:55:19,606 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:55:19,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:55:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:55:19,607 INFO L87 Difference]: Start difference. First operand 136 states and 208 transitions. cyclomatic complexity: 73 Second operand 5 states. [2018-11-10 05:55:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:19,664 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2018-11-10 05:55:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:55:19,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 210 transitions. [2018-11-10 05:55:19,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 05:55:19,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 136 states and 200 transitions. [2018-11-10 05:55:19,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2018-11-10 05:55:19,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-10 05:55:19,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 200 transitions. [2018-11-10 05:55:19,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:55:19,669 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 200 transitions. [2018-11-10 05:55:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 200 transitions. [2018-11-10 05:55:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-10 05:55:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 05:55:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2018-11-10 05:55:19,674 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 200 transitions. [2018-11-10 05:55:19,674 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 200 transitions. [2018-11-10 05:55:19,675 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:55:19,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 200 transitions. [2018-11-10 05:55:19,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 05:55:19,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:55:19,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:55:19,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,678 INFO L793 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 602#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 603#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 645#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 647#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 606#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 685#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 682#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 604#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 595#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 596#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 650#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 655#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 638#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 703#L379 assume ~id1~0 != ~id2~0; 700#L380 assume ~id1~0 != ~id3~0; 634#L381 assume ~id2~0 != ~id3~0; 635#L382 assume ~id1~0 >= 0; 693#L383 assume ~id2~0 >= 0; 626#L384 assume ~id3~0 >= 0; 627#L385 assume ~r1~0 == 0; 680#L386 assume ~r2~0 == 0; 591#L387 assume ~r3~0 == 0; 592#L388 assume init_~r122~0 % 256 != 0; 673#L389 assume init_~r132~0 % 256 != 0; 674#L390 assume init_~r212~0 % 256 != 0; 697#L391 assume init_~r232~0 % 256 != 0; 632#L392 assume init_~r312~0 % 256 != 0; 633#L393 assume init_~r322~0 % 256 != 0; 692#L394 assume ~max1~0 == ~id1~0; 624#L395 assume ~max2~0 == ~id2~0; 625#L396 assume ~max3~0 == ~id3~0; 679#L397 assume ~st1~0 == 0; 589#L398 assume ~st2~0 == 0; 590#L399 assume ~st3~0 == 0; 671#L400 assume ~nl1~0 == 0; 672#L401 assume ~nl2~0 == 0; 695#L402 assume ~nl3~0 == 0; 630#L403 assume ~mode1~0 % 256 == 0; 631#L404 assume ~mode2~0 % 256 == 0; 691#L405 assume ~mode3~0 % 256 == 0; 622#L406 assume ~newmax1~0 % 256 != 0; 623#L407 assume ~newmax2~0 % 256 != 0; 675#L408 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 676#L379-1 init_#res := init_~tmp___5~0; 721#L500 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 699#L611-3 [2018-11-10 05:55:19,678 INFO L795 eck$LassoCheckResult]: Loop: 699#L611-3 assume true; 705#L611-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 689#L124 assume !(~mode1~0 % 256 != 0); 687#L152 assume !(~r1~0 < 2); 614#L152-1 ~mode1~0 := 1; 686#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 586#L175 assume !(~mode2~0 % 256 != 0); 587#L203 assume !(~r2~0 < 2); 660#L203-1 ~mode2~0 := 1; 611#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 612#L226 assume !(~mode3~0 % 256 != 0); 663#L254 assume !(~r3~0 < 2); 661#L254-1 ~mode3~0 := 1; 662#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 609#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 610#L509 assume ~st1~0 + ~nl1~0 <= 1; 667#L510 assume ~st2~0 + ~nl2~0 <= 1; 597#L511 assume ~st3~0 + ~nl3~0 <= 1; 598#L512 assume ~r1~0 >= 2; 619#L516 assume ~r1~0 < 2; 620#L521 assume ~r1~0 >= 2; 665#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 608#L508-1 check_#res := check_~tmp~1; 616#L556 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 708#L641 assume !(assert_~arg % 256 == 0); 698#L636 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 699#L611-3 [2018-11-10 05:55:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 2 times [2018-11-10 05:55:19,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:55:19,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2079693555, now seen corresponding path program 1 times [2018-11-10 05:55:19,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:55:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:19,757 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 05:55:19,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:19,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:19,758 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:55:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:19,758 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. cyclomatic complexity: 65 Second operand 3 states. [2018-11-10 05:55:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:19,806 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2018-11-10 05:55:19,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:19,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 288 transitions. [2018-11-10 05:55:19,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2018-11-10 05:55:19,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 288 transitions. [2018-11-10 05:55:19,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2018-11-10 05:55:19,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2018-11-10 05:55:19,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 288 transitions. [2018-11-10 05:55:19,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:55:19,811 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2018-11-10 05:55:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 288 transitions. [2018-11-10 05:55:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-11-10 05:55:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-10 05:55:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2018-11-10 05:55:19,818 INFO L728 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2018-11-10 05:55:19,818 INFO L608 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2018-11-10 05:55:19,818 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:55:19,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. [2018-11-10 05:55:19,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2018-11-10 05:55:19,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:55:19,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:55:19,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:19,821 INFO L793 eck$LassoCheckResult]: Stem: 1051#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 936#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 937#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 982#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 984#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 943#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1022#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 1019#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 938#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 932#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 933#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 987#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 988#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 974#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1042#L379 assume ~id1~0 != ~id2~0; 1037#L380 assume ~id1~0 != ~id3~0; 971#L381 assume ~id2~0 != ~id3~0; 972#L382 assume ~id1~0 >= 0; 1032#L383 assume ~id2~0 >= 0; 963#L384 assume ~id3~0 >= 0; 964#L385 assume ~r1~0 == 0; 1017#L386 assume ~r2~0 == 0; 928#L387 assume ~r3~0 == 0; 929#L388 assume init_~r122~0 % 256 != 0; 1010#L389 assume init_~r132~0 % 256 != 0; 1011#L390 assume init_~r212~0 % 256 != 0; 1035#L391 assume init_~r232~0 % 256 != 0; 969#L392 assume init_~r312~0 % 256 != 0; 970#L393 assume init_~r322~0 % 256 != 0; 1031#L394 assume ~max1~0 == ~id1~0; 961#L395 assume ~max2~0 == ~id2~0; 962#L396 assume ~max3~0 == ~id3~0; 1014#L397 assume ~st1~0 == 0; 926#L398 assume ~st2~0 == 0; 927#L399 assume ~st3~0 == 0; 1008#L400 assume ~nl1~0 == 0; 1009#L401 assume ~nl2~0 == 0; 1034#L402 assume ~nl3~0 == 0; 967#L403 assume ~mode1~0 % 256 == 0; 968#L404 assume ~mode2~0 % 256 == 0; 1030#L405 assume ~mode3~0 % 256 == 0; 959#L406 assume ~newmax1~0 % 256 != 0; 960#L407 assume ~newmax2~0 % 256 != 0; 1012#L408 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 1013#L379-1 init_#res := init_~tmp___5~0; 1066#L500 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1039#L611-3 [2018-11-10 05:55:19,821 INFO L795 eck$LassoCheckResult]: Loop: 1039#L611-3 assume true; 1049#L611-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1069#L124 assume !(~mode1~0 % 256 != 0); 1067#L152 assume ~r1~0 < 2; 955#L153 assume !(~ep12~0 % 256 != 0); 950#L153-1 assume !(~ep13~0 % 256 != 0); 951#L152-1 ~mode1~0 := 1; 1105#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1103#L175 assume !(~mode2~0 % 256 != 0); 1096#L203 assume !(~r2~0 < 2); 1092#L203-1 ~mode2~0 := 1; 1090#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1086#L226 assume !(~mode3~0 % 256 != 0); 1083#L254 assume !(~r3~0 < 2); 1075#L254-1 ~mode3~0 := 1; 1074#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1073#L508 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1072#L509 assume ~st1~0 + ~nl1~0 <= 1; 1071#L510 assume ~st2~0 + ~nl2~0 <= 1; 1070#L511 assume ~st3~0 + ~nl3~0 <= 1; 1068#L512 assume !(~r1~0 >= 2); 1026#L515 assume ~st1~0 + ~st2~0 + ~st3~0 == 0; 1027#L516 assume ~r1~0 < 2; 1117#L521 assume !(~r1~0 >= 2); 1063#L525 assume ~nl1~0 + ~nl2~0 + ~nl3~0 == 0; 1064#L526 assume ~r1~0 < 2;check_~tmp~1 := 1; 953#L508-1 check_#res := check_~tmp~1; 954#L556 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 1048#L641 assume !(assert_~arg % 256 == 0); 1038#L636 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 1039#L611-3 [2018-11-10 05:55:19,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1207151116, now seen corresponding path program 3 times [2018-11-10 05:55:19,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2049542280, now seen corresponding path program 1 times [2018-11-10 05:55:19,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:55:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:55:19,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash 495270979, now seen corresponding path program 1 times [2018-11-10 05:55:19,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:19,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:19,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:19,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:19,928 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 05:55:19,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:19,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:20,118 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-11-10 05:55:20,211 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:55:20,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:55:20,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:55:20,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:55:20,212 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:55:20,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:55:20,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:55:20,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:55:20,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 05:55:20,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:55:20,213 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:55:20,233 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 05:55:20,253 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 05:55:20,259 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 05:55:20,261 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 05:55:20,267 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 05:55:20,268 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 05:55:20,275 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 05:55:20,278 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 05:55:20,279 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 05:55:20,281 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 05:55:20,283 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 05:55:20,284 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 05:55:20,286 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 05:55:20,287 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 05:55:20,289 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 05:55:20,290 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 05:55:20,292 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 05:55:20,294 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 05:55:20,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:55:20,298 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 05:55:20,301 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 05:55:20,315 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 05:55:20,316 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 05:55:20,317 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 05:55:20,318 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 05:55:20,320 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 05:55:20,321 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 05:55:20,322 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 05:55:20,324 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 05:55:20,622 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:55:20,625 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/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 05:55:20,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:55:20,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:55:20,636 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:55:20,636 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/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 05:55:20,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:55:20,653 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c69f21ef-b868-41a5-b794-45c8554de2c2/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:55:20,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:55:20,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:55:20,798 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:55:20,799 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:55:20,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:55:20,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:55:20,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:55:20,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:55:20,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:55:20,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:55:20,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:55:20,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 05:55:20,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:55:20,800 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:55:20,803 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 05:55:20,805 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 05:55:20,808 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 05:55:20,811 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 05:55:20,818 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 05:55:20,819 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 05:55:20,821 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 05:55:20,835 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 05:55:20,839 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 05:55:20,842 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 05:55:20,845 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 05:55:20,847 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 05:55:20,850 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 05:55:20,851 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 05:55:20,853 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 05:55:20,858 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 05:55:20,860 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 05:55:20,862 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 05:55:20,864 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 05:55:20,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 05:55:20,871 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 05:55:20,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 05:55:20,875 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 05:55:20,879 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 05:55:20,881 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 05:55:20,882 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 05:55:20,884 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 05:55:20,886 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 05:55:20,905 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 05:55:21,172 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:55:21,176 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:55:21,177 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 05:55:21,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,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 05:55:21,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,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 05:55:21,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:55:21,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:55:21,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,190 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 05:55:21,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,193 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 05:55:21,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,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 05:55:21,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:55:21,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:55:21,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,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 05:55:21,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,203 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 05:55:21,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:55:21,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,209 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 05:55:21,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,211 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 05:55:21,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,213 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 05:55:21,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,214 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 05:55:21,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,216 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 05:55:21,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:55:21,218 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 05:55:21,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:55:21,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:55:21,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:55:21,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:55:21,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:55:21,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:55:21,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:55:21,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:55:21,222 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:55:21,222 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:55:21,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:55:21,224 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:55:21,224 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:55:21,224 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 05:55:21,225 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:55:21,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:21,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:55:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:21,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:55:21,337 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 05:55:21,340 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 05:55:21,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94 Second operand 4 states. [2018-11-10 05:55:21,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94. Second operand 4 states. Result 331 states and 500 transitions. Complement of second has 6 states. [2018-11-10 05:55:21,384 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 05:55:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:55:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2018-11-10 05:55:21,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 46 letters. Loop has 30 letters. [2018-11-10 05:55:21,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:55:21,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 76 letters. Loop has 30 letters. [2018-11-10 05:55:21,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:55:21,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 46 letters. Loop has 60 letters. [2018-11-10 05:55:21,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:55:21,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 500 transitions. [2018-11-10 05:55:21,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:55:21,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 0 states and 0 transitions. [2018-11-10 05:55:21,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:55:21,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:55:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:55:21,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:55:21,392 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:21,392 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:21,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:21,392 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 05:55:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:21,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 05:55:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:55:21,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:55:21,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:55:21,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:55:21,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:55:21,393 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:21,393 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:55:21,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:55:21,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:55:21,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:55:21,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:55:21 BoogieIcfgContainer [2018-11-10 05:55:21,399 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:55:21,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:55:21,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:55:21,400 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:55:21,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:55:19" (3/4) ... [2018-11-10 05:55:21,403 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:55:21,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:55:21,404 INFO L168 Benchmark]: Toolchain (without parser) took 3142.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 959.1 MB in the beginning and 997.6 MB in the end (delta: -38.4 MB). Peak memory consumption was 178.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,404 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:55:21,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 940.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,406 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,406 INFO L168 Benchmark]: RCFGBuilder took 469.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,407 INFO L168 Benchmark]: BuchiAutomizer took 2328.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 78.5 MB). Peak memory consumption was 154.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:21,407 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 997.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:55:21,410 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 940.4 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 69.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 469.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2328.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 997.6 MB in the end (delta: 78.5 MB). Peak memory consumption was 154.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 997.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 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 195 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 846 SDtfs, 398 SDslu, 1359 SDs, 0 SdLazy, 39 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax124 hnf104 lsp19 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...