./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/toy1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/toy1_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:42:39,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:42:39,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:42:39,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:42:39,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:42:39,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:42:39,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:42:39,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:42:39,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:42:39,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:42:39,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:42:39,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:42:39,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:42:39,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:42:39,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:42:39,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:42:39,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:42:39,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:42:39,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:42:39,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:42:39,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:42:39,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:42:39,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:42:39,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:42:39,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:42:39,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:42:39,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:42:39,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:42:39,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:42:39,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:42:39,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:42:39,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:42:39,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:42:39,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:42:39,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:42:39,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:42:39,970 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:42:39,986 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:42:39,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:42:39,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:42:39,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:42:39,988 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:42:39,988 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:42:39,988 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:42:39,989 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:42:39,989 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:42:39,989 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:42:39,989 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:42:39,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:42:39,989 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:42:39,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:42:39,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:42:39,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:42:39,992 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:42:39,992 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:42:39,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:42:39,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:42:39,993 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:42:39,994 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:42:39,994 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2019-01-14 04:42:40,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:42:40,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:42:40,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:42:40,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:42:40,051 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:42:40,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:40,107 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae706dd2f/3987f76e181a471baf55dea2b5ac5a72/FLAGe8dfc40e4 [2019-01-14 04:42:40,550 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:42:40,551 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/toy1_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:40,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae706dd2f/3987f76e181a471baf55dea2b5ac5a72/FLAGe8dfc40e4 [2019-01-14 04:42:40,891 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae706dd2f/3987f76e181a471baf55dea2b5ac5a72 [2019-01-14 04:42:40,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:42:40,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:42:40,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:42:40,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:42:40,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:42:40,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:42:40" (1/1) ... [2019-01-14 04:42:40,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398d0f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:40, skipping insertion in model container [2019-01-14 04:42:40,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:42:40" (1/1) ... [2019-01-14 04:42:40,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:42:40,977 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:42:41,272 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:42:41,284 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:42:41,396 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:42:41,417 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:42:41,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41 WrapperNode [2019-01-14 04:42:41,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:42:41,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:42:41,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:42:41,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:42:41,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:42:41,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:42:41,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:42:41,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:42:41,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... [2019-01-14 04:42:41,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:42:41,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:42:41,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:42:41,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:42:41,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:42:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:42:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:42:42,728 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:42:42,729 INFO L286 CfgBuilder]: Removed 28 assue(true) statements. [2019-01-14 04:42:42,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:42 BoogieIcfgContainer [2019-01-14 04:42:42,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:42:42,731 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:42:42,731 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:42:42,734 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:42:42,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:42,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:42:40" (1/3) ... [2019-01-14 04:42:42,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30cffb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:42:42, skipping insertion in model container [2019-01-14 04:42:42,736 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:42,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:42:41" (2/3) ... [2019-01-14 04:42:42,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30cffb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:42:42, skipping insertion in model container [2019-01-14 04:42:42,737 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:42:42,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:42" (3/3) ... [2019-01-14 04:42:42,738 INFO L375 chiAutomizerObserver]: Analyzing ICFG toy1_false-unreach-call_false-termination.cil.c [2019-01-14 04:42:42,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:42:42,793 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:42:42,793 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:42:42,794 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:42:42,794 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:42:42,794 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:42:42,794 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:42:42,794 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:42:42,795 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:42:42,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-01-14 04:42:42,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:42:42,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:42,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:42,855 INFO L867 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] [2019-01-14 04:42:42,856 INFO L868 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] [2019-01-14 04:42:42,856 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:42:42,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2019-01-14 04:42:42,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:42:42,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:42,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:42,867 INFO L867 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] [2019-01-14 04:42:42,867 INFO L868 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] [2019-01-14 04:42:42,875 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRYtrue ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 29#L406true assume !(1 == ~c_req_up~0); 16#L406-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 31#L417-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 49#L422-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 72#L427-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 93#L432-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 106#L437-1true assume !(0 == ~e_f~0); 3#L442-1true assume !(0 == ~e_g~0); 33#L447-1true assume !(0 == ~e_e~0); 54#L452-1true assume !(0 == ~e_c~0); 77#L457-1true assume !(0 == ~e_wl~0); 97#L462-1true assume !(1 == ~wl_pc~0); 67#L474true assume !(2 == ~wl_pc~0); 21#L475true assume !(1 == ~c1_pc~0); 65#L485true assume !(1 == ~c2_pc~0); 24#L494true assume !(1 == ~wb_pc~0); 118#L503true assume !(1 == ~e_c~0); 90#L512-1true assume !(1 == ~e_e~0); 94#L517-1true assume !(1 == ~e_f~0); 122#L522-1true assume !(1 == ~e_g~0); 25#L527-1true assume !(1 == ~e_c~0); 46#L532-1true assume !(1 == ~e_wl~0); 101#L674-1true [2019-01-14 04:42:42,876 INFO L796 eck$LassoCheckResult]: Loop: 101#L674-1true assume !false; 10#L544true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 126#L379true assume !true; 30#L395true start_simulation_~kernel_st~0 := 2; 112#L550true assume !(1 == ~c_req_up~0); 95#L550-2true start_simulation_~kernel_st~0 := 3; 62#L562true assume 0 == ~e_f~0;~e_f~0 := 1; 64#L562-2true assume 0 == ~e_g~0;~e_g~0 := 1; 87#L567-1true assume 0 == ~e_e~0;~e_e~0 := 1; 114#L572-1true assume !(0 == ~e_c~0); 11#L577-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 41#L582-1true assume 1 == ~wl_pc~0; 8#L588true assume 1 == ~e_wl~0;~wl_st~0 := 0; 61#L595true assume !(1 == ~c1_pc~0); 108#L605true assume !(1 == ~c2_pc~0); 80#L614true assume !(1 == ~wb_pc~0); 51#L623true assume 1 == ~e_c~0;~r_st~0 := 0; 6#L632-1true assume 1 == ~e_e~0;~e_e~0 := 2; 38#L637-1true assume 1 == ~e_f~0;~e_f~0 := 2; 58#L642-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L647-1true assume !(1 == ~e_c~0); 103#L652-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 129#L657-1true assume 0 == ~wl_st~0; 101#L674-1true [2019-01-14 04:42:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2019-01-14 04:42:42,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:42,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:42,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:42,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:42,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,062 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 476885301, now seen corresponding path program 1 times [2019-01-14 04:42:43,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:42:43,074 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:43,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:42:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:42:43,093 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2019-01-14 04:42:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:43,111 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2019-01-14 04:42:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:42:43,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2019-01-14 04:42:43,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2019-01-14 04:42:43,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-01-14 04:42:43,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-01-14 04:42:43,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2019-01-14 04:42:43,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:43,137 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-01-14 04:42:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2019-01-14 04:42:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 04:42:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:42:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2019-01-14 04:42:43,175 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-01-14 04:42:43,175 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2019-01-14 04:42:43,175 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:42:43,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2019-01-14 04:42:43,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:43,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:43,180 INFO L867 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] [2019-01-14 04:42:43,180 INFO L868 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] [2019-01-14 04:42:43,181 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 292#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 293#L406 assume !(1 == ~c_req_up~0); 294#L406-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 295#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 318#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 341#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 363#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 376#L437-1 assume !(0 == ~e_f~0); 263#L442-1 assume !(0 == ~e_g~0); 264#L447-1 assume !(0 == ~e_e~0); 321#L452-1 assume !(0 == ~e_c~0); 346#L457-1 assume !(0 == ~e_wl~0); 366#L462-1 assume !(1 == ~wl_pc~0); 360#L474 assume !(2 == ~wl_pc~0); 303#L475 assume !(1 == ~c1_pc~0); 299#L485 assume !(1 == ~c2_pc~0); 308#L494 assume !(1 == ~wb_pc~0); 309#L503 assume !(1 == ~e_c~0); 373#L512-1 assume !(1 == ~e_e~0); 374#L517-1 assume !(1 == ~e_f~0); 377#L522-1 assume !(1 == ~e_g~0); 311#L527-1 assume !(1 == ~e_c~0); 312#L532-1 assume !(1 == ~e_wl~0); 267#L674-1 [2019-01-14 04:42:43,181 INFO L796 eck$LassoCheckResult]: Loop: 267#L674-1 assume !false; 281#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 282#L379 assume !false; 372#L297 assume !(0 == ~wl_st~0); 340#L301 assume !(0 == ~c1_st~0); 331#L304 assume !(0 == ~c2_st~0); 297#L307 assume !(0 == ~wb_st~0); 278#L310 assume !(0 == ~r_st~0); 280#L395 start_simulation_~kernel_st~0 := 2; 317#L550 assume !(1 == ~c_req_up~0); 359#L550-2 start_simulation_~kernel_st~0 := 3; 353#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 354#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 357#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 371#L572-1 assume !(0 == ~e_c~0); 283#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 284#L582-1 assume 1 == ~wl_pc~0; 275#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 276#L595 assume !(1 == ~c1_pc~0); 352#L605 assume !(1 == ~c2_pc~0); 327#L614 assume !(1 == ~wb_pc~0); 344#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 270#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 271#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 328#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 350#L647-1 assume !(1 == ~e_c~0); 368#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 380#L657-1 assume 0 == ~wl_st~0; 267#L674-1 [2019-01-14 04:42:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2019-01-14 04:42:43,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 1 times [2019-01-14 04:42:43,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,321 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:43,321 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2019-01-14 04:42:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:43,367 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2019-01-14 04:42:43,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:43,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2019-01-14 04:42:43,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2019-01-14 04:42:43,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-01-14 04:42:43,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-01-14 04:42:43,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2019-01-14 04:42:43,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:43,377 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-01-14 04:42:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2019-01-14 04:42:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 04:42:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:42:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2019-01-14 04:42:43,387 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-01-14 04:42:43,387 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-01-14 04:42:43,388 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:42:43,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2019-01-14 04:42:43,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:43,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:43,392 INFO L867 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] [2019-01-14 04:42:43,393 INFO L868 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] [2019-01-14 04:42:43,393 INFO L794 eck$LassoCheckResult]: Stem: 624#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 541#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 542#L406 assume !(1 == ~c_req_up~0); 543#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 544#L417-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 567#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 590#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 612#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 625#L437-1 assume !(0 == ~e_f~0); 512#L442-1 assume !(0 == ~e_g~0); 513#L447-1 assume !(0 == ~e_e~0); 570#L452-1 assume !(0 == ~e_c~0); 595#L457-1 assume !(0 == ~e_wl~0); 615#L462-1 assume !(1 == ~wl_pc~0); 609#L474 assume !(2 == ~wl_pc~0); 552#L475 assume !(1 == ~c1_pc~0); 548#L485 assume !(1 == ~c2_pc~0); 557#L494 assume !(1 == ~wb_pc~0); 558#L503 assume !(1 == ~e_c~0); 622#L512-1 assume !(1 == ~e_e~0); 623#L517-1 assume !(1 == ~e_f~0); 626#L522-1 assume !(1 == ~e_g~0); 560#L527-1 assume !(1 == ~e_c~0); 561#L532-1 assume !(1 == ~e_wl~0); 516#L674-1 [2019-01-14 04:42:43,393 INFO L796 eck$LassoCheckResult]: Loop: 516#L674-1 assume !false; 530#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 531#L379 assume !false; 621#L297 assume !(0 == ~wl_st~0); 589#L301 assume !(0 == ~c1_st~0); 580#L304 assume !(0 == ~c2_st~0); 546#L307 assume !(0 == ~wb_st~0); 527#L310 assume !(0 == ~r_st~0); 529#L395 start_simulation_~kernel_st~0 := 2; 566#L550 assume !(1 == ~c_req_up~0); 608#L550-2 start_simulation_~kernel_st~0 := 3; 602#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 603#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 606#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 620#L572-1 assume !(0 == ~e_c~0); 532#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 533#L582-1 assume 1 == ~wl_pc~0; 524#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 525#L595 assume !(1 == ~c1_pc~0); 601#L605 assume !(1 == ~c2_pc~0); 576#L614 assume !(1 == ~wb_pc~0); 593#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 519#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 520#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 577#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 599#L647-1 assume !(1 == ~e_c~0); 617#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 629#L657-1 assume 0 == ~wl_st~0; 516#L674-1 [2019-01-14 04:42:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2019-01-14 04:42:43,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 2 times [2019-01-14 04:42:43,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,571 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:43,571 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 3 states. [2019-01-14 04:42:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:43,606 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2019-01-14 04:42:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:43,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 213 transitions. [2019-01-14 04:42:43,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 213 transitions. [2019-01-14 04:42:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-01-14 04:42:43,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-01-14 04:42:43,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 213 transitions. [2019-01-14 04:42:43,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:43,614 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-01-14 04:42:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 213 transitions. [2019-01-14 04:42:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 04:42:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:42:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2019-01-14 04:42:43,624 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-01-14 04:42:43,624 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 213 transitions. [2019-01-14 04:42:43,625 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:42:43,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 213 transitions. [2019-01-14 04:42:43,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:43,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:43,632 INFO L867 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] [2019-01-14 04:42:43,632 INFO L868 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] [2019-01-14 04:42:43,632 INFO L794 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 790#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 791#L406 assume !(1 == ~c_req_up~0); 792#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 793#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 816#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 839#L427-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 861#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L437-1 assume !(0 == ~e_f~0); 761#L442-1 assume !(0 == ~e_g~0); 762#L447-1 assume !(0 == ~e_e~0); 819#L452-1 assume !(0 == ~e_c~0); 844#L457-1 assume !(0 == ~e_wl~0); 864#L462-1 assume !(1 == ~wl_pc~0); 858#L474 assume !(2 == ~wl_pc~0); 801#L475 assume !(1 == ~c1_pc~0); 797#L485 assume !(1 == ~c2_pc~0); 806#L494 assume !(1 == ~wb_pc~0); 807#L503 assume !(1 == ~e_c~0); 871#L512-1 assume !(1 == ~e_e~0); 872#L517-1 assume !(1 == ~e_f~0); 875#L522-1 assume !(1 == ~e_g~0); 809#L527-1 assume !(1 == ~e_c~0); 810#L532-1 assume !(1 == ~e_wl~0); 765#L674-1 [2019-01-14 04:42:43,632 INFO L796 eck$LassoCheckResult]: Loop: 765#L674-1 assume !false; 779#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 780#L379 assume !false; 870#L297 assume !(0 == ~wl_st~0); 838#L301 assume !(0 == ~c1_st~0); 829#L304 assume !(0 == ~c2_st~0); 795#L307 assume !(0 == ~wb_st~0); 776#L310 assume !(0 == ~r_st~0); 778#L395 start_simulation_~kernel_st~0 := 2; 815#L550 assume !(1 == ~c_req_up~0); 857#L550-2 start_simulation_~kernel_st~0 := 3; 851#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 852#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 855#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 869#L572-1 assume !(0 == ~e_c~0); 781#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 782#L582-1 assume 1 == ~wl_pc~0; 773#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 774#L595 assume !(1 == ~c1_pc~0); 850#L605 assume !(1 == ~c2_pc~0); 825#L614 assume !(1 == ~wb_pc~0); 842#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 768#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 769#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 826#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 848#L647-1 assume !(1 == ~e_c~0); 866#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 878#L657-1 assume 0 == ~wl_st~0; 765#L674-1 [2019-01-14 04:42:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2019-01-14 04:42:43,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:43,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,718 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash 243708147, now seen corresponding path program 3 times [2019-01-14 04:42:43,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,765 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:43,766 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. cyclomatic complexity: 93 Second operand 3 states. [2019-01-14 04:42:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:43,797 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2019-01-14 04:42:43,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:43,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 212 transitions. [2019-01-14 04:42:43,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 212 transitions. [2019-01-14 04:42:43,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-01-14 04:42:43,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-01-14 04:42:43,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 212 transitions. [2019-01-14 04:42:43,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:43,803 INFO L706 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-01-14 04:42:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 212 transitions. [2019-01-14 04:42:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-14 04:42:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 04:42:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2019-01-14 04:42:43,810 INFO L729 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-01-14 04:42:43,810 INFO L609 BuchiCegarLoop]: Abstraction has 121 states and 212 transitions. [2019-01-14 04:42:43,811 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:42:43,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 212 transitions. [2019-01-14 04:42:43,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-14 04:42:43,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:43,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:43,815 INFO L867 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] [2019-01-14 04:42:43,815 INFO L868 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] [2019-01-14 04:42:43,816 INFO L794 eck$LassoCheckResult]: Stem: 1122#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1039#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1040#L406 assume !(1 == ~c_req_up~0); 1041#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1042#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1065#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1088#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1110#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1123#L437-1 assume !(0 == ~e_f~0); 1010#L442-1 assume !(0 == ~e_g~0); 1011#L447-1 assume !(0 == ~e_e~0); 1068#L452-1 assume !(0 == ~e_c~0); 1093#L457-1 assume !(0 == ~e_wl~0); 1113#L462-1 assume !(1 == ~wl_pc~0); 1107#L474 assume !(2 == ~wl_pc~0); 1050#L475 assume !(1 == ~c1_pc~0); 1046#L485 assume !(1 == ~c2_pc~0); 1055#L494 assume !(1 == ~wb_pc~0); 1056#L503 assume !(1 == ~e_c~0); 1120#L512-1 assume !(1 == ~e_e~0); 1121#L517-1 assume !(1 == ~e_f~0); 1124#L522-1 assume !(1 == ~e_g~0); 1058#L527-1 assume !(1 == ~e_c~0); 1059#L532-1 assume !(1 == ~e_wl~0); 1014#L674-1 [2019-01-14 04:42:43,816 INFO L796 eck$LassoCheckResult]: Loop: 1014#L674-1 assume !false; 1028#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1029#L379 assume !false; 1119#L297 assume !(0 == ~wl_st~0); 1087#L301 assume !(0 == ~c1_st~0); 1078#L304 assume !(0 == ~c2_st~0); 1044#L307 assume !(0 == ~wb_st~0); 1025#L310 assume !(0 == ~r_st~0); 1027#L395 start_simulation_~kernel_st~0 := 2; 1064#L550 assume !(1 == ~c_req_up~0); 1106#L550-2 start_simulation_~kernel_st~0 := 3; 1100#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1101#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1104#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1118#L572-1 assume !(0 == ~e_c~0); 1030#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1031#L582-1 assume !(1 == ~wl_pc~0); 1024#L594 assume !(2 == ~wl_pc~0); 1023#L595 assume !(1 == ~c1_pc~0); 1099#L605 assume !(1 == ~c2_pc~0); 1074#L614 assume !(1 == ~wb_pc~0); 1091#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1017#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1018#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1075#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1097#L647-1 assume !(1 == ~e_c~0); 1115#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1127#L657-1 assume 0 == ~wl_st~0; 1014#L674-1 [2019-01-14 04:42:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2019-01-14 04:42:43,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash 792967868, now seen corresponding path program 1 times [2019-01-14 04:42:43,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:43,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:43,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:43,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:43,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:43,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:43,931 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-01-14 04:42:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:43,996 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2019-01-14 04:42:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:43,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 272 transitions. [2019-01-14 04:42:44,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-01-14 04:42:44,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 272 transitions. [2019-01-14 04:42:44,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-01-14 04:42:44,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2019-01-14 04:42:44,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 272 transitions. [2019-01-14 04:42:44,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:42:44,006 INFO L706 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-01-14 04:42:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 272 transitions. [2019-01-14 04:42:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-14 04:42:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-14 04:42:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 272 transitions. [2019-01-14 04:42:44,017 INFO L729 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-01-14 04:42:44,017 INFO L609 BuchiCegarLoop]: Abstraction has 153 states and 272 transitions. [2019-01-14 04:42:44,017 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:42:44,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 272 transitions. [2019-01-14 04:42:44,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-01-14 04:42:44,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:44,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:44,022 INFO L867 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] [2019-01-14 04:42:44,022 INFO L868 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] [2019-01-14 04:42:44,022 INFO L794 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1319#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1320#L406 assume !(1 == ~c_req_up~0); 1321#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1322#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1345#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1369#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1393#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1407#L437-1 assume !(0 == ~e_f~0); 1293#L442-1 assume !(0 == ~e_g~0); 1294#L447-1 assume !(0 == ~e_e~0); 1348#L452-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1375#L457-1 assume !(0 == ~e_wl~0); 1396#L462-1 assume !(1 == ~wl_pc~0); 1390#L474 assume !(2 == ~wl_pc~0); 1330#L475 assume !(1 == ~c1_pc~0); 1326#L485 assume !(1 == ~c2_pc~0); 1335#L494 assume !(1 == ~wb_pc~0); 1336#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 1416#L512-1 assume !(1 == ~e_e~0); 1408#L517-1 assume !(1 == ~e_f~0); 1409#L522-1 assume !(1 == ~e_g~0); 1338#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1339#L532-1 assume !(1 == ~e_wl~0); 1292#L674-1 [2019-01-14 04:42:44,024 INFO L796 eck$LassoCheckResult]: Loop: 1292#L674-1 assume !false; 1308#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1309#L379 assume !false; 1403#L297 assume !(0 == ~wl_st~0); 1368#L301 assume !(0 == ~c1_st~0); 1359#L304 assume !(0 == ~c2_st~0); 1324#L307 assume !(0 == ~wb_st~0); 1305#L310 assume !(0 == ~r_st~0); 1307#L395 start_simulation_~kernel_st~0 := 2; 1344#L550 assume !(1 == ~c_req_up~0); 1389#L550-2 start_simulation_~kernel_st~0 := 3; 1383#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 1384#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1387#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1402#L572-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1415#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1442#L582-1 assume 1 == ~wl_pc~0; 1440#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1438#L595 assume !(1 == ~c1_pc~0); 1436#L605 assume !(1 == ~c2_pc~0); 1398#L614 assume !(1 == ~wb_pc~0); 1372#L623 assume 1 == ~e_c~0;~r_st~0 := 0; 1373#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1355#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1356#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1378#L647-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1397#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1412#L657-1 assume 0 == ~wl_st~0; 1292#L674-1 [2019-01-14 04:42:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2019-01-14 04:42:44,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:44,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:44,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:44,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:44,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1254823475, now seen corresponding path program 1 times [2019-01-14 04:42:44,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:44,474 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-14 04:42:44,649 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 04:42:44,664 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:44,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:44,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:44,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:44,666 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:42:44,666 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:44,666 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:44,666 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:44,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:42:44,667 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:44,667 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:44,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:45,317 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:42:45,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:45,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:45,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:45,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:42:45,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:45,354 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:45,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:42:45,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:45,401 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:42:45,450 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:45,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:45,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:45,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:45,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:42:45,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:45,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:45,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:45,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-14 04:42:45,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:45,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:45,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:45,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:46,221 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:42:46,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:46,436 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:42:46,438 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 [2019-01-14 04:42:46,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:46,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:46,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:46,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:46,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:46,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:46,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:46,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:46,448 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 [2019-01-14 04:42:46,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:46,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:46,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:46,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:46,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:46,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:46,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:46,458 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:42:46,463 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:42:46,465 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:42:46,467 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:42:46,468 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:42:46,468 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:42:46,469 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2019-01-14 04:42:46,470 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:42:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:46,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:46,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:46,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:42:46,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120 Second operand 5 states. [2019-01-14 04:42:47,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153 states and 272 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 474 states and 835 transitions. Complement of second has 5 states. [2019-01-14 04:42:47,019 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 [2019-01-14 04:42:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:42:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2019-01-14 04:42:47,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2019-01-14 04:42:47,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:47,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2019-01-14 04:42:47,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:47,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2019-01-14 04:42:47,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:47,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 474 states and 835 transitions. [2019-01-14 04:42:47,055 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 302 [2019-01-14 04:42:47,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 474 states to 459 states and 805 transitions. [2019-01-14 04:42:47,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2019-01-14 04:42:47,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2019-01-14 04:42:47,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 805 transitions. [2019-01-14 04:42:47,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:47,063 INFO L706 BuchiCegarLoop]: Abstraction has 459 states and 805 transitions. [2019-01-14 04:42:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 805 transitions. [2019-01-14 04:42:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 351. [2019-01-14 04:42:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-14 04:42:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 616 transitions. [2019-01-14 04:42:47,109 INFO L729 BuchiCegarLoop]: Abstraction has 351 states and 616 transitions. [2019-01-14 04:42:47,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:47,109 INFO L87 Difference]: Start difference. First operand 351 states and 616 transitions. Second operand 4 states. [2019-01-14 04:42:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:47,845 INFO L93 Difference]: Finished difference Result 640 states and 1104 transitions. [2019-01-14 04:42:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:42:47,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 640 states and 1104 transitions. [2019-01-14 04:42:47,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-01-14 04:42:47,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 640 states to 640 states and 1104 transitions. [2019-01-14 04:42:47,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2019-01-14 04:42:47,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2019-01-14 04:42:47,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 640 states and 1104 transitions. [2019-01-14 04:42:47,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:47,861 INFO L706 BuchiCegarLoop]: Abstraction has 640 states and 1104 transitions. [2019-01-14 04:42:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states and 1104 transitions. [2019-01-14 04:42:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 610. [2019-01-14 04:42:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-01-14 04:42:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1062 transitions. [2019-01-14 04:42:47,880 INFO L729 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-01-14 04:42:47,880 INFO L609 BuchiCegarLoop]: Abstraction has 610 states and 1062 transitions. [2019-01-14 04:42:47,880 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:42:47,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 610 states and 1062 transitions. [2019-01-14 04:42:47,885 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2019-01-14 04:42:47,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:47,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:47,887 INFO L867 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] [2019-01-14 04:42:47,890 INFO L868 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] [2019-01-14 04:42:47,890 INFO L794 eck$LassoCheckResult]: Stem: 3323#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3145#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3146#L406 assume !(1 == ~c_req_up~0); 3147#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3148#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3189#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3379#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3324#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3325#L437-1 assume !(0 == ~e_f~0); 3088#L442-1 assume !(0 == ~e_g~0); 3089#L447-1 assume !(0 == ~e_e~0); 3194#L452-1 assume !(0 == ~e_c~0); 3255#L457-1 assume !(0 == ~e_wl~0); 3373#L462-1 assume !(1 == ~wl_pc~0); 3371#L474 assume !(2 == ~wl_pc~0); 3370#L475 assume !(1 == ~c1_pc~0); 3411#L485 assume !(1 == ~c2_pc~0); 3409#L494 assume !(1 == ~wb_pc~0); 3407#L503 assume 1 == ~e_c~0;~r_st~0 := 0; 3321#L512-1 assume !(1 == ~e_e~0); 3322#L517-1 assume !(1 == ~e_f~0); 3326#L522-1 assume !(1 == ~e_g~0); 3176#L527-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3177#L532-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3092#L674-1 [2019-01-14 04:42:47,890 INFO L796 eck$LassoCheckResult]: Loop: 3092#L674-1 assume !false; 3336#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3646#L379 assume !false; 3645#L297 assume !(0 == ~wl_st~0); 3644#L301 assume !(0 == ~c1_st~0); 3214#L304 assume !(0 == ~c2_st~0); 3151#L307 assume !(0 == ~wb_st~0); 3153#L310 assume !(0 == ~r_st~0); 3639#L395 start_simulation_~kernel_st~0 := 2; 3637#L550 assume !(1 == ~c_req_up~0); 3327#L550-2 start_simulation_~kernel_st~0 := 3; 3328#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 3283#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3284#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3315#L572-1 assume !(0 == ~e_c~0); 3492#L577-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3491#L582-1 assume 1 == ~wl_pc~0; 3489#L588 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3488#L595 assume !(1 == ~c1_pc~0); 3481#L605 assume !(1 == ~c2_pc~0); 3475#L614 assume !(1 == ~wb_pc~0); 3471#L623 assume !(1 == ~e_c~0); 3468#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3465#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3462#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3459#L647-1 assume !(1 == ~e_c~0); 3306#L652-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3356#L657-1 assume 0 == ~wl_st~0; 3092#L674-1 [2019-01-14 04:42:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2019-01-14 04:42:47,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:47,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:48,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:48,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:48,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:48,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2018715509, now seen corresponding path program 1 times [2019-01-14 04:42:48,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:48,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:48,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:48,373 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-14 04:42:48,427 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:48,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:48,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:48,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:48,428 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:42:48,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:48,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:48,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-14 04:42:48,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:48,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:48,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:48,813 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:48,814 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:48,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:48,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:48,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:42:48,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:48,874 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,887 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:48,888 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=7} Honda state: {~e_c~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:48,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:48,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:48,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:48,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:48,946 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:48,946 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:48,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:48,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:48,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:48,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-1} Honda state: {~c1_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:49,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:49,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:49,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:49,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:49,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:49,027 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:49,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:42:49,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:49,058 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:42:49,078 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:49,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:49,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:49,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:49,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:42:49,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:49,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:49,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:49,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-14 04:42:49,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:49,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:49,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:49,635 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:49,636 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:42:49,636 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 [2019-01-14 04:42:49,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:49,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:49,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,640 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 [2019-01-14 04:42:49,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,644 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:49,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:49,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,646 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 [2019-01-14 04:42:49,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,651 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:49,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:49,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,655 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 [2019-01-14 04:42:49,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:49,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:49,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,663 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 [2019-01-14 04:42:49,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,666 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:49,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:49,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,670 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 [2019-01-14 04:42:49,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,671 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:49,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:49,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,676 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 [2019-01-14 04:42:49,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:49,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:49,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:49,684 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 [2019-01-14 04:42:49,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:49,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:49,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:49,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:49,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:49,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:49,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:49,692 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:42:49,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:42:49,695 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:42:49,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:42:49,696 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:42:49,696 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:42:49,696 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2019-01-14 04:42:49,699 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:42:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:49,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:49,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:49,858 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:42:49,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458 Second operand 5 states. [2019-01-14 04:42:50,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 610 states and 1062 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 1027 states and 1790 transitions. Complement of second has 5 states. [2019-01-14 04:42:50,013 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 [2019-01-14 04:42:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:42:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2019-01-14 04:42:50,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 28 letters. [2019-01-14 04:42:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:50,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 52 letters. Loop has 28 letters. [2019-01-14 04:42:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 363 transitions. Stem has 24 letters. Loop has 56 letters. [2019-01-14 04:42:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:50,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1027 states and 1790 transitions. [2019-01-14 04:42:50,029 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 573 [2019-01-14 04:42:50,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1027 states to 1021 states and 1780 transitions. [2019-01-14 04:42:50,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2019-01-14 04:42:50,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2019-01-14 04:42:50,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1021 states and 1780 transitions. [2019-01-14 04:42:50,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:50,042 INFO L706 BuchiCegarLoop]: Abstraction has 1021 states and 1780 transitions. [2019-01-14 04:42:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states and 1780 transitions. [2019-01-14 04:42:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 818. [2019-01-14 04:42:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-01-14 04:42:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1432 transitions. [2019-01-14 04:42:50,065 INFO L729 BuchiCegarLoop]: Abstraction has 818 states and 1432 transitions. [2019-01-14 04:42:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:50,065 INFO L87 Difference]: Start difference. First operand 818 states and 1432 transitions. Second operand 3 states. [2019-01-14 04:42:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:50,425 INFO L93 Difference]: Finished difference Result 1080 states and 1855 transitions. [2019-01-14 04:42:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:50,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1080 states and 1855 transitions. [2019-01-14 04:42:50,434 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-01-14 04:42:50,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1080 states to 1080 states and 1855 transitions. [2019-01-14 04:42:50,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2019-01-14 04:42:50,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2019-01-14 04:42:50,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1855 transitions. [2019-01-14 04:42:50,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:50,445 INFO L706 BuchiCegarLoop]: Abstraction has 1080 states and 1855 transitions. [2019-01-14 04:42:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1855 transitions. [2019-01-14 04:42:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1076. [2019-01-14 04:42:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-01-14 04:42:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1851 transitions. [2019-01-14 04:42:50,472 INFO L729 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-01-14 04:42:50,472 INFO L609 BuchiCegarLoop]: Abstraction has 1076 states and 1851 transitions. [2019-01-14 04:42:50,472 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:42:50,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1076 states and 1851 transitions. [2019-01-14 04:42:50,479 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 546 [2019-01-14 04:42:50,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:50,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:50,480 INFO L867 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] [2019-01-14 04:42:50,480 INFO L868 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] [2019-01-14 04:42:50,480 INFO L794 eck$LassoCheckResult]: Stem: 7037#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6857#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6858#L406 assume !(1 == ~c_req_up~0); 6859#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6860#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6948#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6949#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7002#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 7061#L437-1 assume !(0 == ~e_f~0); 7062#L442-1 assume !(0 == ~e_g~0); 6900#L447-1 assume !(0 == ~e_e~0); 6901#L452-1 assume !(0 == ~e_c~0); 7007#L457-1 assume !(0 == ~e_wl~0); 7008#L462-1 assume !(1 == ~wl_pc~0); 6995#L474 assume !(2 == ~wl_pc~0); 6996#L475 assume !(1 == ~c1_pc~0); 7097#L485 assume !(1 == ~c2_pc~0); 6880#L494 assume !(1 == ~wb_pc~0); 6881#L503 assume !(1 == ~e_c~0); 7035#L512-1 assume !(1 == ~e_e~0); 7036#L517-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7105#L522-1 assume !(1 == ~e_g~0); 6883#L527-1 assume !(1 == ~e_c~0); 6884#L532-1 assume !(1 == ~e_wl~0); 7409#L674-1 assume !false; 7410#L544 [2019-01-14 04:42:50,481 INFO L796 eck$LassoCheckResult]: Loop: 7410#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7511#L379 assume !false; 7512#L297 assume !(0 == ~wl_st~0); 7507#L301 assume !(0 == ~c1_st~0); 7508#L304 assume !(0 == ~c2_st~0); 7500#L307 assume !(0 == ~wb_st~0); 7501#L310 assume !(0 == ~r_st~0); 7573#L395 start_simulation_~kernel_st~0 := 2; 7568#L550 assume !(1 == ~c_req_up~0); 7565#L550-2 start_simulation_~kernel_st~0 := 3; 7562#L562 assume 0 == ~e_f~0;~e_f~0 := 1; 7560#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7561#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7556#L572-1 assume !(0 == ~e_c~0); 7557#L577-1 assume !(0 == ~e_wl~0); 7551#L582-1 assume !(1 == ~wl_pc~0); 7552#L594 assume !(2 == ~wl_pc~0); 7547#L595 assume !(1 == ~c1_pc~0); 7546#L605 assume !(1 == ~c2_pc~0); 7539#L614 assume !(1 == ~wb_pc~0); 7540#L623 assume !(1 == ~e_c~0); 7535#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7536#L637-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7528#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7529#L647-1 assume !(1 == ~e_c~0); 7524#L652-1 assume !(1 == ~e_wl~0); 7525#L657-1 assume 0 == ~wl_st~0; 7514#L674-1 assume !false; 7410#L544 [2019-01-14 04:42:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2019-01-14 04:42:50,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:50,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:50,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:50,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:50,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:42:50,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628252, now seen corresponding path program 1 times [2019-01-14 04:42:50,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:50,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:50,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:50,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:42:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:42:50,588 INFO L87 Difference]: Start difference. First operand 1076 states and 1851 transitions. cyclomatic complexity: 786 Second operand 4 states. [2019-01-14 04:42:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:51,397 INFO L93 Difference]: Finished difference Result 1310 states and 2219 transitions. [2019-01-14 04:42:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:42:51,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 2219 transitions. [2019-01-14 04:42:51,412 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 623 [2019-01-14 04:42:51,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1310 states and 2219 transitions. [2019-01-14 04:42:51,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2019-01-14 04:42:51,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 778 [2019-01-14 04:42:51,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1310 states and 2219 transitions. [2019-01-14 04:42:51,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:51,428 INFO L706 BuchiCegarLoop]: Abstraction has 1310 states and 2219 transitions. [2019-01-14 04:42:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states and 2219 transitions. [2019-01-14 04:42:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1271. [2019-01-14 04:42:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-01-14 04:42:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2169 transitions. [2019-01-14 04:42:51,460 INFO L729 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-01-14 04:42:51,460 INFO L609 BuchiCegarLoop]: Abstraction has 1271 states and 2169 transitions. [2019-01-14 04:42:51,460 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:42:51,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2169 transitions. [2019-01-14 04:42:51,471 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 620 [2019-01-14 04:42:51,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:51,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:51,472 INFO L867 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] [2019-01-14 04:42:51,472 INFO L868 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] [2019-01-14 04:42:51,473 INFO L794 eck$LassoCheckResult]: Stem: 9429#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9256#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9257#L406 assume !(1 == ~c_req_up~0); 9291#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 9296#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 9297#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 9400#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 9401#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 9430#L437-1 assume !(0 == ~e_f~0); 9203#L442-1 assume !(0 == ~e_g~0); 9204#L447-1 assume !(0 == ~e_e~0); 9302#L452-1 assume !(0 == ~e_c~0); 9358#L457-1 assume !(0 == ~e_wl~0); 9518#L462-1 assume !(1 == ~wl_pc~0); 9509#L474 assume !(2 == ~wl_pc~0); 9503#L475 assume !(1 == ~c1_pc~0); 9493#L485 assume !(1 == ~c2_pc~0); 9485#L494 assume !(1 == ~wb_pc~0); 9478#L503 assume !(1 == ~e_c~0); 9473#L512-1 assume !(1 == ~e_e~0); 9468#L517-1 assume !(1 == ~e_f~0); 9465#L522-1 assume !(1 == ~e_g~0); 9282#L527-1 assume !(1 == ~e_c~0); 9283#L532-1 assume !(1 == ~e_wl~0); 9341#L674-1 assume !false; 9853#L544 [2019-01-14 04:42:51,477 INFO L796 eck$LassoCheckResult]: Loop: 9853#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 10286#L379 assume !false; 10282#L297 assume !(0 == ~wl_st~0); 10283#L301 assume !(0 == ~c1_st~0); 10285#L304 assume !(0 == ~c2_st~0); 10280#L307 assume !(0 == ~wb_st~0); 10281#L310 assume !(0 == ~r_st~0); 10284#L395 start_simulation_~kernel_st~0 := 2; 10398#L550 assume !(1 == ~c_req_up~0); 10399#L550-2 start_simulation_~kernel_st~0 := 3; 10425#L562 assume !(0 == ~e_f~0); 10424#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 10423#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10422#L572-1 assume !(0 == ~e_c~0); 10421#L577-1 assume !(0 == ~e_wl~0); 10419#L582-1 assume !(1 == ~wl_pc~0); 10418#L594 assume !(2 == ~wl_pc~0); 10416#L595 assume !(1 == ~c1_pc~0); 10414#L605 assume !(1 == ~c2_pc~0); 10411#L614 assume !(1 == ~wb_pc~0); 10410#L623 assume !(1 == ~e_c~0); 10409#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9315#L637-1 assume !(1 == ~e_f~0); 9316#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 9368#L647-1 assume !(1 == ~e_c~0); 9415#L652-1 assume !(1 == ~e_wl~0); 10318#L657-1 assume 0 == ~wl_st~0; 10297#L674-1 assume !false; 9853#L544 [2019-01-14 04:42:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2019-01-14 04:42:51,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 520452640, now seen corresponding path program 1 times [2019-01-14 04:42:51,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:51,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:51,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:51,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:42:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:51,575 INFO L87 Difference]: Start difference. First operand 1271 states and 2169 transitions. cyclomatic complexity: 909 Second operand 3 states. [2019-01-14 04:42:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:51,850 INFO L93 Difference]: Finished difference Result 1965 states and 3310 transitions. [2019-01-14 04:42:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:51,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1965 states and 3310 transitions. [2019-01-14 04:42:51,868 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-01-14 04:42:51,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-01-14 04:42:51,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1131 [2019-01-14 04:42:51,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1131 [2019-01-14 04:42:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1965 states and 3310 transitions. [2019-01-14 04:42:51,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:51,888 INFO L706 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-01-14 04:42:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states and 3310 transitions. [2019-01-14 04:42:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2019-01-14 04:42:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-01-14 04:42:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3310 transitions. [2019-01-14 04:42:51,932 INFO L729 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-01-14 04:42:51,932 INFO L609 BuchiCegarLoop]: Abstraction has 1965 states and 3310 transitions. [2019-01-14 04:42:51,933 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:42:51,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1965 states and 3310 transitions. [2019-01-14 04:42:51,944 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 990 [2019-01-14 04:42:51,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:51,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:51,946 INFO L867 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] [2019-01-14 04:42:51,947 INFO L868 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] [2019-01-14 04:42:51,947 INFO L794 eck$LassoCheckResult]: Stem: 12681#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 12498#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 12499#L406 assume !(1 == ~c_req_up~0); 12534#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 12537#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 12538#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 12651#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 12652#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 12702#L437-1 assume !(0 == ~e_f~0); 12445#L442-1 assume !(0 == ~e_g~0); 12446#L447-1 assume !(0 == ~e_e~0); 12613#L452-1 assume !(0 == ~e_c~0); 12614#L457-1 assume !(0 == ~e_wl~0); 12657#L462-1 assume !(1 == ~wl_pc~0); 12646#L474 assume !(2 == ~wl_pc~0); 12512#L475 assume !(1 == ~c1_pc~0); 12505#L485 assume !(1 == ~c2_pc~0); 12521#L494 assume !(1 == ~wb_pc~0); 12522#L503 assume !(1 == ~e_c~0); 12712#L512-1 assume !(1 == ~e_e~0); 12729#L517-1 assume !(1 == ~e_f~0); 12715#L522-1 assume !(1 == ~e_g~0); 12524#L527-1 assume !(1 == ~e_c~0); 12525#L532-1 assume !(1 == ~e_wl~0); 12593#L674-1 assume !false; 13019#L544 [2019-01-14 04:42:51,947 INFO L796 eck$LassoCheckResult]: Loop: 13019#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 13534#L379 assume !false; 13582#L297 assume !(0 == ~wl_st~0); 13584#L301 assume !(0 == ~c1_st~0); 13648#L304 assume !(0 == ~c2_st~0); 13649#L307 assume !(0 == ~wb_st~0); 13643#L310 assume !(0 == ~r_st~0); 13645#L395 start_simulation_~kernel_st~0 := 2; 13779#L550 assume !(1 == ~c_req_up~0); 13777#L550-2 start_simulation_~kernel_st~0 := 3; 13774#L562 assume !(0 == ~e_f~0); 13772#L562-2 assume 0 == ~e_g~0;~e_g~0 := 1; 13769#L567-1 assume 0 == ~e_e~0;~e_e~0 := 1; 13766#L572-1 assume !(0 == ~e_c~0); 13764#L577-1 assume !(0 == ~e_wl~0); 13762#L582-1 assume !(1 == ~wl_pc~0); 13760#L594 assume 2 == ~wl_pc~0; 13758#L596 assume 1 == ~e_e~0;~wl_st~0 := 0; 13757#L595 assume !(1 == ~c1_pc~0); 13755#L605 assume !(1 == ~c2_pc~0); 13752#L614 assume !(1 == ~wb_pc~0); 13751#L623 assume !(1 == ~e_c~0); 13750#L632-1 assume 1 == ~e_e~0;~e_e~0 := 2; 13749#L637-1 assume !(1 == ~e_f~0); 13748#L642-1 assume 1 == ~e_g~0;~e_g~0 := 2; 13747#L647-1 assume !(1 == ~e_c~0); 13746#L652-1 assume !(1 == ~e_wl~0); 13744#L657-1 assume 0 == ~wl_st~0; 13743#L674-1 assume !false; 13019#L544 [2019-01-14 04:42:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2019-01-14 04:42:51,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:51,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:51,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:51,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1794894215, now seen corresponding path program 1 times [2019-01-14 04:42:51,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:51,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:51,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:51,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1157500386, now seen corresponding path program 1 times [2019-01-14 04:42:52,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:52,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:52,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:52,303 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-01-14 04:42:52,368 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:52,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:52,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:52,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:52,369 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:42:52,369 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:52,369 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:52,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:52,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-14 04:42:52,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:52,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:52,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:52,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:53,166 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:53,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:53,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:53,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:53,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:53,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:53,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_c~0=7} Honda state: {~e_c~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:53,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:53,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:42:53,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:42:53,249 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:42:53,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:42:53,279 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:42:53,299 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:42:53,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:42:53,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:42:53,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:42:53,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:42:53,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:42:53,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:42:53,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:42:53,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: toy1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-14 04:42:53,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:42:53,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:42:53,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:42:53,690 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:42:54,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:42:54,043 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:42:54,044 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 [2019-01-14 04:42:54,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:54,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:54,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:54,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:54,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:54,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:54,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:54,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:54,051 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 [2019-01-14 04:42:54,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:54,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:54,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:54,052 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:42:54,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:54,052 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:42:54,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:54,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:42:54,062 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 [2019-01-14 04:42:54,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:42:54,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:42:54,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:42:54,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:42:54,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:42:54,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:42:54,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:42:54,076 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:42:54,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:42:54,080 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:42:54,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:42:54,082 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:42:54,082 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:42:54,082 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2019-01-14 04:42:54,083 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:42:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:54,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:54,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:42:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:54,248 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:42:54,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356 Second operand 5 states. [2019-01-14 04:42:54,528 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1965 states and 3310 transitions. cyclomatic complexity: 1356. Second operand 5 states. Result 5576 states and 9355 transitions. Complement of second has 5 states. [2019-01-14 04:42:54,530 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 [2019-01-14 04:42:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:42:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2019-01-14 04:42:54,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 29 letters. [2019-01-14 04:42:54,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:54,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 54 letters. Loop has 29 letters. [2019-01-14 04:42:54,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:54,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 208 transitions. Stem has 25 letters. Loop has 58 letters. [2019-01-14 04:42:54,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:42:54,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5576 states and 9355 transitions. [2019-01-14 04:42:54,586 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1920 [2019-01-14 04:42:54,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5576 states to 5576 states and 9355 transitions. [2019-01-14 04:42:54,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2105 [2019-01-14 04:42:54,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2138 [2019-01-14 04:42:54,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5576 states and 9355 transitions. [2019-01-14 04:42:54,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:54,648 INFO L706 BuchiCegarLoop]: Abstraction has 5576 states and 9355 transitions. [2019-01-14 04:42:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states and 9355 transitions. [2019-01-14 04:42:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5543. [2019-01-14 04:42:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5543 states. [2019-01-14 04:42:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9295 transitions. [2019-01-14 04:42:54,810 INFO L729 BuchiCegarLoop]: Abstraction has 5543 states and 9295 transitions. [2019-01-14 04:42:54,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:54,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:54,810 INFO L87 Difference]: Start difference. First operand 5543 states and 9295 transitions. Second operand 3 states. [2019-01-14 04:42:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:55,092 INFO L93 Difference]: Finished difference Result 5023 states and 8398 transitions. [2019-01-14 04:42:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:55,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5023 states and 8398 transitions. [2019-01-14 04:42:55,122 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-01-14 04:42:55,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-01-14 04:42:55,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1932 [2019-01-14 04:42:55,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1932 [2019-01-14 04:42:55,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5023 states and 8398 transitions. [2019-01-14 04:42:55,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:55,179 INFO L706 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-01-14 04:42:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states and 8398 transitions. [2019-01-14 04:42:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5023. [2019-01-14 04:42:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-01-14 04:42:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 8398 transitions. [2019-01-14 04:42:55,314 INFO L729 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-01-14 04:42:55,315 INFO L609 BuchiCegarLoop]: Abstraction has 5023 states and 8398 transitions. [2019-01-14 04:42:55,315 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:42:55,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5023 states and 8398 transitions. [2019-01-14 04:42:55,338 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1747 [2019-01-14 04:42:55,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:55,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:55,341 INFO L867 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] [2019-01-14 04:42:55,341 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:42:55,342 INFO L794 eck$LassoCheckResult]: Stem: 30991#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 30789#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 30790#L406 assume !(1 == ~c_req_up~0); 30835#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 30839#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 30840#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 30957#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 30958#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 31007#L437-1 assume !(0 == ~e_f~0); 31008#L442-1 assume !(0 == ~e_g~0); 30845#L447-1 assume !(0 == ~e_e~0); 30846#L452-1 assume !(0 == ~e_c~0); 31056#L457-1 assume !(0 == ~e_wl~0); 31055#L462-1 assume !(1 == ~wl_pc~0); 31052#L474 assume !(2 == ~wl_pc~0); 31051#L475 assume !(1 == ~c1_pc~0); 31049#L485 assume !(1 == ~c2_pc~0); 31040#L494 assume !(1 == ~wb_pc~0); 31035#L503 assume !(1 == ~e_c~0); 31031#L512-1 assume !(1 == ~e_e~0); 31026#L517-1 assume !(1 == ~e_f~0); 31025#L522-1 assume !(1 == ~e_g~0); 30826#L527-1 assume !(1 == ~e_c~0); 30827#L532-1 assume !(1 == ~e_wl~0); 31481#L674-1 assume !false; 31476#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 31477#L379 [2019-01-14 04:42:55,342 INFO L796 eck$LassoCheckResult]: Loop: 31477#L379 assume !false; 31493#L297 assume 0 == ~wl_st~0; 31492#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 31472#L323 assume !(0 != eval_~tmp~0); 31473#L319 assume !(0 == ~c1_st~0); 31602#L334 assume !(0 == ~c2_st~0); 31575#L349 assume !(0 == ~wb_st~0); 31523#L364 assume !(0 == ~r_st~0); 31477#L379 [2019-01-14 04:42:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2019-01-14 04:42:55,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1289372155, now seen corresponding path program 1 times [2019-01-14 04:42:55,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 370417651, now seen corresponding path program 1 times [2019-01-14 04:42:55,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:55,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:55,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:55,641 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 04:42:55,844 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 04:42:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:55,865 INFO L87 Difference]: Start difference. First operand 5023 states and 8398 transitions. cyclomatic complexity: 3408 Second operand 3 states. [2019-01-14 04:42:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:56,144 INFO L93 Difference]: Finished difference Result 7959 states and 13148 transitions. [2019-01-14 04:42:56,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:56,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7959 states and 13148 transitions. [2019-01-14 04:42:56,181 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-01-14 04:42:56,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-01-14 04:42:56,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3015 [2019-01-14 04:42:56,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3015 [2019-01-14 04:42:56,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7959 states and 13148 transitions. [2019-01-14 04:42:56,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:56,263 INFO L706 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-01-14 04:42:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states and 13148 transitions. [2019-01-14 04:42:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7959. [2019-01-14 04:42:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7959 states. [2019-01-14 04:42:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13148 transitions. [2019-01-14 04:42:56,410 INFO L729 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-01-14 04:42:56,410 INFO L609 BuchiCegarLoop]: Abstraction has 7959 states and 13148 transitions. [2019-01-14 04:42:56,411 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:42:56,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7959 states and 13148 transitions. [2019-01-14 04:42:56,440 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2732 [2019-01-14 04:42:56,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:56,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:56,442 INFO L867 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] [2019-01-14 04:42:56,442 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:42:56,442 INFO L794 eck$LassoCheckResult]: Stem: 43968#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 43776#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 43777#L406 assume !(1 == ~c_req_up~0); 43820#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43823#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43824#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43941#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43942#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43988#L437-1 assume !(0 == ~e_f~0); 43989#L442-1 assume !(0 == ~e_g~0); 43829#L447-1 assume !(0 == ~e_e~0); 43830#L452-1 assume !(0 == ~e_c~0); 44041#L457-1 assume !(0 == ~e_wl~0); 44040#L462-1 assume !(1 == ~wl_pc~0); 44037#L474 assume !(2 == ~wl_pc~0); 44036#L475 assume !(1 == ~c1_pc~0); 44034#L485 assume !(1 == ~c2_pc~0); 44025#L494 assume !(1 == ~wb_pc~0); 44020#L503 assume !(1 == ~e_c~0); 44016#L512-1 assume !(1 == ~e_e~0); 44011#L517-1 assume !(1 == ~e_f~0); 44010#L522-1 assume !(1 == ~e_g~0); 43810#L527-1 assume !(1 == ~e_c~0); 43811#L532-1 assume !(1 == ~e_wl~0); 44728#L674-1 assume !false; 44729#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 44716#L379 [2019-01-14 04:42:56,442 INFO L796 eck$LassoCheckResult]: Loop: 44716#L379 assume !false; 44634#L297 assume 0 == ~wl_st~0; 44603#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 44596#L323 assume !(0 != eval_~tmp~0); 44597#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 47915#L338 assume !(0 != eval_~tmp___0~0); 44734#L334 assume !(0 == ~c2_st~0); 44732#L349 assume !(0 == ~wb_st~0); 44722#L364 assume !(0 == ~r_st~0); 44716#L379 [2019-01-14 04:42:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2019-01-14 04:42:56,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:56,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 1 times [2019-01-14 04:42:56,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1452726936, now seen corresponding path program 1 times [2019-01-14 04:42:56,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:56,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:56,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:56,840 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:42:57,089 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:42:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:57,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:57,092 INFO L87 Difference]: Start difference. First operand 7959 states and 13148 transitions. cyclomatic complexity: 5222 Second operand 3 states. [2019-01-14 04:42:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:57,214 INFO L93 Difference]: Finished difference Result 12649 states and 20599 transitions. [2019-01-14 04:42:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:57,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12649 states and 20599 transitions. [2019-01-14 04:42:57,355 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-01-14 04:42:57,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-01-14 04:42:57,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4840 [2019-01-14 04:42:57,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4840 [2019-01-14 04:42:57,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12649 states and 20599 transitions. [2019-01-14 04:42:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:57,431 INFO L706 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-01-14 04:42:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12649 states and 20599 transitions. [2019-01-14 04:42:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12649 to 12649. [2019-01-14 04:42:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2019-01-14 04:42:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 20599 transitions. [2019-01-14 04:42:57,614 INFO L729 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-01-14 04:42:57,614 INFO L609 BuchiCegarLoop]: Abstraction has 12649 states and 20599 transitions. [2019-01-14 04:42:57,614 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:42:57,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12649 states and 20599 transitions. [2019-01-14 04:42:57,657 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-01-14 04:42:57,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:57,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:57,658 INFO L867 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] [2019-01-14 04:42:57,658 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:42:57,658 INFO L794 eck$LassoCheckResult]: Stem: 64580#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 64392#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 64393#L406 assume !(1 == ~c_req_up~0); 64433#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 64436#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 64437#L422-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 64547#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 64548#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 64598#L437-1 assume !(0 == ~e_f~0); 64599#L442-1 assume !(0 == ~e_g~0); 66129#L447-1 assume !(0 == ~e_e~0); 66128#L452-1 assume !(0 == ~e_c~0); 66127#L457-1 assume !(0 == ~e_wl~0); 66126#L462-1 assume !(1 == ~wl_pc~0); 64660#L474 assume !(2 == ~wl_pc~0); 64661#L475 assume !(1 == ~c1_pc~0); 64656#L485 assume !(1 == ~c2_pc~0); 64655#L494 assume !(1 == ~wb_pc~0); 64643#L503 assume !(1 == ~e_c~0); 64644#L512-1 assume !(1 == ~e_e~0); 64630#L517-1 assume !(1 == ~e_f~0); 64631#L522-1 assume !(1 == ~e_g~0); 64423#L527-1 assume !(1 == ~e_c~0); 64424#L532-1 assume !(1 == ~e_wl~0); 65800#L674-1 assume !false; 65795#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 65796#L379 [2019-01-14 04:42:57,658 INFO L796 eck$LassoCheckResult]: Loop: 65796#L379 assume !false; 65934#L297 assume 0 == ~wl_st~0; 65933#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 65930#L323 assume !(0 != eval_~tmp~0); 65929#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 65888#L338 assume !(0 != eval_~tmp___0~0); 65919#L334 assume !(0 == ~c2_st~0); 65921#L349 assume !(0 == ~wb_st~0); 65901#L364 assume !(0 == ~r_st~0); 65796#L379 [2019-01-14 04:42:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2019-01-14 04:42:57,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:57,739 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:42:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1265058912, now seen corresponding path program 2 times [2019-01-14 04:42:57,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:57,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:57,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:57,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:57,957 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:42:58,091 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 04:42:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:58,093 INFO L87 Difference]: Start difference. First operand 12649 states and 20599 transitions. cyclomatic complexity: 7983 Second operand 3 states. [2019-01-14 04:42:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:58,130 INFO L93 Difference]: Finished difference Result 12547 states and 20414 transitions. [2019-01-14 04:42:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:58,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12547 states and 20414 transitions. [2019-01-14 04:42:58,186 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-01-14 04:42:58,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-01-14 04:42:58,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4741 [2019-01-14 04:42:58,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4741 [2019-01-14 04:42:58,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12547 states and 20414 transitions. [2019-01-14 04:42:58,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:58,240 INFO L706 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-01-14 04:42:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states and 20414 transitions. [2019-01-14 04:42:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 12547. [2019-01-14 04:42:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12547 states. [2019-01-14 04:42:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12547 states to 12547 states and 20414 transitions. [2019-01-14 04:42:58,408 INFO L729 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-01-14 04:42:58,408 INFO L609 BuchiCegarLoop]: Abstraction has 12547 states and 20414 transitions. [2019-01-14 04:42:58,408 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:42:58,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12547 states and 20414 transitions. [2019-01-14 04:42:58,446 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4288 [2019-01-14 04:42:58,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:58,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:58,447 INFO L867 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] [2019-01-14 04:42:58,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:42:58,447 INFO L794 eck$LassoCheckResult]: Stem: 89791#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 89595#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 89596#L406 assume !(1 == ~c_req_up~0); 89638#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 89641#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 89642#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 89760#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 89761#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 89810#L437-1 assume !(0 == ~e_f~0); 89811#L442-1 assume !(0 == ~e_g~0); 89647#L447-1 assume !(0 == ~e_e~0); 89648#L452-1 assume !(0 == ~e_c~0); 89867#L457-1 assume !(0 == ~e_wl~0); 89866#L462-1 assume !(1 == ~wl_pc~0); 89863#L474 assume !(2 == ~wl_pc~0); 89862#L475 assume !(1 == ~c1_pc~0); 89860#L485 assume !(1 == ~c2_pc~0); 89851#L494 assume !(1 == ~wb_pc~0); 89846#L503 assume !(1 == ~e_c~0); 89842#L512-1 assume !(1 == ~e_e~0); 89837#L517-1 assume !(1 == ~e_f~0); 89836#L522-1 assume !(1 == ~e_g~0); 89628#L527-1 assume !(1 == ~e_c~0); 89629#L532-1 assume !(1 == ~e_wl~0); 91148#L674-1 assume !false; 91149#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 91095#L379 [2019-01-14 04:42:58,447 INFO L796 eck$LassoCheckResult]: Loop: 91095#L379 assume !false; 95831#L297 assume 0 == ~wl_st~0; 95826#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 95824#L323 assume !(0 != eval_~tmp~0); 95822#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91014#L338 assume !(0 != eval_~tmp___0~0); 95820#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 91144#L353 assume !(0 != eval_~tmp___1~0); 91105#L349 assume !(0 == ~wb_st~0); 91097#L364 assume !(0 == ~r_st~0); 91095#L379 [2019-01-14 04:42:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2019-01-14 04:42:58,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 560500646, now seen corresponding path program 1 times [2019-01-14 04:42:58,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2086482018, now seen corresponding path program 1 times [2019-01-14 04:42:58,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:42:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:42:58,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:42:58,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:42:58,818 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 04:42:59,020 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 04:42:59,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:42:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:42:59,024 INFO L87 Difference]: Start difference. First operand 12547 states and 20414 transitions. cyclomatic complexity: 7900 Second operand 3 states. [2019-01-14 04:42:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:42:59,103 INFO L93 Difference]: Finished difference Result 21409 states and 34276 transitions. [2019-01-14 04:42:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:42:59,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21409 states and 34276 transitions. [2019-01-14 04:42:59,176 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-01-14 04:42:59,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-01-14 04:42:59,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8025 [2019-01-14 04:42:59,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8025 [2019-01-14 04:42:59,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21409 states and 34276 transitions. [2019-01-14 04:42:59,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:42:59,278 INFO L706 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-01-14 04:42:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21409 states and 34276 transitions. [2019-01-14 04:42:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21409 to 21409. [2019-01-14 04:42:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21409 states. [2019-01-14 04:42:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21409 states to 21409 states and 34276 transitions. [2019-01-14 04:42:59,546 INFO L729 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-01-14 04:42:59,546 INFO L609 BuchiCegarLoop]: Abstraction has 21409 states and 34276 transitions. [2019-01-14 04:42:59,547 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:42:59,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21409 states and 34276 transitions. [2019-01-14 04:42:59,756 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 7356 [2019-01-14 04:42:59,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:42:59,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:42:59,759 INFO L867 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] [2019-01-14 04:42:59,759 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:42:59,760 INFO L794 eck$LassoCheckResult]: Stem: 123758#ULTIMATE.startENTRY ~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 123558#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 123559#L406 assume !(1 == ~c_req_up~0); 123603#L406-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 123607#L417-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 123608#L422-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 123725#L427-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 123726#L432-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 123775#L437-1 assume !(0 == ~e_f~0); 123776#L442-1 assume !(0 == ~e_g~0); 123613#L447-1 assume !(0 == ~e_e~0); 123614#L452-1 assume !(0 == ~e_c~0); 123847#L457-1 assume !(0 == ~e_wl~0); 123846#L462-1 assume !(1 == ~wl_pc~0); 123843#L474 assume !(2 == ~wl_pc~0); 123842#L475 assume !(1 == ~c1_pc~0); 123840#L485 assume !(1 == ~c2_pc~0); 123831#L494 assume !(1 == ~wb_pc~0); 123826#L503 assume !(1 == ~e_c~0); 123822#L512-1 assume !(1 == ~e_e~0); 123817#L517-1 assume !(1 == ~e_f~0); 123816#L522-1 assume !(1 == ~e_g~0); 123594#L527-1 assume !(1 == ~e_c~0); 123595#L532-1 assume !(1 == ~e_wl~0); 125339#L674-1 assume !false; 125340#L544 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet0, eval_#t~nondet1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 124987#L379 [2019-01-14 04:42:59,762 INFO L796 eck$LassoCheckResult]: Loop: 124987#L379 assume !false; 124984#L297 assume 0 == ~wl_st~0; 124981#L310-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet0;havoc eval_#t~nondet0; 124977#L323 assume !(0 != eval_~tmp~0); 124978#L319 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 126122#L338 assume !(0 != eval_~tmp___0~0); 125605#L334 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 125560#L353 assume !(0 != eval_~tmp___1~0); 125303#L349 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 125300#L368 assume !(0 != eval_~tmp___2~0); 125299#L364 assume !(0 == ~r_st~0); 124987#L379 [2019-01-14 04:42:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2019-01-14 04:42:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 195616437, now seen corresponding path program 1 times [2019-01-14 04:42:59,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:42:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:42:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -256467523, now seen corresponding path program 1 times [2019-01-14 04:42:59,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:42:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:42:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:42:59,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:42:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:42:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:43:00,167 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:43:00,294 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:43:00,903 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 110 [2019-01-14 04:43:01,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:43:01 BoogieIcfgContainer [2019-01-14 04:43:01,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:43:01,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:43:01,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:43:01,009 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:43:01,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:42:42" (3/4) ... [2019-01-14 04:43:01,015 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:43:01,096 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:43:01,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:43:01,103 INFO L168 Benchmark]: Toolchain (without parser) took 20201.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.1 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -271.4 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,104 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:43:01,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,105 INFO L168 Benchmark]: Boogie Preprocessor took 53.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,105 INFO L168 Benchmark]: RCFGBuilder took 1112.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,110 INFO L168 Benchmark]: BuchiAutomizer took 18278.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.9 MB). Peak memory consumption was 132.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,111 INFO L168 Benchmark]: Witness Printer took 86.92 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:43:01,118 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -212.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1112.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18278.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.9 MB). Peak memory consumption was 132.9 MB. Max. memory is 11.5 GB. * Witness Printer took 86.92 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 21409 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.2s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 10.8s. Construction of modules took 3.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 12. Automata minimization 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 417 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had 21409 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4213 SDtfs, 3526 SDslu, 2462 SDs, 0 SdLazy, 323 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 296]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_out=0, wb_st=0, processed=0, \result=0, c2_st=0, wl_pc=0, e_wl=2, tmp=0, e_c=2, e_e=2, kernel_st=1, e_p_in=0, tmp___1=0, t_b=0, tmp___2=0, p_in=0, wb_pc=0, data=0, tmp___0=0, wb_i=1, c_req_up=0, tmp___3=0, c_t=0, wl_i=1, c1_st=0, c=0, wl_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d80fbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57b624bd=0, c1_i=1, c2_pc=0, c2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74cc0fd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@123952e7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@530ba574=0, r_i=0, d=0, e_f=2, e_g=2, r_st=2, __retres1=0, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 296]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) [L467] COND FALSE !((int )wl_pc == 1) [L475] COND FALSE !((int )wl_pc == 2) [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; Loop: [L296] COND TRUE 1 [L298] COND TRUE (int )wl_st == 0 [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND FALSE !(\read(tmp)) [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND FALSE !(\read(tmp___0)) [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp___1)) [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND FALSE !(\read(tmp___2)) [L379] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...