./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.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_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/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 bd200d2db4e8741128c4082e326a133517d9c82f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:45:01,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:45:01,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:45:01,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:45:01,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:45:01,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:45:01,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:45:01,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:45:01,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:45:01,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:45:01,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:45:01,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:45:01,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:45:01,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:45:01,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:45:01,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:45:01,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:45:01,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:45:01,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:45:01,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:45:01,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:45:01,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:45:01,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:45:01,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:45:01,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:45:01,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:45:01,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:45:01,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:45:01,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:45:01,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:45:01,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:45:01,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:45:01,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:45:01,793 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:45:01,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:45:01,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:45:01,794 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 19:45:01,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:45:01,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:45:01,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:45:01,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:45:01,805 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:45:01,805 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 19:45:01,805 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 19:45:01,805 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 19:45:01,805 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 19:45:01,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:45:01,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:45:01,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:45:01,808 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 19:45:01,808 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:45:01,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 19:45:01,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:45:01,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:45:01,808 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 19:45:01,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:45:01,809 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:45:01,809 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 19:45:01,810 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 19:45:01,810 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_f7a2a856-d7e6-4b7d-9996-3221e36498cc/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 -> bd200d2db4e8741128c4082e326a133517d9c82f [2018-12-01 19:45:01,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:45:01,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:45:01,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:45:01,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:45:01,844 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:45:01,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-12-01 19:45:01,882 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/data/89eb885bd/074f8b34de7d44ab88eef5944363cbf6/FLAG92f09967e [2018-12-01 19:45:02,260 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:45:02,260 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-12-01 19:45:02,265 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/data/89eb885bd/074f8b34de7d44ab88eef5944363cbf6/FLAG92f09967e [2018-12-01 19:45:02,634 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/bin-2019/uautomizer/data/89eb885bd/074f8b34de7d44ab88eef5944363cbf6 [2018-12-01 19:45:02,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:45:02,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:45:02,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:45:02,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:45:02,648 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:45:02,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da6cbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02, skipping insertion in model container [2018-12-01 19:45:02,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:45:02,677 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:45:02,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:45:02,800 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:45:02,831 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:45:02,876 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:45:02,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02 WrapperNode [2018-12-01 19:45:02,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:45:02,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:45:02,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:45:02,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:45:02,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:45:02,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:45:02,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:45:02,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:45:02,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... [2018-12-01 19:45:02,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:45:02,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:45:02,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:45:02,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:45:02,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/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-01 19:45:02,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:45:02,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:45:03,252 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:45:03,252 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-12-01 19:45:03,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:45:03 BoogieIcfgContainer [2018-12-01 19:45:03,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:45:03,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 19:45:03,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 19:45:03,255 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 19:45:03,255 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:45:03,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 07:45:02" (1/3) ... [2018-12-01 19:45:03,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7756710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:45:03, skipping insertion in model container [2018-12-01 19:45:03,256 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:45:03,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:45:02" (2/3) ... [2018-12-01 19:45:03,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7756710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 07:45:03, skipping insertion in model container [2018-12-01 19:45:03,256 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 19:45:03,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:45:03" (3/3) ... [2018-12-01 19:45:03,257 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-12-01 19:45:03,286 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:45:03,287 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 19:45:03,287 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 19:45:03,287 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 19:45:03,287 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:45:03,287 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:45:03,287 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 19:45:03,287 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:45:03,287 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 19:45:03,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-12-01 19:45:03,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-12-01 19:45:03,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:45:03,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:45:03,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 19:45:03,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,317 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 19:45:03,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-12-01 19:45:03,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-12-01 19:45:03,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:45:03,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:45:03,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 19:45:03,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,325 INFO L794 eck$LassoCheckResult]: Stem: 82#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 7#L274true assume !(0 == ~r1~0);init_~tmp~0 := 0; 5#L274-1true init_#res := init_~tmp~0; 64#L435true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 39#L513-2true [2018-12-01 19:45:03,326 INFO L796 eck$LassoCheckResult]: Loop: 39#L513-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 19#L120true assume !(0 != ~mode1~0 % 256); 25#L136true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 23#L136-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 17#L120-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 93#L148true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 96#L151true assume !(node2_~m2~0 != ~nomsg~0); 95#L151-1true ~mode2~0 := 0; 92#L148-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 98#L173true assume !(0 != ~mode3~0 % 256); 3#L186true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 20#L186-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; 94#L173-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 75#L198true assume !(0 != ~mode4~0 % 256); 103#L211true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 102#L211-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 88#L198-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 80#L223true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 68#L226true assume !(node5_~m5~0 != ~nomsg~0); 66#L226-1true ~mode5~0 := 0; 61#L223-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 69#L248true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 48#L251true assume !(node6_~m6~0 != ~nomsg~0); 47#L251-1true ~mode6~0 := 0; 65#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 86#L443true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 87#L443-1true check_#res := check_~tmp~1; 56#L463true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37#L546true assume !(0 == assert_~arg % 256); 18#L541true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 39#L513-2true [2018-12-01 19:45:03,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2018-12-01 19:45:03,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:03,436 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-01 19:45:03,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:45:03,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:45:03,440 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 19:45:03,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash -779821311, now seen corresponding path program 1 times [2018-12-01 19:45:03,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:03,507 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-01 19:45:03,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:45:03,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:45:03,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 19:45:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:45:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:45:03,519 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-12-01 19:45:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:45:03,569 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2018-12-01 19:45:03,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:45:03,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2018-12-01 19:45:03,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-12-01 19:45:03,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2018-12-01 19:45:03,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-12-01 19:45:03,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-12-01 19:45:03,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2018-12-01 19:45:03,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:45:03,578 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-12-01 19:45:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2018-12-01 19:45:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-01 19:45:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-01 19:45:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2018-12-01 19:45:03,598 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-12-01 19:45:03,598 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-12-01 19:45:03,598 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 19:45:03,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2018-12-01 19:45:03,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-12-01 19:45:03,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:45:03,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:45:03,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,601 INFO L794 eck$LassoCheckResult]: Stem: 327#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 248#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 240#L274 assume 0 == ~r1~0; 241#L275 assume ~id1~0 >= 0; 289#L276 assume 0 == ~st1~0; 249#L277 assume ~send1~0 == ~id1~0; 250#L278 assume 0 == ~mode1~0 % 256; 294#L279 assume ~id2~0 >= 0; 295#L280 assume 0 == ~st2~0; 320#L281 assume ~send2~0 == ~id2~0; 265#L282 assume 0 == ~mode2~0 % 256; 266#L283 assume ~id3~0 >= 0; 304#L284 assume 0 == ~st3~0; 242#L285 assume ~send3~0 == ~id3~0; 243#L286 assume 0 == ~mode3~0 % 256; 307#L287 assume ~id4~0 >= 0; 251#L288 assume 0 == ~st4~0; 252#L289 assume ~send4~0 == ~id4~0; 297#L290 assume 0 == ~mode4~0 % 256; 298#L291 assume ~id5~0 >= 0; 321#L292 assume 0 == ~st5~0; 267#L293 assume ~send5~0 == ~id5~0; 268#L294 assume 0 == ~mode5~0 % 256; 305#L295 assume ~id6~0 >= 0; 246#L296 assume 0 == ~st6~0; 247#L297 assume ~send6~0 == ~id6~0; 308#L298 assume 0 == ~mode6~0 % 256; 255#L299 assume ~id1~0 != ~id2~0; 256#L300 assume ~id1~0 != ~id3~0; 299#L301 assume ~id1~0 != ~id4~0; 300#L302 assume ~id1~0 != ~id5~0; 312#L303 assume ~id1~0 != ~id6~0; 280#L304 assume ~id2~0 != ~id3~0; 281#L305 assume ~id2~0 != ~id4~0; 309#L306 assume ~id2~0 != ~id5~0; 253#L307 assume ~id2~0 != ~id6~0; 254#L308 assume ~id3~0 != ~id4~0; 306#L309 assume ~id3~0 != ~id5~0; 244#L310 assume ~id3~0 != ~id6~0; 245#L311 assume ~id4~0 != ~id5~0; 283#L312 assume ~id4~0 != ~id6~0; 284#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 235#L274-1 init_#res := init_~tmp~0; 236#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 260#L513-2 [2018-12-01 19:45:03,601 INFO L796 eck$LassoCheckResult]: Loop: 260#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 261#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 262#L124 assume !(node1_~m1~0 != ~nomsg~0); 271#L124-1 ~mode1~0 := 0; 257#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 258#L148 assume !(0 != ~mode2~0 % 256); 277#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 275#L161-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; 276#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 329#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 322#L176 assume !(node3_~m3~0 != ~nomsg~0); 274#L176-1 ~mode3~0 := 0; 264#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 323#L198 assume !(0 != ~mode4~0 % 256); 324#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 331#L211-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 315#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 325#L223 assume !(0 != ~mode5~0 % 256); 326#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 332#L236-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; 313#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 314#L248 assume !(0 != ~mode6~0 % 256); 319#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 328#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 302#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 317#L443 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 291#L443-1 check_#res := check_~tmp~1; 311#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 288#L546 assume !(0 == assert_~arg % 256); 259#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 260#L513-2 [2018-12-01 19:45:03,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2018-12-01 19:45:03,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1583129737, now seen corresponding path program 1 times [2018-12-01 19:45:03,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:03,695 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-01 19:45:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:45:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:45:03,696 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 19:45:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:45:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:45:03,697 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-12-01 19:45:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:45:03,730 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2018-12-01 19:45:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:45:03,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2018-12-01 19:45:03,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-12-01 19:45:03,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2018-12-01 19:45:03,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-12-01 19:45:03,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-12-01 19:45:03,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2018-12-01 19:45:03,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:45:03,733 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-12-01 19:45:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2018-12-01 19:45:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-01 19:45:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-01 19:45:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2018-12-01 19:45:03,736 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-12-01 19:45:03,736 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-12-01 19:45:03,736 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 19:45:03,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2018-12-01 19:45:03,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-12-01 19:45:03,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:45:03,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:45:03,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,738 INFO L794 eck$LassoCheckResult]: Stem: 546#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 467#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 459#L274 assume 0 == ~r1~0; 460#L275 assume ~id1~0 >= 0; 508#L276 assume 0 == ~st1~0; 468#L277 assume ~send1~0 == ~id1~0; 469#L278 assume 0 == ~mode1~0 % 256; 512#L279 assume ~id2~0 >= 0; 513#L280 assume 0 == ~st2~0; 539#L281 assume ~send2~0 == ~id2~0; 484#L282 assume 0 == ~mode2~0 % 256; 485#L283 assume ~id3~0 >= 0; 523#L284 assume 0 == ~st3~0; 461#L285 assume ~send3~0 == ~id3~0; 462#L286 assume 0 == ~mode3~0 % 256; 526#L287 assume ~id4~0 >= 0; 470#L288 assume 0 == ~st4~0; 471#L289 assume ~send4~0 == ~id4~0; 515#L290 assume 0 == ~mode4~0 % 256; 516#L291 assume ~id5~0 >= 0; 540#L292 assume 0 == ~st5~0; 486#L293 assume ~send5~0 == ~id5~0; 487#L294 assume 0 == ~mode5~0 % 256; 524#L295 assume ~id6~0 >= 0; 465#L296 assume 0 == ~st6~0; 466#L297 assume ~send6~0 == ~id6~0; 527#L298 assume 0 == ~mode6~0 % 256; 474#L299 assume ~id1~0 != ~id2~0; 475#L300 assume ~id1~0 != ~id3~0; 517#L301 assume ~id1~0 != ~id4~0; 518#L302 assume ~id1~0 != ~id5~0; 531#L303 assume ~id1~0 != ~id6~0; 499#L304 assume ~id2~0 != ~id3~0; 500#L305 assume ~id2~0 != ~id4~0; 528#L306 assume ~id2~0 != ~id5~0; 472#L307 assume ~id2~0 != ~id6~0; 473#L308 assume ~id3~0 != ~id4~0; 525#L309 assume ~id3~0 != ~id5~0; 463#L310 assume ~id3~0 != ~id6~0; 464#L311 assume ~id4~0 != ~id5~0; 502#L312 assume ~id4~0 != ~id6~0; 503#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 454#L274-1 init_#res := init_~tmp~0; 455#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 479#L513-2 [2018-12-01 19:45:03,738 INFO L796 eck$LassoCheckResult]: Loop: 479#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 480#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 481#L124 assume !(node1_~m1~0 != ~nomsg~0); 490#L124-1 ~mode1~0 := 0; 476#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 477#L148 assume !(0 != ~mode2~0 % 256); 496#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 494#L161-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; 495#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 548#L173 assume !(0 != ~mode3~0 % 256); 450#L186 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 451#L186-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; 483#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 542#L198 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 535#L201 assume !(node4_~m4~0 != ~nomsg~0); 498#L201-1 ~mode4~0 := 0; 534#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 544#L223 assume !(0 != ~mode5~0 % 256); 545#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 551#L236-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; 532#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 533#L248 assume !(0 != ~mode6~0 % 256); 538#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 547#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 521#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 536#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 514#L444 assume ~r1~0 >= 6; 510#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 520#L443-1 check_#res := check_~tmp~1; 530#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 507#L546 assume !(0 == assert_~arg % 256); 478#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 479#L513-2 [2018-12-01 19:45:03,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2018-12-01 19:45:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 360303399, now seen corresponding path program 1 times [2018-12-01 19:45:03,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:45:03,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:03,783 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-01 19:45:03,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:45:03,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:45:03,783 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 19:45:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:45:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:45:03,784 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-12-01 19:45:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:45:03,807 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2018-12-01 19:45:03,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:45:03,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2018-12-01 19:45:03,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-12-01 19:45:03,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2018-12-01 19:45:03,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-12-01 19:45:03,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-12-01 19:45:03,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2018-12-01 19:45:03,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:45:03,812 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-12-01 19:45:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2018-12-01 19:45:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-01 19:45:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-01 19:45:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2018-12-01 19:45:03,819 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-12-01 19:45:03,819 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-12-01 19:45:03,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 19:45:03,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2018-12-01 19:45:03,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-12-01 19:45:03,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 19:45:03,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 19:45:03,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:45:03,822 INFO L794 eck$LassoCheckResult]: Stem: 811#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 729#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 721#L274 assume 0 == ~r1~0; 722#L275 assume ~id1~0 >= 0; 770#L276 assume 0 == ~st1~0; 730#L277 assume ~send1~0 == ~id1~0; 731#L278 assume 0 == ~mode1~0 % 256; 775#L279 assume ~id2~0 >= 0; 776#L280 assume 0 == ~st2~0; 804#L281 assume ~send2~0 == ~id2~0; 746#L282 assume 0 == ~mode2~0 % 256; 747#L283 assume ~id3~0 >= 0; 787#L284 assume 0 == ~st3~0; 723#L285 assume ~send3~0 == ~id3~0; 724#L286 assume 0 == ~mode3~0 % 256; 790#L287 assume ~id4~0 >= 0; 732#L288 assume 0 == ~st4~0; 733#L289 assume ~send4~0 == ~id4~0; 779#L290 assume 0 == ~mode4~0 % 256; 780#L291 assume ~id5~0 >= 0; 805#L292 assume 0 == ~st5~0; 748#L293 assume ~send5~0 == ~id5~0; 749#L294 assume 0 == ~mode5~0 % 256; 788#L295 assume ~id6~0 >= 0; 727#L296 assume 0 == ~st6~0; 728#L297 assume ~send6~0 == ~id6~0; 791#L298 assume 0 == ~mode6~0 % 256; 736#L299 assume ~id1~0 != ~id2~0; 737#L300 assume ~id1~0 != ~id3~0; 781#L301 assume ~id1~0 != ~id4~0; 782#L302 assume ~id1~0 != ~id5~0; 795#L303 assume ~id1~0 != ~id6~0; 761#L304 assume ~id2~0 != ~id3~0; 762#L305 assume ~id2~0 != ~id4~0; 792#L306 assume ~id2~0 != ~id5~0; 734#L307 assume ~id2~0 != ~id6~0; 735#L308 assume ~id3~0 != ~id4~0; 789#L309 assume ~id3~0 != ~id5~0; 725#L310 assume ~id3~0 != ~id6~0; 726#L311 assume ~id4~0 != ~id5~0; 764#L312 assume ~id4~0 != ~id6~0; 765#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 716#L274-1 init_#res := init_~tmp~0; 717#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 800#L513-2 [2018-12-01 19:45:03,822 INFO L796 eck$LassoCheckResult]: Loop: 800#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 742#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 743#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 738#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 739#L148 assume !(0 != ~mode2~0 % 256); 758#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 756#L161-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; 757#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 814#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 806#L176 assume !(node3_~m3~0 != ~nomsg~0); 755#L176-1 ~mode3~0 := 0; 745#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 807#L198 assume !(0 != ~mode4~0 % 256); 808#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 816#L211-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 798#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 809#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 802#L226 assume !(node5_~m5~0 != ~nomsg~0); 715#L226-1 ~mode5~0 := 0; 796#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 797#L248 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 786#L251 assume !(node6_~m6~0 != ~nomsg~0); 719#L251-1 ~mode6~0 := 0; 785#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 801#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 812#L444 assume !(~r1~0 >= 6); 772#L447 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 773#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L443-1 check_#res := check_~tmp~1; 864#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L546 assume !(0 == assert_~arg % 256); 862#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 800#L513-2 [2018-12-01 19:45:03,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2018-12-01 19:45:03,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash -482565050, now seen corresponding path program 1 times [2018-12-01 19:45:03,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:45:03,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:45:03,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash 665183270, now seen corresponding path program 1 times [2018-12-01 19:45:03,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:45:03,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:45:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:45:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:45:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:03,927 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-01 19:45:03,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:45:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:45:04,279 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 168 [2018-12-01 19:45:06,174 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 164 DAG size of output: 153 [2018-12-01 19:45:06,182 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:45:06,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:45:06,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:45:06,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:45:06,183 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 19:45:06,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:45:06,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:45:06,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:45:06,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-12-01 19:45:06,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:45:06,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:45:06,198 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-01 19:45:06,241 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-01 19:45:06,248 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-01 19:45:06,249 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-01 19:45:06,250 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-01 19:45:06,251 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-01 19:45:06,252 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-01 19:45:06,277 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-01 19:45:06,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-01 19:45:06,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,282 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-01 19:45:06,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-01 19:45:06,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-01 19:45:06,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,411 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-12-01 19:45:06,412 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-01 19:45:06,413 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-01 19:45:06,414 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-01 19:45:06,416 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-01 19:45:06,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,420 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-01 19:45:06,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,427 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-01 19:45:06,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,434 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-01 19:45:06,435 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-01 19:45:06,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:06,443 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-01 19:45:06,644 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-01 19:45:06,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-01 19:45:12,754 WARN L180 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-12-01 19:45:12,851 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:45:12,852 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/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-01 19:45:12,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 19:45:12,856 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7a2a856-d7e6-4b7d-9996-3221e36498cc/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-01 19:45:12,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 19:45:12,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 19:45:12,985 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 19:45:12,987 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 19:45:12,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 19:45:12,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 19:45:12,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 19:45:12,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 19:45:12,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 19:45:12,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 19:45:12,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 19:45:12,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-12-01 19:45:12,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 19:45:12,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 19:45:12,990 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-01 19:45:13,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:13,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:13,036 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-01 19:45:13,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:13,042 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-01 19:45:13,043 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-01 19:45:13,077 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-01 19:45:13,078 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-01 19:45:13,081 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-01 19:45:13,083 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-01 19:45:13,084 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-01 19:45:13,088 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-01 19:45:13,089 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-01 19:45:13,091 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-01 19:45:13,092 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-01 19:45:13,193 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-01 19:45:13,195 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-01 19:45:13,198 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-01 19:45:13,200 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-01 19:45:13,201 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-01 19:45:13,203 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-01 19:45:13,205 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-01 19:45:13,206 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-01 19:45:13,209 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-01 19:45:13,210 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-01 19:45:13,211 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-01 19:45:13,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 19:45:13,215 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-01 19:45:13,216 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-01 19:45:13,220 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-01 19:45:13,222 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-01 19:45:13,224 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-01 19:45:13,424 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-01 19:45:13,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-01 19:45:17,854 WARN L180 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-12-01 19:45:17,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 19:45:17,910 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 19:45:17,911 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-01 19:45:17,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,916 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-01 19:45:17,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,918 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-01 19:45:17,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,921 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-01 19:45:17,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,922 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-01 19:45:17,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,924 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-01 19:45:17,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,924 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 19:45:17,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 19:45:17,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,927 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-01 19:45:17,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,929 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-01 19:45:17,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,932 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-01 19:45:17,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,934 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-01 19:45:17,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,937 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-01 19:45:17,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,939 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-01 19:45:17,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:17,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:17,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,940 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-01 19:45:17,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,943 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-01 19:45:17,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:17,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 19:45:17,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 19:45:17,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:17,945 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-01 19:45:17,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:17,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:17,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:17,946 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-12-01 19:45:17,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:17,965 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-12-01 19:45:17,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:18,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:18,025 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-01 19:45:18,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:18,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:18,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:18,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:18,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:18,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:18,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:18,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:18,027 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-01 19:45:18,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:18,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:18,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:18,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:18,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:18,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:18,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:18,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 19:45:18,029 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-01 19:45:18,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 19:45:18,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 19:45:18,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 19:45:18,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 19:45:18,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 19:45:18,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 19:45:18,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 19:45:18,030 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 19:45:18,032 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 19:45:18,032 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 19:45:18,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 19:45:18,033 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 19:45:18,034 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 19:45:18,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-12-01 19:45:18,034 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 19:45:18,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:45:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:18,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:45:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:45:18,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:45:18,106 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-01 19:45:18,108 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-01 19:45:18,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-12-01 19:45:18,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2018-12-01 19:45:18,144 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-01 19:45:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 19:45:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-12-01 19:45:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2018-12-01 19:45:18,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:45:18,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2018-12-01 19:45:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:45:18,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2018-12-01 19:45:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 19:45:18,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2018-12-01 19:45:18,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:45:18,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2018-12-01 19:45:18,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 19:45:18,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 19:45:18,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 19:45:18,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:45:18,151 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:45:18,151 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:45:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:45:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:45:18,152 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-01 19:45:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:45:18,152 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-01 19:45:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 19:45:18,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-01 19:45:18,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:45:18,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:45:18,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 19:45:18,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 19:45:18,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 19:45:18,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 19:45:18,153 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:45:18,153 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:45:18,153 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:45:18,153 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 19:45:18,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:45:18,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 19:45:18,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 19:45:18,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 07:45:18 BoogieIcfgContainer [2018-12-01 19:45:18,158 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 19:45:18,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:45:18,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:45:18,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:45:18,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:45:03" (3/4) ... [2018-12-01 19:45:18,162 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 19:45:18,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:45:18,163 INFO L168 Benchmark]: Toolchain (without parser) took 15523.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -212.4 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,163 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:45:18,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,165 INFO L168 Benchmark]: Boogie Preprocessor took 21.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,165 INFO L168 Benchmark]: RCFGBuilder took 324.07 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,165 INFO L168 Benchmark]: BuchiAutomizer took 14905.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2018-12-01 19:45:18,166 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:45:18,168 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.07 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14905.82 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. 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 + 23 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 14.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 14.5s. 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 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1562 mio100 ax104 hnf100 lsp10 ukn72 mio100 lsp100 div153 bol100 ite100 ukn100 eq177 hnf71 smp100 dnf5369 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...