./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.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.3.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 b21da786d95e06bc319c05bb1d8697b6b032c077 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:46:16,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:46:16,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:46:16,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:46:16,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:46:16,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:46:16,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:46:16,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:46:16,349 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:46:16,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:46:16,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:46:16,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:46:16,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:46:16,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:46:16,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:46:16,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:46:16,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:46:16,360 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:46:16,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:46:16,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:46:16,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:46:16,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:46:16,371 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:46:16,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:46:16,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:46:16,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:46:16,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:46:16,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:46:16,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:46:16,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:46:16,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:46:16,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:46:16,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:46:16,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:46:16,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:46:16,390 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:16,420 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:46:16,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:46:16,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:46:16,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:46:16,426 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:46:16,426 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:46:16,427 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:46:16,427 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:46:16,427 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:46:16,427 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:46:16,427 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:46:16,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:46:16,428 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:46:16,429 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:46:16,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:46:16,430 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:46:16,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:46:16,433 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:46:16,433 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:46:16,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:46:16,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:46:16,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:46:16,434 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:46:16,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:46:16,434 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:46:16,435 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:46:16,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:46:16,436 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 -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2019-01-14 04:46:16,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:46:16,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:46:16,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:46:16,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:46:16,515 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:46:16,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:16,579 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78299725/4707b6e37f4b40ada1282b5f5d7922c4/FLAG5f1c2705c [2019-01-14 04:46:17,042 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:46:17,043 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:17,064 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78299725/4707b6e37f4b40ada1282b5f5d7922c4/FLAG5f1c2705c [2019-01-14 04:46:17,365 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78299725/4707b6e37f4b40ada1282b5f5d7922c4 [2019-01-14 04:46:17,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:46:17,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:46:17,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:46:17,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:46:17,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:46:17,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:46:17" (1/1) ... [2019-01-14 04:46:17,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:17, skipping insertion in model container [2019-01-14 04:46:17,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:46:17" (1/1) ... [2019-01-14 04:46:17,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:46:17,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:46:17,746 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:46:17,757 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:46:17,859 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:46:17,881 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:46:17,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:17 WrapperNode [2019-01-14 04:46:17,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:46:17,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:46:17,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:46:17,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:46:17,966 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:17" (1/1) ... [2019-01-14 04:46:17,978 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:17" (1/1) ... [2019-01-14 04:46:18,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:46:18,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:46:18,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:46:18,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:46:18,058 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:17" (1/1) ... [2019-01-14 04:46:18,058 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:17" (1/1) ... [2019-01-14 04:46:18,069 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:17" (1/1) ... [2019-01-14 04:46:18,070 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:17" (1/1) ... [2019-01-14 04:46:18,087 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:17" (1/1) ... [2019-01-14 04:46:18,114 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:17" (1/1) ... [2019-01-14 04:46:18,117 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:17" (1/1) ... [2019-01-14 04:46:18,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:46:18,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:46:18,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:46:18,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:46:18,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:17" (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:18,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:46:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:46:19,493 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:46:19,493 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-14 04:46:19,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:46:19 BoogieIcfgContainer [2019-01-14 04:46:19,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:46:19,495 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:46:19,495 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:46:19,498 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:46:19,499 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:19,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:46:17" (1/3) ... [2019-01-14 04:46:19,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49c164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:46:19, skipping insertion in model container [2019-01-14 04:46:19,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:19,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:46:17" (2/3) ... [2019-01-14 04:46:19,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49c164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:46:19, skipping insertion in model container [2019-01-14 04:46:19,502 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:46:19,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:46:19" (3/3) ... [2019-01-14 04:46:19,504 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2019-01-14 04:46:19,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:46:19,567 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:46:19,567 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:46:19,567 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:46:19,567 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:46:19,567 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:46:19,568 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:46:19,568 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:46:19,568 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:46:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-14 04:46:19,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-01-14 04:46:19,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:19,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:19,633 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:19,633 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:19,633 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:46:19,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-01-14 04:46:19,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-01-14 04:46:19,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:19,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:19,645 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:19,645 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:19,654 INFO L794 eck$LassoCheckResult]: Stem: 89#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]; 13#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; 11#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 125#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 57#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 46#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 91#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 81#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 112#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 109#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 34#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 16#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 60#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 56#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 99#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 102#L352-1true init_#res := init_~tmp___5~0; 21#L461true 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; 116#L569-2true [2019-01-14 04:46:19,655 INFO L796 eck$LassoCheckResult]: Loop: 116#L569-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 19#L120true assume !(0 != ~mode1~0 % 256); 115#L145true assume !(~r1~0 < 2); 113#L145-1true ~mode1~0 := 1; 17#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 63#L163true assume !(0 != ~mode2~0 % 256); 41#L188true assume !(~r2~0 < 2); 39#L188-1true ~mode2~0 := 1; 62#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 110#L206true assume !(0 != ~mode3~0 % 256); 87#L231true assume !(~r3~0 < 2); 86#L231-1true ~mode3~0 := 1; 107#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; 44#L469true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 29#L469-1true check_#res := check_~tmp~1; 111#L517true 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; 10#L599true assume !(0 == assert_~arg % 256); 106#L594true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 116#L569-2true [2019-01-14 04:46:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2018311820, now seen corresponding path program 1 times [2019-01-14 04:46:19,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:19,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:19,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:19,923 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:19,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:19,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:19,930 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:46:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1684923087, now seen corresponding path program 1 times [2019-01-14 04:46:19,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:19,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:19,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:20,066 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:20,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:20,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:46:20,071 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:46:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:46:20,088 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2019-01-14 04:46:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:20,289 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2019-01-14 04:46:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:46:20,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 222 transitions. [2019-01-14 04:46:20,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:20,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 123 states and 189 transitions. [2019-01-14 04:46:20,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-01-14 04:46:20,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-01-14 04:46:20,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 189 transitions. [2019-01-14 04:46:20,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:20,310 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-01-14 04:46:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 189 transitions. [2019-01-14 04:46:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-14 04:46:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 04:46:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2019-01-14 04:46:20,345 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-01-14 04:46:20,345 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-01-14 04:46:20,346 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:46:20,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 189 transitions. [2019-01-14 04:46:20,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:20,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:20,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:20,351 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:20,351 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:20,352 INFO L794 eck$LassoCheckResult]: Stem: 390#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]; 295#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; 290#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 291#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 366#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 351#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 352#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 333#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 387#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 370#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 331#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 298#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 300#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 289#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 365#L352 assume ~id1~0 != ~id2~0; 363#L353 assume ~id1~0 != ~id3~0; 284#L354 assume ~id2~0 != ~id3~0; 285#L355 assume ~id1~0 >= 0; 334#L356 assume ~id2~0 >= 0; 335#L357 assume ~id3~0 >= 0; 386#L358 assume 0 == ~r1~0; 329#L359 assume 0 == ~r2~0; 330#L360 assume 0 == ~r3~0; 368#L361 assume 0 != init_~r122~0 % 256; 321#L362 assume 0 != init_~r132~0 % 256; 322#L363 assume 0 != init_~r212~0 % 256; 362#L364 assume 0 != init_~r232~0 % 256; 282#L365 assume 0 != init_~r312~0 % 256; 283#L366 assume 0 != init_~r322~0 % 256; 359#L367 assume ~max1~0 == ~id1~0; 360#L368 assume ~max2~0 == ~id2~0; 385#L369 assume ~max3~0 == ~id3~0; 327#L370 assume 0 == ~st1~0; 328#L371 assume 0 == ~st2~0; 367#L372 assume 0 == ~st3~0; 319#L373 assume 0 == ~nl1~0; 320#L374 assume 0 == ~nl2~0; 361#L375 assume 0 == ~nl3~0; 280#L376 assume 0 == ~mode1~0 % 256; 281#L377 assume 0 == ~mode2~0 % 256; 355#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 356#L352-1 init_#res := init_~tmp___5~0; 311#L461 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; 312#L569-2 [2019-01-14 04:46:20,352 INFO L796 eck$LassoCheckResult]: Loop: 312#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 306#L120 assume !(0 != ~mode1~0 % 256); 307#L145 assume !(~r1~0 < 2); 294#L145-1 ~mode1~0 := 1; 301#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 302#L163 assume !(0 != ~mode2~0 % 256); 341#L188 assume !(~r2~0 < 2); 336#L188-1 ~mode2~0 := 1; 337#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 371#L206 assume !(0 != ~mode3~0 % 256); 389#L231 assume !(~r3~0 < 2); 340#L231-1 ~mode3~0 := 1; 388#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; 346#L469 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 304#L469-1 check_#res := check_~tmp~1; 325#L517 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; 286#L599 assume !(0 == assert_~arg % 256); 287#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 312#L569-2 [2019-01-14 04:46:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 1 times [2019-01-14 04:46:20,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:20,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:20,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:20,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1684923087, now seen corresponding path program 2 times [2019-01-14 04:46:20,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:20,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:20,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:20,708 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:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:20,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:46:20,710 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:46:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:46:20,710 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. cyclomatic complexity: 67 Second operand 5 states. [2019-01-14 04:46:20,917 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:46:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:21,011 INFO L93 Difference]: Finished difference Result 126 states and 191 transitions. [2019-01-14 04:46:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:46:21,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 191 transitions. [2019-01-14 04:46:21,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:21,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 181 transitions. [2019-01-14 04:46:21,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-01-14 04:46:21,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-01-14 04:46:21,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 181 transitions. [2019-01-14 04:46:21,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:21,021 INFO L706 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-01-14 04:46:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 181 transitions. [2019-01-14 04:46:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-14 04:46:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 04:46:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2019-01-14 04:46:21,031 INFO L729 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-01-14 04:46:21,031 INFO L609 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-01-14 04:46:21,031 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:46:21,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 181 transitions. [2019-01-14 04:46:21,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-01-14 04:46:21,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:21,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:21,039 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:21,039 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:21,039 INFO L794 eck$LassoCheckResult]: Stem: 651#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]; 556#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; 551#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 552#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 627#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 612#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 613#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 594#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 648#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 631#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 592#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 559#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 561#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 550#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 626#L352 assume ~id1~0 != ~id2~0; 624#L353 assume ~id1~0 != ~id3~0; 545#L354 assume ~id2~0 != ~id3~0; 546#L355 assume ~id1~0 >= 0; 595#L356 assume ~id2~0 >= 0; 596#L357 assume ~id3~0 >= 0; 647#L358 assume 0 == ~r1~0; 590#L359 assume 0 == ~r2~0; 591#L360 assume 0 == ~r3~0; 629#L361 assume 0 != init_~r122~0 % 256; 581#L362 assume 0 != init_~r132~0 % 256; 582#L363 assume 0 != init_~r212~0 % 256; 623#L364 assume 0 != init_~r232~0 % 256; 543#L365 assume 0 != init_~r312~0 % 256; 544#L366 assume 0 != init_~r322~0 % 256; 620#L367 assume ~max1~0 == ~id1~0; 621#L368 assume ~max2~0 == ~id2~0; 646#L369 assume ~max3~0 == ~id3~0; 588#L370 assume 0 == ~st1~0; 589#L371 assume 0 == ~st2~0; 628#L372 assume 0 == ~st3~0; 579#L373 assume 0 == ~nl1~0; 580#L374 assume 0 == ~nl2~0; 622#L375 assume 0 == ~nl3~0; 541#L376 assume 0 == ~mode1~0 % 256; 542#L377 assume 0 == ~mode2~0 % 256; 616#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 617#L352-1 init_#res := init_~tmp___5~0; 571#L461 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; 572#L569-2 [2019-01-14 04:46:21,040 INFO L796 eck$LassoCheckResult]: Loop: 572#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 566#L120 assume !(0 != ~mode1~0 % 256); 567#L145 assume !(~r1~0 < 2); 555#L145-1 ~mode1~0 := 1; 562#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 563#L163 assume !(0 != ~mode2~0 % 256); 602#L188 assume !(~r2~0 < 2); 597#L188-1 ~mode2~0 := 1; 598#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 632#L206 assume !(0 != ~mode3~0 % 256); 650#L231 assume !(~r3~0 < 2); 601#L231-1 ~mode3~0 := 1; 649#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; 607#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 608#L470 assume ~st1~0 + ~nl1~0 <= 1; 635#L471 assume ~st2~0 + ~nl2~0 <= 1; 569#L472 assume ~st3~0 + ~nl3~0 <= 1; 570#L473 assume ~r1~0 >= 2; 609#L477 assume ~r1~0 < 2; 611#L482 assume ~r1~0 >= 2; 565#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 585#L469-1 check_#res := check_~tmp~1; 586#L517 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; 547#L599 assume !(0 == assert_~arg % 256); 548#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 572#L569-2 [2019-01-14 04:46:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 2 times [2019-01-14 04:46:21,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -807435907, now seen corresponding path program 1 times [2019-01-14 04:46:21,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:21,239 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:21,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:21,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:21,240 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:46:21,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:46:21,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:46:21,241 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-01-14 04:46:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:21,399 INFO L93 Difference]: Finished difference Result 175 states and 258 transitions. [2019-01-14 04:46:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:46:21,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 258 transitions. [2019-01-14 04:46:21,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-01-14 04:46:21,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 175 states and 258 transitions. [2019-01-14 04:46:21,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-01-14 04:46:21,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-01-14 04:46:21,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 258 transitions. [2019-01-14 04:46:21,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:21,409 INFO L706 BuchiCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-01-14 04:46:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 258 transitions. [2019-01-14 04:46:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-14 04:46:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-14 04:46:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2019-01-14 04:46:21,421 INFO L729 BuchiCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-01-14 04:46:21,422 INFO L609 BuchiCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-01-14 04:46:21,422 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:46:21,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 258 transitions. [2019-01-14 04:46:21,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2019-01-14 04:46:21,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:46:21,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:46:21,426 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, 1, 1, 1, 1, 1, 1] [2019-01-14 04:46:21,426 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:21,426 INFO L794 eck$LassoCheckResult]: Stem: 956#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]; 860#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; 855#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 856#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 930#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 915#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 916#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 898#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 953#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 934#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 896#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 863#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 865#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 854#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 929#L352 assume ~id1~0 != ~id2~0; 927#L353 assume ~id1~0 != ~id3~0; 849#L354 assume ~id2~0 != ~id3~0; 850#L355 assume ~id1~0 >= 0; 899#L356 assume ~id2~0 >= 0; 900#L357 assume ~id3~0 >= 0; 952#L358 assume 0 == ~r1~0; 894#L359 assume 0 == ~r2~0; 895#L360 assume 0 == ~r3~0; 932#L361 assume 0 != init_~r122~0 % 256; 885#L362 assume 0 != init_~r132~0 % 256; 886#L363 assume 0 != init_~r212~0 % 256; 926#L364 assume 0 != init_~r232~0 % 256; 847#L365 assume 0 != init_~r312~0 % 256; 848#L366 assume 0 != init_~r322~0 % 256; 923#L367 assume ~max1~0 == ~id1~0; 924#L368 assume ~max2~0 == ~id2~0; 951#L369 assume ~max3~0 == ~id3~0; 892#L370 assume 0 == ~st1~0; 893#L371 assume 0 == ~st2~0; 931#L372 assume 0 == ~st3~0; 883#L373 assume 0 == ~nl1~0; 884#L374 assume 0 == ~nl2~0; 925#L375 assume 0 == ~nl3~0; 845#L376 assume 0 == ~mode1~0 % 256; 846#L377 assume 0 == ~mode2~0 % 256; 919#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 920#L352-1 init_#res := init_~tmp___5~0; 875#L461 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; 876#L569-2 [2019-01-14 04:46:21,427 INFO L796 eck$LassoCheckResult]: Loop: 876#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 968#L120 assume !(0 != ~mode1~0 % 256); 967#L145 assume ~r1~0 < 2; 943#L146 assume !(0 != ~ep12~0 % 256); 878#L146-2 assume !(0 != ~ep13~0 % 256); 859#L145-1 ~mode1~0 := 1; 1008#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 1005#L163 assume !(0 != ~mode2~0 % 256); 998#L188 assume !(~r2~0 < 2); 995#L188-1 ~mode2~0 := 1; 993#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 992#L206 assume !(0 != ~mode3~0 % 256); 981#L231 assume !(~r3~0 < 2); 980#L231-1 ~mode3~0 := 1; 978#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; 977#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 976#L470 assume ~st1~0 + ~nl1~0 <= 1; 975#L471 assume ~st2~0 + ~nl2~0 <= 1; 974#L472 assume ~st3~0 + ~nl3~0 <= 1; 973#L473 assume !(~r1~0 >= 2); 957#L476 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 958#L477 assume ~r1~0 < 2; 966#L482 assume !(~r1~0 >= 2); 868#L486 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 869#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 972#L469-1 check_#res := check_~tmp~1; 971#L517 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; 970#L599 assume !(0 == assert_~arg % 256); 969#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 876#L569-2 [2019-01-14 04:46:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 3 times [2019-01-14 04:46:21,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash -912533906, now seen corresponding path program 1 times [2019-01-14 04:46:21,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:21,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:21,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:46:21,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:46:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash -961338958, now seen corresponding path program 1 times [2019-01-14 04:46:21,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:46:21,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:46:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:46:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:46:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:21,704 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:21,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:46:21,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:46:22,751 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-01-14 04:46:22,944 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-14 04:46:22,955 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:46:22,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:46:22,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:46:22,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:46:22,957 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:46:22,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:46:22,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:46:22,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:46:22,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:46:22,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:46:22,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:46:22,989 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:23,031 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:23,042 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:23,046 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:23,062 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:23,066 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:23,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:23,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:23,120 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:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:23,152 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:23,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:23,179 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:23,181 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:23,183 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:23,193 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:23,200 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:23,208 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:23,241 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:23,244 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:23,247 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:23,250 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:23,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:23,257 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:23,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:23,276 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:23,952 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:46:23,953 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:23,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:46:23,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:46:23,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:46:23,998 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) [2019-01-14 04:46:24,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:46:24,038 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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:24,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:46:24,106 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:24,284 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:46:24,286 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:46:24,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:46:24,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:46:24,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:46:24,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:46:24,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:46:24,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:46:24,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:46:24,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:46:24,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:46:24,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:46:24,293 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:24,337 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:24,361 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:24,367 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:24,383 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:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,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:24,396 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:24,403 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:24,407 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:24,409 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:24,412 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:24,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,418 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:24,425 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:24,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,435 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:24,449 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:24,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,457 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:24,522 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:24,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,532 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:24,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:46:24,979 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 04:46:25,493 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-14 04:46:25,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:46:25,803 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:46:25,806 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:25,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:46:25,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,824 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:25,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:25,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:25,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,833 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:25,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,841 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:25,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,844 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:25,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,850 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:25,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,861 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:25,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:25,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:25,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,871 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:25,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,879 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:25,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,885 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:25,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,892 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:25,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,899 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:25,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,905 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:25,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:46:25,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:46:25,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,914 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:25,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:46:25,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:46:25,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:46:25,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:46:25,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:46:25,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:46:25,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:46:25,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:46:25,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:46:25,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:46:25,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:46:25,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:46:25,935 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:46:25,936 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:46:25,937 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:46:25,937 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:25,939 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:46:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:46:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:26,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:46:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:46:26,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:46:26,522 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:26,528 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:26,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 258 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-01-14 04:46:26,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 258 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 294 states and 443 transitions. Complement of second has 4 states. [2019-01-14 04:46:26,684 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:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:46:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2019-01-14 04:46:26,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 43 letters. Loop has 29 letters. [2019-01-14 04:46:26,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:26,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 72 letters. Loop has 29 letters. [2019-01-14 04:46:26,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:26,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 43 letters. Loop has 58 letters. [2019-01-14 04:46:26,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:46:26,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 443 transitions. [2019-01-14 04:46:26,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:26,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 0 states and 0 transitions. [2019-01-14 04:46:26,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:46:26,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:46:26,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:46:26,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:26,709 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:26,709 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:46:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:46:26,710 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:46:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:46:26,710 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:46:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:46:26,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:46:26,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:26,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:46:26,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:46:26,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:46:26,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:46:26,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:46:26,716 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:26,716 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:26,716 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:46:26,716 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:46:26,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:46:26,717 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:46:26,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:46:26,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:46:26 BoogieIcfgContainer [2019-01-14 04:46:26,728 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:46:26,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:46:26,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:46:26,729 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:46:26,731 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:19" (3/4) ... [2019-01-14 04:46:26,735 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:46:26,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:46:26,736 INFO L168 Benchmark]: Toolchain (without parser) took 9366.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -56.8 MB). Peak memory consumption was 156.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:26,739 INFO L168 Benchmark]: CDTParser took 0.14 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:26,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:26,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:26,745 INFO L168 Benchmark]: Boogie Preprocessor took 97.52 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:26,745 INFO L168 Benchmark]: RCFGBuilder took 1362.19 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:26,748 INFO L168 Benchmark]: BuchiAutomizer took 7233.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:46:26,750 INFO L168 Benchmark]: Witness Printer took 6.80 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:26,756 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.14 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 510.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.52 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 1362.19 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7233.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.80 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 7.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. 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 175 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 766 SDtfs, 353 SDslu, 1225 SDs, 0 SdLazy, 39 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 8ms 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...