./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.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/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.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 3381374679dc4a7458d725215e8a6e295cc6e6a1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:46:04,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:46:04,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:46:04,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:46:04,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:46:04,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:46:04,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:46:04,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:46:04,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:46:04,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:46:04,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:46:04,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:46:04,097 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:46:04,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:46:04,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:46:04,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:46:04,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:46:04,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:46:04,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:46:04,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:46:04,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:46:04,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:46:04,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:46:04,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:46:04,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:46:04,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:46:04,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:46:04,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:46:04,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:46:04,122 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:46:04,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:46:04,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:46:04,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:46:04,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:46:04,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:46:04,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:46:04,128 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:46:04,158 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:46:04,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:46:04,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:46:04,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:46:04,162 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:46:04,163 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:46:04,163 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:46:04,164 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:46:04,164 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:46:04,164 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:46:04,165 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:46:04,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:46:04,165 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:46:04,165 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:46:04,165 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:46:04,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:46:04,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:46:04,167 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:46:04,171 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:46:04,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:46:04,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:46:04,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:46:04,172 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:46:04,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:46:04,172 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:46:04,172 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:46:04,175 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:46:04,175 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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2019-01-14 04:46:04,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:46:04,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:46:04,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:46:04,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:46:04,268 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:46:04,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:04,318 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d4c2466/3f716907d19c46258a5fc8ef3718488a/FLAG7127e8efd [2019-01-14 04:46:04,762 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:46:04,763 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:04,775 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d4c2466/3f716907d19c46258a5fc8ef3718488a/FLAG7127e8efd [2019-01-14 04:46:05,154 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d4c2466/3f716907d19c46258a5fc8ef3718488a [2019-01-14 04:46:05,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:46:05,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:46:05,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:46:05,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:46:05,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:46:05,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05, skipping insertion in model container [2019-01-14 04:46:05,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:46:05,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:46:05,564 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:46:05,582 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:46:05,667 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:46:05,758 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:46:05,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05 WrapperNode [2019-01-14 04:46:05,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:46:05,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:46:05,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:46:05,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:46:05,771 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:46:05" (1/1) ... [2019-01-14 04:46:05,784 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:46:05" (1/1) ... [2019-01-14 04:46:05,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:46:05,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:46:05,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:46:05,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:46:05,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (1/1) ... [2019-01-14 04:46:05,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:46:05,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:46:05,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:46:05,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:46:05,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (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:46:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:46:05,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:46:07,193 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:46:07,194 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-14 04:46:07,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:46:07 BoogieIcfgContainer [2019-01-14 04:46:07,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:46:07,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:46:07,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:46:07,199 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:46:07,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:07,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:46:05" (1/3) ... [2019-01-14 04:46:07,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70f6a5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:46:07, skipping insertion in model container [2019-01-14 04:46:07,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:07,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:05" (2/3) ... [2019-01-14 04:46:07,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70f6a5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:46:07, skipping insertion in model container [2019-01-14 04:46:07,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:07,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:46:07" (3/3) ... [2019-01-14 04:46:07,205 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:07,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:46:07,270 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:46:07,271 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:46:07,271 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:46:07,271 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:46:07,271 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:46:07,271 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:46:07,271 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:46:07,272 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:46:07,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-01-14 04:46:07,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-01-14 04:46:07,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:07,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:07,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:07,336 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:07,336 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:46:07,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states. [2019-01-14 04:46:07,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-01-14 04:46:07,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:07,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:07,347 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:07,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:07,357 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 9#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 116#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 50#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 40#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 88#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 77#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 105#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 103#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 29#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 15#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 53#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 49#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 93#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 96#L352-1true init_#res := init_~tmp___5~0; 113#L437true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 84#L545-2true [2019-01-14 04:46:07,358 INFO L796 eck$LassoCheckResult]: Loop: 84#L545-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 17#L120true assume !(0 != ~mode1~0 % 256); 108#L145true assume !(~r1~0 < 2); 106#L145-1true ~mode1~0 := 1; 16#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 56#L163true assume !(0 != ~mode2~0 % 256); 36#L188true assume !(~r2~0 < 2); 34#L188-1true ~mode2~0 := 1; 55#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 104#L206true assume !(0 != ~mode3~0 % 256); 83#L231true assume !(~r3~0 < 2); 82#L231-1true ~mode3~0 := 1; 101#L206-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 119#L445true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 121#L445-1true check_#res := check_~tmp~1; 60#L493true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 97#L575true assume !(0 == assert_~arg % 256); 78#L570true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 84#L545-2true [2019-01-14 04:46:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2018347568, now seen corresponding path program 1 times [2019-01-14 04:46:07,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:07,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:07,694 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:46:07,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:07,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:07,703 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:46:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 1 times [2019-01-14 04:46:07,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:07,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:07,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:07,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:07,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:07,821 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:46:07,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:07,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:46:07,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:46:07,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:46:07,840 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 4 states. [2019-01-14 04:46:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:08,020 INFO L93 Difference]: Finished difference Result 124 states and 210 transitions. [2019-01-14 04:46:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:46:08,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 210 transitions. [2019-01-14 04:46:08,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:08,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 117 states and 183 transitions. [2019-01-14 04:46:08,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-14 04:46:08,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-01-14 04:46:08,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 183 transitions. [2019-01-14 04:46:08,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:08,041 INFO L706 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-01-14 04:46:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 183 transitions. [2019-01-14 04:46:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-14 04:46:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 04:46:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2019-01-14 04:46:08,100 INFO L729 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-01-14 04:46:08,100 INFO L609 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-01-14 04:46:08,101 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:46:08,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 183 transitions. [2019-01-14 04:46:08,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:08,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:08,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:08,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:08,116 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:08,117 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 279#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 274#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 275#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 340#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 327#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 328#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 310#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 366#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 345#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 308#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 282#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 284#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 273#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 339#L352 assume ~id1~0 != ~id2~0; 337#L353 assume ~id1~0 != ~id3~0; 270#L354 assume ~id2~0 != ~id3~0; 271#L355 assume ~id1~0 >= 0; 311#L356 assume ~id2~0 >= 0; 312#L357 assume ~id3~0 >= 0; 365#L358 assume 0 == ~r1~0; 306#L359 assume 0 == ~r2~0; 307#L360 assume 0 == ~r3~0; 343#L361 assume ~max1~0 == ~id1~0; 299#L362 assume ~max2~0 == ~id2~0; 300#L363 assume ~max3~0 == ~id3~0; 336#L364 assume 0 == ~st1~0; 268#L365 assume 0 == ~st2~0; 269#L366 assume 0 == ~st3~0; 333#L367 assume 0 == ~nl1~0; 334#L368 assume 0 == ~nl2~0; 364#L369 assume 0 == ~nl3~0; 304#L370 assume 0 == ~mode1~0 % 256; 305#L371 assume 0 == ~mode2~0 % 256; 341#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 342#L352-1 init_#res := init_~tmp___5~0; 373#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 368#L545-2 [2019-01-14 04:46:08,117 INFO L796 eck$LassoCheckResult]: Loop: 368#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 287#L120 assume !(0 != ~mode1~0 % 256); 288#L145 assume !(~r1~0 < 2); 278#L145-1 ~mode1~0 := 1; 285#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 286#L163 assume !(0 != ~mode2~0 % 256); 318#L188 assume !(~r2~0 < 2); 313#L188-1 ~mode2~0 := 1; 314#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 346#L206 assume !(0 != ~mode3~0 % 256); 370#L231 assume !(~r3~0 < 2); 317#L231-1 ~mode3~0 := 1; 369#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 374#L445 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 325#L445-1 check_#res := check_~tmp~1; 350#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 351#L575 assume !(0 == assert_~arg % 256); 367#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 368#L545-2 [2019-01-14 04:46:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 1 times [2019-01-14 04:46:08,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:08,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:08,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:08,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 980302415, now seen corresponding path program 2 times [2019-01-14 04:46:08,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:08,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:08,563 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:46:08,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:08,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:46:08,564 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:46:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:46:08,565 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. cyclomatic complexity: 67 Second operand 5 states. [2019-01-14 04:46:08,795 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:46:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:08,958 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2019-01-14 04:46:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:46:08,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 185 transitions. [2019-01-14 04:46:08,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:08,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 175 transitions. [2019-01-14 04:46:08,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2019-01-14 04:46:08,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2019-01-14 04:46:08,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 175 transitions. [2019-01-14 04:46:08,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:08,975 INFO L706 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-01-14 04:46:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 175 transitions. [2019-01-14 04:46:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-14 04:46:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 04:46:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2019-01-14 04:46:08,988 INFO L729 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-01-14 04:46:08,988 INFO L609 BuchiCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-01-14 04:46:08,988 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:46:08,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 175 transitions. [2019-01-14 04:46:08,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:08,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:08,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:08,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:08,994 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] [2019-01-14 04:46:08,995 INFO L794 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 528#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 523#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 524#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 588#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 575#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 576#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 559#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 615#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 593#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 557#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 531#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 533#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 522#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 587#L352 assume ~id1~0 != ~id2~0; 585#L353 assume ~id1~0 != ~id3~0; 519#L354 assume ~id2~0 != ~id3~0; 520#L355 assume ~id1~0 >= 0; 560#L356 assume ~id2~0 >= 0; 561#L357 assume ~id3~0 >= 0; 614#L358 assume 0 == ~r1~0; 555#L359 assume 0 == ~r2~0; 556#L360 assume 0 == ~r3~0; 591#L361 assume ~max1~0 == ~id1~0; 548#L362 assume ~max2~0 == ~id2~0; 549#L363 assume ~max3~0 == ~id3~0; 584#L364 assume 0 == ~st1~0; 517#L365 assume 0 == ~st2~0; 518#L366 assume 0 == ~st3~0; 581#L367 assume 0 == ~nl1~0; 582#L368 assume 0 == ~nl2~0; 613#L369 assume 0 == ~nl3~0; 553#L370 assume 0 == ~mode1~0 % 256; 554#L371 assume 0 == ~mode2~0 % 256; 589#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 590#L352-1 init_#res := init_~tmp___5~0; 622#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L545-2 [2019-01-14 04:46:08,996 INFO L796 eck$LassoCheckResult]: Loop: 617#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 536#L120 assume !(0 != ~mode1~0 % 256); 537#L145 assume !(~r1~0 < 2); 527#L145-1 ~mode1~0 := 1; 534#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 535#L163 assume !(0 != ~mode2~0 % 256); 567#L188 assume !(~r2~0 < 2); 562#L188-1 ~mode2~0 := 1; 563#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 594#L206 assume !(0 != ~mode3~0 % 256); 619#L231 assume !(~r3~0 < 2); 566#L231-1 ~mode3~0 := 1; 618#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 623#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 609#L446 assume ~st1~0 + ~nl1~0 <= 1; 573#L447 assume ~st2~0 + ~nl2~0 <= 1; 574#L448 assume ~st3~0 + ~nl3~0 <= 1; 604#L449 assume ~r1~0 >= 2; 539#L453 assume ~r1~0 < 2; 540#L458 assume ~r1~0 >= 2; 571#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 596#L445-1 check_#res := check_~tmp~1; 599#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 600#L575 assume !(0 == assert_~arg % 256); 616#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 617#L545-2 [2019-01-14 04:46:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 2 times [2019-01-14 04:46:08,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:08,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:09,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:09,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 14333785, now seen corresponding path program 1 times [2019-01-14 04:46:09,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:09,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:09,109 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:46:09,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:09,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:09,110 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:09,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:46:09,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:46:09,111 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-01-14 04:46:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:09,244 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-01-14 04:46:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:46:09,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 252 transitions. [2019-01-14 04:46:09,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-01-14 04:46:09,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 252 transitions. [2019-01-14 04:46:09,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2019-01-14 04:46:09,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2019-01-14 04:46:09,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 252 transitions. [2019-01-14 04:46:09,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:09,257 INFO L706 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-01-14 04:46:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 252 transitions. [2019-01-14 04:46:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-14 04:46:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-14 04:46:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2019-01-14 04:46:09,279 INFO L729 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-01-14 04:46:09,280 INFO L609 BuchiCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-01-14 04:46:09,280 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:46:09,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 252 transitions. [2019-01-14 04:46:09,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-01-14 04:46:09,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:09,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:09,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:09,286 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:46:09,289 INFO L794 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 821#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 816#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 817#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 881#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 867#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 868#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 851#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 907#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 886#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 849#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 824#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 826#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 815#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 880#L352 assume ~id1~0 != ~id2~0; 878#L353 assume ~id1~0 != ~id3~0; 812#L354 assume ~id2~0 != ~id3~0; 813#L355 assume ~id1~0 >= 0; 852#L356 assume ~id2~0 >= 0; 853#L357 assume ~id3~0 >= 0; 906#L358 assume 0 == ~r1~0; 847#L359 assume 0 == ~r2~0; 848#L360 assume 0 == ~r3~0; 884#L361 assume ~max1~0 == ~id1~0; 840#L362 assume ~max2~0 == ~id2~0; 841#L363 assume ~max3~0 == ~id3~0; 877#L364 assume 0 == ~st1~0; 810#L365 assume 0 == ~st2~0; 811#L366 assume 0 == ~st3~0; 873#L367 assume 0 == ~nl1~0; 874#L368 assume 0 == ~nl2~0; 905#L369 assume 0 == ~nl3~0; 845#L370 assume 0 == ~mode1~0 % 256; 846#L371 assume 0 == ~mode2~0 % 256; 882#L372 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 883#L352-1 init_#res := init_~tmp___5~0; 917#L437 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 923#L545-2 [2019-01-14 04:46:09,290 INFO L796 eck$LassoCheckResult]: Loop: 923#L545-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 965#L120 assume !(0 != ~mode1~0 % 256); 964#L145 assume ~r1~0 < 2; 896#L146 assume !(0 != ~ep12~0 % 256); 835#L146-2 assume !(0 != ~ep13~0 % 256); 820#L145-1 ~mode1~0 := 1; 827#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 828#L163 assume !(0 != ~mode2~0 % 256); 859#L188 assume !(~r2~0 < 2); 854#L188-1 ~mode2~0 := 1; 855#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 887#L206 assume !(0 != ~mode3~0 % 256); 920#L231 assume !(~r3~0 < 2); 936#L231-1 ~mode3~0 := 1; 934#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 932#L445 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 931#L446 assume ~st1~0 + ~nl1~0 <= 1; 930#L447 assume ~st2~0 + ~nl2~0 <= 1; 929#L448 assume ~st3~0 + ~nl3~0 <= 1; 928#L449 assume !(~r1~0 >= 2); 875#L452 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 876#L453 assume ~r1~0 < 2; 933#L458 assume !(~r1~0 >= 2); 913#L462 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 914#L463 assume ~r1~0 < 2;check_~tmp~1 := 1; 969#L445-1 check_#res := check_~tmp~1; 968#L493 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 967#L575 assume !(0 == assert_~arg % 256); 966#L570 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 923#L545-2 [2019-01-14 04:46:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1347795084, now seen corresponding path program 3 times [2019-01-14 04:46:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash -67119798, now seen corresponding path program 1 times [2019-01-14 04:46:09,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:09,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -708835657, now seen corresponding path program 1 times [2019-01-14 04:46:09,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:09,496 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:46:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:09,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:09,982 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-01-14 04:46:10,157 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-14 04:46:10,167 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:46:10,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:46:10,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:46:10,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:46:10,169 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:46:10,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:46:10,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:46:10,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:46:10,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:46:10,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:46:10,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:46:10,194 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:46:10,214 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:46:10,224 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:46:10,234 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:46:10,249 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:46:10,253 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:46:10,259 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:46:10,262 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:46:10,274 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:46:10,282 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:46:10,285 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:46:10,289 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:46:10,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:46:10,310 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:46:10,315 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:46:10,320 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:46:10,329 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:46:10,348 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:46:10,387 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:46:10,389 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:46:10,392 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:46:10,395 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:46:10,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:46:10,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:46:10,413 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:46:10,428 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:46:11,104 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 04:46:11,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:46:11,158 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:46:11,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:46:11,164 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:46:11,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:46:11,176 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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:46:11,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:46:11,199 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) [2019-01-14 04:46:11,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:46:11,272 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:46:11,393 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:46:11,395 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:46:11,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:46:11,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:46:11,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:46:11,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:46:11,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:46:11,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:46:11,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:46:11,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:46:11,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:46:11,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:46:11,402 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:46:11,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:46:11,545 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:46:11,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:46:11,691 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:46:11,693 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:46:11,694 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:46:11,696 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:46:11,699 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:46:11,705 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:46:11,709 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:46:11,711 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:46:11,713 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:46:11,715 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:46:11,717 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:46:11,723 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:46:11,731 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:46:11,736 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:46:11,739 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:46:11,741 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:46:11,743 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:46:11,755 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:46:11,762 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:46:11,764 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:46:11,766 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:46:11,888 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 04:46:11,889 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:46:12,288 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 04:46:12,769 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 04:46:13,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:46:13,042 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:46:13,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:46:13,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,055 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:46:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,065 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:46:13,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:13,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:13,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:46:13,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,086 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:46:13,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,094 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:46:13,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,100 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:46:13,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,110 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:46:13,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:13,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:13,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,129 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:46:13,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,138 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:46:13,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,146 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:46:13,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,155 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:46:13,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,164 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:46:13,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,171 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:46:13,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:13,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:13,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,183 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:46:13,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:13,192 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:46:13,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:13,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:13,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:13,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:13,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:13,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:13,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:13,201 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:46:13,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:46:13,207 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:46:13,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:46:13,210 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:46:13,211 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:46:13,211 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-01-14 04:46:13,213 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:46:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:13,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:46:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:13,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:46:13,577 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:46:13,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:46:13,586 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-01-14 04:46:13,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 252 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 288 states and 437 transitions. Complement of second has 4 states. [2019-01-14 04:46:13,723 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:46:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:46:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2019-01-14 04:46:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 29 letters. [2019-01-14 04:46:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 66 letters. Loop has 29 letters. [2019-01-14 04:46:13,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:13,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 175 transitions. Stem has 37 letters. Loop has 58 letters. [2019-01-14 04:46:13,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:13,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 437 transitions. [2019-01-14 04:46:13,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:13,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 0 states and 0 transitions. [2019-01-14 04:46:13,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:46:13,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:46:13,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:46:13,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:13,739 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:13,739 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:46:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:46:13,743 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:46:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:13,743 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:46:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:46:13,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:46:13,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:13,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:46:13,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:46:13,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:46:13,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:46:13,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:13,744 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:13,745 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:13,749 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:13,749 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:46:13,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:46:13,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:13,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:46:13,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:46:13 BoogieIcfgContainer [2019-01-14 04:46:13,759 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:46:13,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:46:13,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:46:13,760 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:46:13,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:46:07" (3/4) ... [2019-01-14 04:46:13,766 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:46:13,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:46:13,768 INFO L168 Benchmark]: Toolchain (without parser) took 8609.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -61.9 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:13,771 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:46:13,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:13,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.91 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:13,777 INFO L168 Benchmark]: Boogie Preprocessor took 55.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:46:13,777 INFO L168 Benchmark]: RCFGBuilder took 1311.36 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:13,778 INFO L168 Benchmark]: BuchiAutomizer took 6563.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 124.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:13,780 INFO L168 Benchmark]: Witness Printer took 7.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:46:13,785 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 599.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.91 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1311.36 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: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6563.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 124.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 169 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 736 SDtfs, 347 SDslu, 1183 SDs, 0 SdLazy, 39 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...