./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/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 053aeb48113c945d72b88fa8b8a723afcb7d2dc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:59:23,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:59:23,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:59:23,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:59:23,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:59:23,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:59:23,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:59:23,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:59:23,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:59:23,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:59:23,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:59:23,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:59:23,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:59:23,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:59:23,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:59:23,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:59:23,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:59:23,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:59:23,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:59:23,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:59:23,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:59:23,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:59:23,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:59:23,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:59:23,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:59:23,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:59:23,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:59:23,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:59:23,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:59:23,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:59:23,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:59:23,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:59:23,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:59:23,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:59:23,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:59:23,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:59:23,926 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 02:59:23,934 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:59:23,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:59:23,935 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:59:23,935 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:59:23,935 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:59:23,936 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:59:23,936 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:59:23,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:59:23,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:59:23,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:59:23,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:59:23,938 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:59:23,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:59:23,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:59:23,938 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:59:23,938 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:59:23,939 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_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/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 -> 053aeb48113c945d72b88fa8b8a723afcb7d2dc8 [2018-12-02 02:59:23,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:59:23,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:59:23,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:59:23,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:59:23,969 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:59:23,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:59:24,005 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/data/8f51fc8fd/47cf437f0ee9483e8ee254ce036d372a/FLAG61b008249 [2018-12-02 02:59:24,525 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:59:24,526 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:59:24,531 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/data/8f51fc8fd/47cf437f0ee9483e8ee254ce036d372a/FLAG61b008249 [2018-12-02 02:59:25,011 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/bin-2019/uautomizer/data/8f51fc8fd/47cf437f0ee9483e8ee254ce036d372a [2018-12-02 02:59:25,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:59:25,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:59:25,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:59:25,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:59:25,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:59:25,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3739eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25, skipping insertion in model container [2018-12-02 02:59:25,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:59:25,049 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:59:25,168 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:59:25,173 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:59:25,228 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:59:25,238 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:59:25,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25 WrapperNode [2018-12-02 02:59:25,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:59:25,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:59:25,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:59:25,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:59:25,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:59:25,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:59:25,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:59:25,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:59:25,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... [2018-12-02 02:59:25,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:59:25,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:59:25,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:59:25,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:59:25,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/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-12-02 02:59:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:59:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:59:25,614 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:59:25,614 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-12-02 02:59:25,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:25 BoogieIcfgContainer [2018-12-02 02:59:25,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:59:25,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:59:25,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:59:25,616 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:59:25,617 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:59:25,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:59:25" (1/3) ... [2018-12-02 02:59:25,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@572ce951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:59:25, skipping insertion in model container [2018-12-02 02:59:25,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:59:25,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:25" (2/3) ... [2018-12-02 02:59:25,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@572ce951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:59:25, skipping insertion in model container [2018-12-02 02:59:25,618 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:59:25,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:25" (3/3) ... [2018-12-02 02:59:25,619 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:59:25,650 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:59:25,650 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:59:25,650 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:59:25,650 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:59:25,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:59:25,650 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:59:25,650 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:59:25,650 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:59:25,650 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:59:25,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2018-12-02 02:59:25,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-02 02:59:25,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:59:25,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:59:25,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 02:59:25,680 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-12-02 02:59:25,680 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:59:25,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2018-12-02 02:59:25,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-02 02:59:25,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:59:25,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:59:25,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 02:59:25,683 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-12-02 02:59:25,688 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 74#L240true assume !(0 == ~r1~0);init_~tmp~0 := 0; 72#L240-1true init_#res := init_~tmp~0; 4#L365true main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 63#L437-2true [2018-12-02 02:59:25,689 INFO L796 eck$LassoCheckResult]: Loop: 63#L437-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 6#L113true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 38#L117true assume !(node1_~m1~0 != ~nomsg~0); 13#L117-1true ~mode1~0 := 0; 3#L113-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 41#L139true assume !(0 != ~mode2~0 % 256); 91#L152true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 86#L152-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 12#L139-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 29#L164true assume !(0 != ~mode3~0 % 256); 52#L177true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 48#L177-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 22#L164-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 81#L189true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 84#L192true assume !(node4_~m4~0 != ~nomsg~0); 83#L192-1true ~mode4~0 := 0; 76#L189-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 87#L214true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 70#L217true assume !(node5_~m5~0 != ~nomsg~0); 69#L217-1true ~mode5~0 := 0; 59#L214-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 36#L373true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 17#L373-1true check_#res := check_~tmp~1; 61#L393true main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 85#L467true assume !(0 == assert_~arg % 256); 51#L462true main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 63#L437-2true [2018-12-02 02:59:25,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2018-12-02 02:59:25,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:25,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:25,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:59:25,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:59:25,802 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 02:59:25,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -590840634, now seen corresponding path program 1 times [2018-12-02 02:59:25,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:25,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:25,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:59:25,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:59:25,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:59:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:59:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:59:25,867 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-12-02 02:59:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:59:25,918 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2018-12-02 02:59:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:59:25,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 152 transitions. [2018-12-02 02:59:25,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-12-02 02:59:25,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 115 transitions. [2018-12-02 02:59:25,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-12-02 02:59:25,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-12-02 02:59:25,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 115 transitions. [2018-12-02 02:59:25,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:59:25,926 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-12-02 02:59:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 115 transitions. [2018-12-02 02:59:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-02 02:59:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 02:59:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2018-12-02 02:59:25,945 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-12-02 02:59:25,946 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2018-12-02 02:59:25,946 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:59:25,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 115 transitions. [2018-12-02 02:59:25,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-12-02 02:59:25,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:59:25,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:59:25,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:59:25,947 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-12-02 02:59:25,948 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 221#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 222#L240 assume 0 == ~r1~0; 204#L241 assume ~id1~0 >= 0; 205#L242 assume 0 == ~st1~0; 244#L243 assume ~send1~0 == ~id1~0; 270#L244 assume 0 == ~mode1~0 % 256; 252#L245 assume ~id2~0 >= 0; 253#L246 assume 0 == ~st2~0; 274#L247 assume ~send2~0 == ~id2~0; 232#L248 assume 0 == ~mode2~0 % 256; 233#L249 assume ~id3~0 >= 0; 262#L250 assume 0 == ~st3~0; 265#L251 assume ~send3~0 == ~id3~0; 206#L252 assume 0 == ~mode3~0 % 256; 207#L253 assume ~id4~0 >= 0; 245#L254 assume 0 == ~st4~0; 223#L255 assume ~send4~0 == ~id4~0; 224#L256 assume 0 == ~mode4~0 % 256; 255#L257 assume ~id5~0 >= 0; 275#L258 assume 0 == ~st5~0; 234#L259 assume ~send5~0 == ~id5~0; 235#L260 assume 0 == ~mode5~0 % 256; 263#L261 assume ~id1~0 != ~id2~0; 266#L262 assume ~id1~0 != ~id3~0; 208#L263 assume ~id1~0 != ~id4~0; 209#L264 assume ~id1~0 != ~id5~0; 246#L265 assume ~id2~0 != ~id3~0; 225#L266 assume ~id2~0 != ~id4~0; 226#L267 assume ~id2~0 != ~id5~0; 256#L268 assume ~id3~0 != ~id4~0; 276#L269 assume ~id3~0 != ~id5~0; 236#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 237#L240-1 init_#res := init_~tmp~0; 199#L365 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 200#L437-2 [2018-12-02 02:59:25,948 INFO L796 eck$LassoCheckResult]: Loop: 200#L437-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 201#L113 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 202#L117 assume !(node1_~m1~0 != ~nomsg~0); 217#L117-1 ~mode1~0 := 0; 197#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 198#L139 assume !(0 != ~mode2~0 % 256); 257#L152 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 281#L152-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 215#L139-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 216#L164 assume !(0 != ~mode3~0 % 256); 240#L177 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 264#L177-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 230#L164-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 231#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 280#L192 assume !(node4_~m4~0 != ~nomsg~0); 228#L192-1 ~mode4~0 := 0; 248#L189-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 279#L214 assume !(0 != ~mode5~0 % 256); 260#L227 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 258#L227-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 259#L214-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 249#L373 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 219#L373-1 check_#res := check_~tmp~1; 220#L393 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 272#L467 assume !(0 == assert_~arg % 256); 267#L462 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 200#L437-2 [2018-12-02 02:59:25,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2018-12-02 02:59:25,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:25,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:25,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash 627144764, now seen corresponding path program 1 times [2018-12-02 02:59:25,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:26,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:59:26,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:59:26,034 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:59:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:59:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:59:26,035 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-12-02 02:59:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:59:26,070 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2018-12-02 02:59:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:59:26,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 117 transitions. [2018-12-02 02:59:26,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-12-02 02:59:26,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 112 transitions. [2018-12-02 02:59:26,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-12-02 02:59:26,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-12-02 02:59:26,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2018-12-02 02:59:26,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:59:26,073 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-12-02 02:59:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2018-12-02 02:59:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-02 02:59:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 02:59:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-12-02 02:59:26,075 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-12-02 02:59:26,076 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-12-02 02:59:26,076 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:59:26,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 112 transitions. [2018-12-02 02:59:26,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2018-12-02 02:59:26,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:59:26,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:59:26,077 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:59:26,077 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] [2018-12-02 02:59:26,077 INFO L794 eck$LassoCheckResult]: Stem: 439#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 403#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 404#L240 assume 0 == ~r1~0; 386#L241 assume ~id1~0 >= 0; 387#L242 assume 0 == ~st1~0; 429#L243 assume ~send1~0 == ~id1~0; 455#L244 assume 0 == ~mode1~0 % 256; 436#L245 assume ~id2~0 >= 0; 437#L246 assume 0 == ~st2~0; 459#L247 assume ~send2~0 == ~id2~0; 417#L248 assume 0 == ~mode2~0 % 256; 418#L249 assume ~id3~0 >= 0; 446#L250 assume 0 == ~st3~0; 450#L251 assume ~send3~0 == ~id3~0; 391#L252 assume 0 == ~mode3~0 % 256; 392#L253 assume ~id4~0 >= 0; 430#L254 assume 0 == ~st4~0; 405#L255 assume ~send4~0 == ~id4~0; 406#L256 assume 0 == ~mode4~0 % 256; 440#L257 assume ~id5~0 >= 0; 460#L258 assume 0 == ~st5~0; 419#L259 assume ~send5~0 == ~id5~0; 420#L260 assume 0 == ~mode5~0 % 256; 448#L261 assume ~id1~0 != ~id2~0; 451#L262 assume ~id1~0 != ~id3~0; 393#L263 assume ~id1~0 != ~id4~0; 394#L264 assume ~id1~0 != ~id5~0; 431#L265 assume ~id2~0 != ~id3~0; 410#L266 assume ~id2~0 != ~id4~0; 411#L267 assume ~id2~0 != ~id5~0; 441#L268 assume ~id3~0 != ~id4~0; 461#L269 assume ~id3~0 != ~id5~0; 421#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 422#L240-1 init_#res := init_~tmp~0; 384#L365 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 385#L437-2 [2018-12-02 02:59:26,077 INFO L796 eck$LassoCheckResult]: Loop: 385#L437-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 388#L113 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 389#L117 assume !(node1_~m1~0 != ~nomsg~0); 402#L117-1 ~mode1~0 := 0; 382#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 383#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 423#L142 assume !(node2_~m2~0 != ~nomsg~0); 396#L142-1 ~mode2~0 := 0; 400#L139-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 401#L164 assume !(0 != ~mode3~0 % 256); 425#L177 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 449#L177-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 415#L164-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 416#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 465#L192 assume !(node4_~m4~0 != ~nomsg~0); 413#L192-1 ~mode4~0 := 0; 433#L189-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 464#L214 assume !(0 != ~mode5~0 % 256); 445#L227 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 443#L227-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 444#L214-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 434#L373 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 435#L374 assume ~r1~0 >= 5; 428#L378 assume ~r1~0 < 5;check_~tmp~1 := 1; 408#L373-1 check_#res := check_~tmp~1; 409#L393 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 457#L467 assume !(0 == assert_~arg % 256); 452#L462 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 385#L437-2 [2018-12-02 02:59:26,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2018-12-02 02:59:26,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:26,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash 328725974, now seen corresponding path program 1 times [2018-12-02 02:59:26,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:59:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:26,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:59:26,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:59:26,119 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:59:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:59:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:59:26,119 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-12-02 02:59:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:59:26,136 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2018-12-02 02:59:26,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:59:26,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 178 transitions. [2018-12-02 02:59:26,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-12-02 02:59:26,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 178 transitions. [2018-12-02 02:59:26,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2018-12-02 02:59:26,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-12-02 02:59:26,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 178 transitions. [2018-12-02 02:59:26,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:59:26,139 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-12-02 02:59:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 178 transitions. [2018-12-02 02:59:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-02 02:59:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 02:59:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2018-12-02 02:59:26,142 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-12-02 02:59:26,142 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2018-12-02 02:59:26,142 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:59:26,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 178 transitions. [2018-12-02 02:59:26,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-12-02 02:59:26,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:59:26,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:59:26,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:59:26,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:59:26,144 INFO L794 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 626#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 627#L240 assume 0 == ~r1~0; 609#L241 assume ~id1~0 >= 0; 610#L242 assume 0 == ~st1~0; 649#L243 assume ~send1~0 == ~id1~0; 676#L244 assume 0 == ~mode1~0 % 256; 656#L245 assume ~id2~0 >= 0; 657#L246 assume 0 == ~st2~0; 681#L247 assume ~send2~0 == ~id2~0; 637#L248 assume 0 == ~mode2~0 % 256; 638#L249 assume ~id3~0 >= 0; 667#L250 assume 0 == ~st3~0; 670#L251 assume ~send3~0 == ~id3~0; 611#L252 assume 0 == ~mode3~0 % 256; 612#L253 assume ~id4~0 >= 0; 650#L254 assume 0 == ~st4~0; 628#L255 assume ~send4~0 == ~id4~0; 629#L256 assume 0 == ~mode4~0 % 256; 660#L257 assume ~id5~0 >= 0; 682#L258 assume 0 == ~st5~0; 639#L259 assume ~send5~0 == ~id5~0; 640#L260 assume 0 == ~mode5~0 % 256; 668#L261 assume ~id1~0 != ~id2~0; 672#L262 assume ~id1~0 != ~id3~0; 613#L263 assume ~id1~0 != ~id4~0; 614#L264 assume ~id1~0 != ~id5~0; 653#L265 assume ~id2~0 != ~id3~0; 630#L266 assume ~id2~0 != ~id4~0; 631#L267 assume ~id2~0 != ~id5~0; 662#L268 assume ~id3~0 != ~id4~0; 683#L269 assume ~id3~0 != ~id5~0; 643#L270 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 644#L240-1 init_#res := init_~tmp~0; 604#L365 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 605#L437-2 [2018-12-02 02:59:26,144 INFO L796 eck$LassoCheckResult]: Loop: 605#L437-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 606#L113 assume !(0 != ~mode1~0 % 256); 608#L127 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 625#L127-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 602#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 603#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 641#L142 assume !(node2_~m2~0 != ~nomsg~0); 616#L142-1 ~mode2~0 := 0; 620#L139-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 621#L164 assume !(0 != ~mode3~0 % 256); 645#L177 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 669#L177-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 635#L164-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 636#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 688#L192 assume !(node4_~m4~0 != ~nomsg~0); 633#L192-1 ~mode4~0 := 0; 652#L189-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 687#L214 assume !(0 != ~mode5~0 % 256); 690#L227 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 694#L227-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 693#L214-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 692#L373 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 691#L374 assume !(~r1~0 >= 5); 647#L377 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 648#L378 assume ~r1~0 < 5;check_~tmp~1 := 1; 623#L373-1 check_#res := check_~tmp~1; 624#L393 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 678#L467 assume !(0 == assert_~arg % 256); 671#L462 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 605#L437-2 [2018-12-02 02:59:26,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2018-12-02 02:59:26,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:26,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash 867920766, now seen corresponding path program 1 times [2018-12-02 02:59:26,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:26,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:59:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:59:26,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:59:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1038126770, now seen corresponding path program 1 times [2018-12-02 02:59:26,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:59:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:59:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:59:26,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:59:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:59:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:59:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:59:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:59:26,500 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2018-12-02 02:59:28,062 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2018-12-02 02:59:28,069 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:59:28,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:59:28,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:59:28,070 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:59:28,070 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 02:59:28,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:59:28,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:59:28,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:59:28,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-12-02 02:59:28,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:59:28,070 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:59:28,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 02:59:28,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,278 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-12-02 02:59:28,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-12-02 02:59:28,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-12-02 02:59:28,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,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-12-02 02:59:28,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,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-12-02 02:59:28,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-12-02 02:59:28,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,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-12-02 02:59:28,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:59:28,495 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-02 02:59:28,560 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 03:00:07,563 WARN L180 SmtUtils]: Spent 38.89 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2018-12-02 03:00:07,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:00:07,650 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/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-12-02 03:00:07,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:00:07,658 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce3f23b5-88e7-427c-8eb7-ff9114741eb7/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-12-02 03:00:07,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 03:00:07,685 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:00:07,768 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 03:00:07,770 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:00:07,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:00:07,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:00:07,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:00:07,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:00:07,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:00:07,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:00:07,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:00:07,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-12-02 03:00:07,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:00:07,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:00:07,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-02 03:00:07,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,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-12-02 03:00:07,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-12-02 03:00:07,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,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-12-02 03:00:07,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,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-12-02 03:00:07,954 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-12-02 03:00:07,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:07,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:00:08,197 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-02 03:00:08,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 03:00:34,701 WARN L180 SmtUtils]: Spent 26.35 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2018-12-02 03:00:34,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:00:34,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:00:34,773 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-12-02 03:00:34,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,781 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-12-02 03:00:34,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:00:34,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:00:34,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,785 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-12-02 03:00:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,787 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-12-02 03:00:34,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,789 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-12-02 03:00:34,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:00:34,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:00:34,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,793 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-12-02 03:00:34,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,796 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-12-02 03:00:34,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:00:34,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:00:34,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,800 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-12-02 03:00:34,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,803 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-12-02 03:00:34,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:00:34,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:00:34,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,807 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-12-02 03:00:34,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,809 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-12-02 03:00:34,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,811 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-12-02 03:00:34,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:34,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:34,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,812 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-12-02 03:00:34,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:34,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:00:34,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:00:34,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:34,816 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-12-02 03:00:34,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:34,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:34,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:34,817 INFO L206 nArgumentSynthesizer]: 64 loop disjuncts [2018-12-02 03:00:34,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:34,888 INFO L402 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2018-12-02 03:00:34,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:35,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:35,125 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-12-02 03:00:35,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:35,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:35,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:35,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:35,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:35,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:35,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:35,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:35,127 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-12-02 03:00:35,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:35,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:35,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:35,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:35,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:35,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:35,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:35,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:00:35,128 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-12-02 03:00:35,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:00:35,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:00:35,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:00:35,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:00:35,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:00:35,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:00:35,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:00:35,130 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:00:35,132 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 03:00:35,132 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 03:00:35,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:00:35,133 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 03:00:35,133 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:00:35,133 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-12-02 03:00:35,134 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 03:00:35,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:00:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:35,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:00:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:00:35,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:00:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:00:35,220 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-12-02 03:00:35,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50 Second operand 3 states. [2018-12-02 03:00:35,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 222 states and 321 transitions. Complement of second has 4 states. [2018-12-02 03:00:35,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:00:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:00:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-12-02 03:00:35,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 29 letters. [2018-12-02 03:00:35,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:00:35,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 64 letters. Loop has 29 letters. [2018-12-02 03:00:35,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:00:35,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 58 letters. [2018-12-02 03:00:35,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:00:35,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 321 transitions. [2018-12-02 03:00:35,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:00:35,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2018-12-02 03:00:35,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 03:00:35,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 03:00:35,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 03:00:35,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:00:35,259 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:00:35,259 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:00:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:00:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:00:35,259 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-02 03:00:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:00:35,259 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 03:00:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 03:00:35,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 03:00:35,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:00:35,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 03:00:35,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 03:00:35,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:00:35,260 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 03:00:35,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:00:35,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:00:35,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 03:00:35,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:00:35 BoogieIcfgContainer [2018-12-02 03:00:35,266 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 03:00:35,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:00:35,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:00:35,266 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:00:35,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:25" (3/4) ... [2018-12-02 03:00:35,269 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 03:00:35,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:00:35,270 INFO L168 Benchmark]: Toolchain (without parser) took 70253.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 958.7 MB in the beginning and 889.0 MB in the end (delta: 69.6 MB). Peak memory consumption was 251.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,270 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:00:35,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,272 INFO L168 Benchmark]: Boogie Preprocessor took 17.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,272 INFO L168 Benchmark]: RCFGBuilder took 330.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,272 INFO L168 Benchmark]: BuchiAutomizer took 69651.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 889.0 MB in the end (delta: 131.3 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:00:35,273 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 889.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:00:35,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 330.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 69651.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 889.0 MB in the end (delta: 131.3 MB). Peak memory consumption was 239.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 889.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 69.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 543 SDtfs, 178 SDslu, 775 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1394 mio100 ax104 hnf100 lsp14 ukn65 mio100 lsp100 div172 bol100 ite100 ukn100 eq166 hnf67 smp100 dnf40036 smp11 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 308ms VariablesStem: 0 VariablesLoop: 32 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...