./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.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 5ece07e091f918f26c76e2a65f38501df262220c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:08:44,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:44,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:44,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:44,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:44,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:44,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:44,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:44,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:44,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:44,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:44,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:44,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:44,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:44,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:44,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:44,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:44,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:44,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:44,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:44,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:44,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:44,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:44,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:44,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:44,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:44,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:44,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:44,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:44,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:44,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:44,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:44,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:44,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:44,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:44,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:44,555 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:08:44,571 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:44,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:44,573 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:44,573 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:44,573 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:44,573 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:44,573 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:44,574 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:44,575 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:44,575 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:44,575 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:44,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:44,575 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:44,575 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:44,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:44,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:44,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:44,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:44,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:44,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:44,578 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:44,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:44,579 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:44,579 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:44,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:44,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:44,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:44,580 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:44,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:44,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:44,580 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:44,581 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:44,583 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 -> 5ece07e091f918f26c76e2a65f38501df262220c [2019-01-02 00:08:44,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:44,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:44,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:44,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:44,649 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:44,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:44,701 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcae7998f/a5b358ffb40f431b836d569450ec41be/FLAG7791e5983 [2019-01-02 00:08:45,183 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:45,184 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:45,195 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcae7998f/a5b358ffb40f431b836d569450ec41be/FLAG7791e5983 [2019-01-02 00:08:45,494 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcae7998f/a5b358ffb40f431b836d569450ec41be [2019-01-02 00:08:45,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:45,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:45,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:45,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:45,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:45,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:45" (1/1) ... [2019-01-02 00:08:45,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd9e7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:45, skipping insertion in model container [2019-01-02 00:08:45,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:45" (1/1) ... [2019-01-02 00:08:45,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:45,570 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:45,904 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:45,925 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:46,019 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:46,048 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:46,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46 WrapperNode [2019-01-02 00:08:46,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:46,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:46,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:46,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:46,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:46,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:46,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:46,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:46,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (1/1) ... [2019-01-02 00:08:46,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:46,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:46,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:46,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:46,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (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-02 00:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:47,644 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:47,644 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-02 00:08:47,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:47 BoogieIcfgContainer [2019-01-02 00:08:47,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:47,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:47,645 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:47,648 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:47,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:47,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:45" (1/3) ... [2019-01-02 00:08:47,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4adb892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:47, skipping insertion in model container [2019-01-02 00:08:47,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:47,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:46" (2/3) ... [2019-01-02 00:08:47,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4adb892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:47, skipping insertion in model container [2019-01-02 00:08:47,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:47,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:47" (3/3) ... [2019-01-02 00:08:47,653 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:47,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:47,710 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:47,710 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:47,710 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:47,710 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:47,710 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:47,711 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:47,711 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:47,711 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:47,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2019-01-02 00:08:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-01-02 00:08:47,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:47,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:47,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:47,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:47,769 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:47,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states. [2019-01-02 00:08:47,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-01-02 00:08:47,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:47,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:47,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:47,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:47,792 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 11#L-1true havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 82#L244true assume !(0 == ~r1~0);init_~tmp~0 := 0; 80#L244-1true init_#res := init_~tmp~0; 58#L341true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 44#L403-2true [2019-01-02 00:08:47,794 INFO L796 eck$LassoCheckResult]: Loop: 44#L403-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 49#L110true assume !(0 != ~mode1~0 % 256); 38#L128true assume !(0 != ~alive1~0 % 256); 10#L128-2true ~mode1~0 := 1; 43#L110-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L142true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 78#L145true assume !(node2_~m2~0 != ~nomsg~0); 75#L145-1true ~mode2~0 := 0; 16#L142-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 26#L176true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L179true assume !(node3_~m3~0 != ~nomsg~0); 8#L179-1true ~mode3~0 := 0; 50#L176-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L210true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 62#L213true assume !(node4_~m4~0 != ~nomsg~0); 34#L213-1true ~mode4~0 := 0; 55#L210-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 65#L349true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 68#L349-1true check_#res := check_~tmp~1; 85#L361true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 74#L430true assume !(0 == assert_~arg % 256); 35#L425true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 44#L403-2true [2019-01-02 00:08:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2019-01-02 00:08:47,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:47,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:47,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:47,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:47,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:48,059 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-02 00:08:48,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:48,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:48,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1227957475, now seen corresponding path program 1 times [2019-01-02 00:08:48,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:48,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:48,220 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-02 00:08:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:48,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:48,223 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:48,246 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 4 states. [2019-01-02 00:08:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:48,463 INFO L93 Difference]: Finished difference Result 96 states and 156 transitions. [2019-01-02 00:08:48,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:08:48,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 156 transitions. [2019-01-02 00:08:48,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-01-02 00:08:48,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 89 states and 126 transitions. [2019-01-02 00:08:48,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-01-02 00:08:48,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-01-02 00:08:48,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 126 transitions. [2019-01-02 00:08:48,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:48,482 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2019-01-02 00:08:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 126 transitions. [2019-01-02 00:08:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-02 00:08:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-02 00:08:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2019-01-02 00:08:48,516 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2019-01-02 00:08:48,516 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 126 transitions. [2019-01-02 00:08:48,516 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:08:48,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 126 transitions. [2019-01-02 00:08:48,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-01-02 00:08:48,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:48,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:48,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:48,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:48,523 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 223#L-1 havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 224#L244 assume 0 == ~r1~0; 258#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 259#L246 assume ~id1~0 >= 0; 283#L247 assume 0 == ~st1~0; 239#L248 assume ~send1~0 == ~id1~0; 240#L249 assume 0 == ~mode1~0 % 256; 270#L250 assume ~id2~0 >= 0; 272#L251 assume 0 == ~st2~0; 210#L252 assume ~send2~0 == ~id2~0; 211#L253 assume 0 == ~mode2~0 % 256; 252#L254 assume ~id3~0 >= 0; 225#L255 assume 0 == ~st3~0; 226#L256 assume ~send3~0 == ~id3~0; 264#L257 assume 0 == ~mode3~0 % 256; 284#L258 assume ~id4~0 >= 0; 241#L259 assume 0 == ~st4~0; 242#L260 assume ~send4~0 == ~id4~0; 271#L261 assume 0 == ~mode4~0 % 256; 273#L262 assume ~id1~0 != ~id2~0; 212#L263 assume ~id1~0 != ~id3~0; 213#L264 assume ~id1~0 != ~id4~0; 253#L265 assume ~id2~0 != ~id3~0; 227#L266 assume ~id2~0 != ~id4~0; 228#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 265#L244-1 init_#res := init_~tmp~0; 277#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 257#L403-2 [2019-01-02 00:08:48,523 INFO L796 eck$LassoCheckResult]: Loop: 257#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 266#L110 assume !(0 != ~mode1~0 % 256); 260#L128 assume !(0 != ~alive1~0 % 256); 221#L128-2 ~mode1~0 := 1; 222#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 244#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 246#L145 assume !(node2_~m2~0 != ~nomsg~0); 215#L145-1 ~mode2~0 := 0; 234#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 235#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 219#L179 assume !(node3_~m3~0 != ~nomsg~0); 217#L179-1 ~mode3~0 := 0; 218#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 269#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 275#L213 assume !(node4_~m4~0 != ~nomsg~0); 237#L213-1 ~mode4~0 := 0; 247#L210-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 274#L349 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 281#L349-1 check_#res := check_~tmp~1; 285#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 290#L430 assume !(0 == assert_~arg % 256); 256#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 257#L403-2 [2019-01-02 00:08:48,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2019-01-02 00:08:48,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:48,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1227957475, now seen corresponding path program 2 times [2019-01-02 00:08:48,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:48,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:48,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:48,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:48,860 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:08:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:08:48,861 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. cyclomatic complexity: 38 Second operand 5 states. [2019-01-02 00:08:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:48,938 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2019-01-02 00:08:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:08:48,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 128 transitions. [2019-01-02 00:08:48,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-01-02 00:08:48,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 124 transitions. [2019-01-02 00:08:48,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-01-02 00:08:48,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2019-01-02 00:08:48,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 124 transitions. [2019-01-02 00:08:48,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:48,947 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2019-01-02 00:08:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 124 transitions. [2019-01-02 00:08:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-02 00:08:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-02 00:08:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2019-01-02 00:08:48,954 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2019-01-02 00:08:48,955 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 124 transitions. [2019-01-02 00:08:48,955 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:08:48,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 124 transitions. [2019-01-02 00:08:48,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2019-01-02 00:08:48,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:48,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:48,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:48,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:48,960 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 416#L-1 havoc main_#res;havoc 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~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 417#L244 assume 0 == ~r1~0; 451#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 452#L246 assume ~id1~0 >= 0; 474#L247 assume 0 == ~st1~0; 432#L248 assume ~send1~0 == ~id1~0; 433#L249 assume 0 == ~mode1~0 % 256; 463#L250 assume ~id2~0 >= 0; 465#L251 assume 0 == ~st2~0; 403#L252 assume ~send2~0 == ~id2~0; 404#L253 assume 0 == ~mode2~0 % 256; 445#L254 assume ~id3~0 >= 0; 418#L255 assume 0 == ~st3~0; 419#L256 assume ~send3~0 == ~id3~0; 454#L257 assume 0 == ~mode3~0 % 256; 476#L258 assume ~id4~0 >= 0; 434#L259 assume 0 == ~st4~0; 435#L260 assume ~send4~0 == ~id4~0; 464#L261 assume 0 == ~mode4~0 % 256; 466#L262 assume ~id1~0 != ~id2~0; 405#L263 assume ~id1~0 != ~id3~0; 406#L264 assume ~id1~0 != ~id4~0; 446#L265 assume ~id2~0 != ~id3~0; 420#L266 assume ~id2~0 != ~id4~0; 421#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 458#L244-1 init_#res := init_~tmp~0; 470#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0 := 0; 450#L403-2 [2019-01-02 00:08:48,963 INFO L796 eck$LassoCheckResult]: Loop: 450#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 459#L110 assume !(0 != ~mode1~0 % 256); 455#L128 assume !(0 != ~alive1~0 % 256); 414#L128-2 ~mode1~0 := 1; 415#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 437#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 439#L145 assume !(node2_~m2~0 != ~nomsg~0); 408#L145-1 ~mode2~0 := 0; 427#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 428#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 412#L179 assume !(node3_~m3~0 != ~nomsg~0); 410#L179-1 ~mode3~0 := 0; 411#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 462#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 468#L213 assume !(node4_~m4~0 != ~nomsg~0); 430#L213-1 ~mode4~0 := 0; 440#L210-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 467#L349 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 475#L350 assume ~r1~0 < 4;check_~tmp~1 := 1; 477#L349-1 check_#res := check_~tmp~1; 478#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 483#L430 assume !(0 == assert_~arg % 256); 449#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 450#L403-2 [2019-01-02 00:08:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2019-01-02 00:08:48,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash -971351118, now seen corresponding path program 1 times [2019-01-02 00:08:49,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1378393174, now seen corresponding path program 1 times [2019-01-02 00:08:49,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:49,165 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-02 00:08:49,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:49,988 WARN L181 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2019-01-02 00:08:50,512 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-01-02 00:08:50,524 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:50,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:50,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:50,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:50,526 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:50,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:50,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:50,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:50,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:50,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:50,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:50,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:50,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,568 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:51,569 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-02 00:08:51,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:51,576 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:51,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:51,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:51,742 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:08:51,744 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:51,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:51,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:51,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:51,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:51,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:51,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:51,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:51,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:51,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:51,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:51,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:51,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,216 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-02 00:08:52,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:52,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:08:52,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-02 00:08:52,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,917 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-02 00:08:52,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:52,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:52,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:52,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:52,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,938 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-02 00:08:52,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:52,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:52,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,947 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-02 00:08:52,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,955 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-02 00:08:52,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:52,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:52,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,964 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-02 00:08:52,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:52,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:52,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,973 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-02 00:08:52,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,979 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-02 00:08:52,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,981 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-02 00:08:52,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:52,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:52,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:52,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,989 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-02 00:08:52,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:52,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:52,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:52,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:52,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:52,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:52,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:52,998 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-02 00:08:53,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:53,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:53,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:53,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:53,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:53,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:53,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:53,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:53,004 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-02 00:08:53,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:53,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:53,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:53,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:53,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:53,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:53,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:53,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:53,012 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-02 00:08:53,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:53,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:53,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:53,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:53,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:53,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:53,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:53,019 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:08:53,023 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:08:53,024 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:08:53,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:08:53,026 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:08:53,028 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:08:53,029 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-01-02 00:08:53,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:08:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:53,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:53,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:53,228 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-02 00:08:53,233 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-02 00:08:53,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 124 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-01-02 00:08:53,290 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 124 transitions. cyclomatic complexity: 36. Second operand 3 states. Result 150 states and 221 transitions. Complement of second has 4 states. [2019-01-02 00:08:53,291 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-02 00:08:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:08:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2019-01-02 00:08:53,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 28 letters. Loop has 23 letters. [2019-01-02 00:08:53,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:53,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 51 letters. Loop has 23 letters. [2019-01-02 00:08:53,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:53,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 124 transitions. Stem has 28 letters. Loop has 46 letters. [2019-01-02 00:08:53,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:53,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 221 transitions. [2019-01-02 00:08:53,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:53,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 0 states and 0 transitions. [2019-01-02 00:08:53,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:53,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:53,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:53,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:53,303 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:53,303 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:08:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:08:53,304 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:08:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:53,306 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:08:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:08:53,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:53,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:53,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:53,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:53,307 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:53,307 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:08:53,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:08:53,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:53,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:08:53,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:08:53 BoogieIcfgContainer [2019-01-02 00:08:53,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:08:53,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:08:53,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:08:53,319 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:08:53,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:47" (3/4) ... [2019-01-02 00:08:53,324 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:08:53,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:08:53,326 INFO L168 Benchmark]: Toolchain (without parser) took 7826.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -66.3 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:53,327 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:53,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:53,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 181.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:53,330 INFO L168 Benchmark]: Boogie Preprocessor took 59.80 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-02 00:08:53,331 INFO L168 Benchmark]: RCFGBuilder took 1352.31 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:53,332 INFO L168 Benchmark]: BuchiAutomizer took 5673.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.6 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:53,333 INFO L168 Benchmark]: Witness Printer took 5.30 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-02 00:08:53,339 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 547.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 181.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.80 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 1352.31 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5673.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.6 MB). Peak memory consumption was 137.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.30 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 89 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 400 SDtfs, 220 SDslu, 740 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax139 hnf109 lsp25 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq214 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...