./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2216fd6115b2bb44c4633e353be739828d7cac46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:30:57,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:30:57,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:30:57,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:30:57,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:30:57,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:30:57,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:30:57,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:30:57,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:30:57,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:30:57,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:30:57,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:30:57,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:30:57,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:30:57,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:30:57,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:30:57,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:30:57,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:30:57,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:30:57,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:30:57,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:30:57,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:30:57,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:30:57,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:30:57,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:30:57,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:30:57,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:30:57,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:30:57,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:30:57,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:30:57,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:30:57,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:30:57,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:30:57,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:30:57,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:30:57,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:30:57,569 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:30:57,584 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:30:57,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:30:57,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:30:57,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:30:57,586 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:30:57,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:30:57,586 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:30:57,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:30:57,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:30:57,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:30:57,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:30:57,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:30:57,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:30:57,589 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:30:57,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:30:57,589 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:30:57,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:30:57,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:30:57,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:30:57,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:30:57,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:30:57,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:30:57,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:30:57,592 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:30:57,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:30:57,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:30:57,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:30:57,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:30:57,593 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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(G ! call(__VERIFIER_error())) ) 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 -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2019-01-12 15:30:57,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:30:57,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:30:57,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:30:57,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:30:57,646 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:30:57,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-12 15:30:57,702 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774fde45e/b2da21b5d0d047e7bbad9a7db50a488c/FLAG3de82f42b [2019-01-12 15:30:58,125 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:30:58,125 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-12 15:30:58,135 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774fde45e/b2da21b5d0d047e7bbad9a7db50a488c/FLAG3de82f42b [2019-01-12 15:30:58,506 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774fde45e/b2da21b5d0d047e7bbad9a7db50a488c [2019-01-12 15:30:58,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:30:58,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:30:58,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:30:58,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:30:58,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:30:58,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:58,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a569fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58, skipping insertion in model container [2019-01-12 15:30:58,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:58,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:30:58,573 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:30:58,857 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:30:58,864 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:30:58,921 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:30:58,944 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:30:58,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58 WrapperNode [2019-01-12 15:30:58,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:30:58,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:30:58,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:30:58,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:30:58,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:58,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:30:59,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:30:59,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:30:59,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:30:59,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (1/1) ... [2019-01-12 15:30:59,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:30:59,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:30:59,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:30:59,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:30:59,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:30:59,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:30:59,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:31:00,373 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:31:00,373 INFO L286 CfgBuilder]: Removed 80 assue(true) statements. [2019-01-12 15:31:00,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:00 BoogieIcfgContainer [2019-01-12 15:31:00,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:31:00,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:31:00,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:31:00,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:31:00,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:30:58" (1/3) ... [2019-01-12 15:31:00,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542607fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:31:00, skipping insertion in model container [2019-01-12 15:31:00,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:58" (2/3) ... [2019-01-12 15:31:00,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542607fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:31:00, skipping insertion in model container [2019-01-12 15:31:00,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:00" (3/3) ... [2019-01-12 15:31:00,381 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2019-01-12 15:31:00,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:31:00,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:31:00,409 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:31:00,440 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:31:00,441 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:31:00,441 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:31:00,441 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:31:00,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:31:00,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:31:00,442 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:31:00,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:31:00,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:31:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-12 15:31:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:00,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:00,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:00,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-01-12 15:31:00,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:00,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:00,628 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-12 15:31:00,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:00,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:00,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:00,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:00,654 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-01-12 15:31:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:00,731 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-01-12 15:31:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:00,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:00,747 INFO L225 Difference]: With dead ends: 277 [2019-01-12 15:31:00,748 INFO L226 Difference]: Without dead ends: 137 [2019-01-12 15:31:00,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-12 15:31:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-12 15:31:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-12 15:31:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-01-12 15:31:00,801 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-01-12 15:31:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-01-12 15:31:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-01-12 15:31:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:00,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:00,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:00,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-01-12 15:31:00,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:00,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:00,871 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-12 15:31:00,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:00,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:31:00,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:00,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:00,874 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-01-12 15:31:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:01,072 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-01-12 15:31:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:01,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:01,079 INFO L225 Difference]: With dead ends: 363 [2019-01-12 15:31:01,079 INFO L226 Difference]: Without dead ends: 232 [2019-01-12 15:31:01,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-01-12 15:31:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-01-12 15:31:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-12 15:31:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-01-12 15:31:01,130 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-01-12 15:31:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:01,130 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-01-12 15:31:01,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-01-12 15:31:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:01,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:01,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:01,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-01-12 15:31:01,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:01,199 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-12 15:31:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:31:01,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,201 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-01-12 15:31:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:01,309 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-01-12 15:31:01,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:01,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:01,316 INFO L225 Difference]: With dead ends: 453 [2019-01-12 15:31:01,317 INFO L226 Difference]: Without dead ends: 230 [2019-01-12 15:31:01,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-12 15:31:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-01-12 15:31:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-12 15:31:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-01-12 15:31:01,368 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-01-12 15:31:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:01,368 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-01-12 15:31:01,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-01-12 15:31:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:01,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:01,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:01,371 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-01-12 15:31:01,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:01,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:01,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:01,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:01,441 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-12 15:31:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:01,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:31:01,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,443 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-01-12 15:31:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:01,529 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-01-12 15:31:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:01,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:01,533 INFO L225 Difference]: With dead ends: 452 [2019-01-12 15:31:01,533 INFO L226 Difference]: Without dead ends: 230 [2019-01-12 15:31:01,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-12 15:31:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-01-12 15:31:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-12 15:31:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-01-12 15:31:01,551 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-01-12 15:31:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:01,552 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-01-12 15:31:01,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-01-12 15:31:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:01,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:01,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:01,554 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-01-12 15:31:01,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:01,600 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-12 15:31:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:31:01,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,603 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-01-12 15:31:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:01,807 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-01-12 15:31:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:01,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:01,810 INFO L225 Difference]: With dead ends: 451 [2019-01-12 15:31:01,810 INFO L226 Difference]: Without dead ends: 230 [2019-01-12 15:31:01,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-12 15:31:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-01-12 15:31:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-01-12 15:31:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-01-12 15:31:01,827 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-01-12 15:31:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:01,829 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-01-12 15:31:01,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-01-12 15:31:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:31:01,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:01,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:31:01,831 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-01-12 15:31:01,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:01,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:31:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:01,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:31:01,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:01,931 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-01-12 15:31:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:02,189 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-01-12 15:31:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:02,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:31:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:02,194 INFO L225 Difference]: With dead ends: 638 [2019-01-12 15:31:02,194 INFO L226 Difference]: Without dead ends: 419 [2019-01-12 15:31:02,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-12 15:31:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-01-12 15:31:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-01-12 15:31:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-01-12 15:31:02,223 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-01-12 15:31:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:02,223 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-01-12 15:31:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-01-12 15:31:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:31:02,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:02,228 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:02,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:02,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-01-12 15:31:02,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:31:02,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:02,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:02,367 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-01-12 15:31:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:02,678 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-01-12 15:31:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:02,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-12 15:31:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:02,686 INFO L225 Difference]: With dead ends: 1095 [2019-01-12 15:31:02,687 INFO L226 Difference]: Without dead ends: 717 [2019-01-12 15:31:02,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-01-12 15:31:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-01-12 15:31:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-01-12 15:31:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-01-12 15:31:02,753 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-01-12 15:31:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:02,755 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-01-12 15:31:02,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-01-12 15:31:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:31:02,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:02,758 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:02,759 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-01-12 15:31:02,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:02,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:02,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:02,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:31:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:02,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:02,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:02,876 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-01-12 15:31:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:03,304 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-01-12 15:31:03,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:03,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-01-12 15:31:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:03,313 INFO L225 Difference]: With dead ends: 1933 [2019-01-12 15:31:03,313 INFO L226 Difference]: Without dead ends: 1271 [2019-01-12 15:31:03,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-01-12 15:31:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-01-12 15:31:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-01-12 15:31:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-01-12 15:31:03,404 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-01-12 15:31:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:03,405 INFO L480 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-01-12 15:31:03,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-01-12 15:31:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 15:31:03,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:03,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:03,413 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-01-12 15:31:03,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:03,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:03,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:31:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:03,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:03,534 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-01-12 15:31:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:04,070 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-01-12 15:31:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:04,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-12 15:31:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:04,086 INFO L225 Difference]: With dead ends: 3544 [2019-01-12 15:31:04,086 INFO L226 Difference]: Without dead ends: 2312 [2019-01-12 15:31:04,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-01-12 15:31:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-01-12 15:31:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-01-12 15:31:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-01-12 15:31:04,249 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-01-12 15:31:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:04,250 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-01-12 15:31:04,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-01-12 15:31:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:31:04,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:04,256 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:04,256 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-01-12 15:31:04,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:04,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:04,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:04,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-12 15:31:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:04,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:04,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:04,367 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-01-12 15:31:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:04,778 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-01-12 15:31:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:04,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-12 15:31:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:04,793 INFO L225 Difference]: With dead ends: 4080 [2019-01-12 15:31:04,793 INFO L226 Difference]: Without dead ends: 2324 [2019-01-12 15:31:04,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-01-12 15:31:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-01-12 15:31:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-01-12 15:31:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-01-12 15:31:04,946 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-01-12 15:31:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:04,947 INFO L480 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-01-12 15:31:04,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-01-12 15:31:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:31:04,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:04,956 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:04,957 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-01-12 15:31:04,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:04,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:04,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:04,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:04,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:31:05,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:05,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:05,087 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-01-12 15:31:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:05,572 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-01-12 15:31:05,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:05,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 15:31:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:05,584 INFO L225 Difference]: With dead ends: 4484 [2019-01-12 15:31:05,585 INFO L226 Difference]: Without dead ends: 2266 [2019-01-12 15:31:05,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-01-12 15:31:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-01-12 15:31:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-01-12 15:31:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-01-12 15:31:05,709 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-01-12 15:31:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:05,709 INFO L480 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-01-12 15:31:05,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-01-12 15:31:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:31:05,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:05,714 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:05,714 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-01-12 15:31:05,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:05,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:05,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:05,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:31:05,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:05,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:31:05,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:31:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:31:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:31:05,975 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-01-12 15:31:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:07,075 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-01-12 15:31:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:31:07,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 15:31:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:07,089 INFO L225 Difference]: With dead ends: 4182 [2019-01-12 15:31:07,090 INFO L226 Difference]: Without dead ends: 1933 [2019-01-12 15:31:07,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:31:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-01-12 15:31:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-01-12 15:31:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-01-12 15:31:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-01-12 15:31:07,329 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-01-12 15:31:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:07,330 INFO L480 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-01-12 15:31:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:31:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-01-12 15:31:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:31:07,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:07,332 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:07,333 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-01-12 15:31:07,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:07,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:31:07,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:07,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:31:07,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:31:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:31:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:07,423 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-01-12 15:31:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:07,738 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-01-12 15:31:07,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:31:07,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-12 15:31:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:07,745 INFO L225 Difference]: With dead ends: 2952 [2019-01-12 15:31:07,746 INFO L226 Difference]: Without dead ends: 1232 [2019-01-12 15:31:07,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:31:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-01-12 15:31:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-01-12 15:31:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-01-12 15:31:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-01-12 15:31:07,815 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-01-12 15:31:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:07,815 INFO L480 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-01-12 15:31:07,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:31:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-01-12 15:31:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:31:07,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:07,819 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:07,819 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-01-12 15:31:07,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:31:07,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:07,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:31:07,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:31:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:31:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:31:07,947 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-01-12 15:31:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:08,412 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-01-12 15:31:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:31:08,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-12 15:31:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:08,417 INFO L225 Difference]: With dead ends: 2222 [2019-01-12 15:31:08,418 INFO L226 Difference]: Without dead ends: 648 [2019-01-12 15:31:08,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:31:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-01-12 15:31:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-01-12 15:31:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-01-12 15:31:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-01-12 15:31:08,455 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-01-12 15:31:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-01-12 15:31:08,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:31:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-01-12 15:31:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:31:08,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:31:08,459 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:31:08,460 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:31:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:31:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-01-12 15:31:08,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:31:08,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:31:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:08,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:31:08,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:31:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:31:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:31:08,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:31:08,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:31:08,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:31:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:31:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:31:08,650 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-01-12 15:31:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:31:08,772 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-01-12 15:31:08,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:31:08,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 15:31:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:31:08,774 INFO L225 Difference]: With dead ends: 586 [2019-01-12 15:31:08,774 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:31:08,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:31:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:31:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:31:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:31:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:31:08,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-01-12 15:31:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:31:08,778 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:31:08,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:31:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:31:08,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:31:08,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:31:08,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:08,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:09,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:31:11,560 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:12,017 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:12,775 WARN L181 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:13,066 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:13,971 WARN L181 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:14,990 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:15,322 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 15:31:15,563 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:16,268 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:16,513 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:16,734 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 15:31:17,027 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:17,248 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:17,401 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-01-12 15:31:17,779 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 15:31:18,079 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 15:31:18,391 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:18,611 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:18,989 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:19,232 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:19,516 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:19,758 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:19,969 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 15:31:20,200 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 15:31:20,458 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-01-12 15:31:20,935 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:21,305 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 15:31:21,544 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-01-12 15:31:21,703 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-01-12 15:31:21,928 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-12 15:31:22,178 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 15:31:22,480 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 15:31:22,484 INFO L444 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,485 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 15:31:22,485 INFO L444 ceAbstractionStarter]: At program point L400(lines 384 402) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,485 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-01-12 15:31:22,486 INFO L444 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (and (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (< ~local~0 ~token~0) (= ~t1_pc~0 1) (= ~t1_i~0 1) (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (<= 2 ~t1_st~0) (<= 2 ~E_1~0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0) (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) [2019-01-12 15:31:22,486 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-01-12 15:31:22,486 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-01-12 15:31:22,486 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-01-12 15:31:22,486 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-01-12 15:31:22,486 INFO L444 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,487 INFO L444 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,487 INFO L444 ceAbstractionStarter]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-01-12 15:31:22,487 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-12 15:31:22,487 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,487 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,487 INFO L448 ceAbstractionStarter]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,487 INFO L444 ceAbstractionStarter]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,488 INFO L444 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= ~t1_pc~0 1))) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse2 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse9 (<= 2 ~M_E~0)) (.cse10 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 ~local~0) .cse9 .cse10 (<= ~local~0 ~token~0) (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (and .cse6 .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse9 .cse10))) [2019-01-12 15:31:22,488 INFO L448 ceAbstractionStarter]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,488 INFO L444 ceAbstractionStarter]: At program point L144-1(lines 132 146) the Hoare annotation is: (let ((.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_i~0 1))) (let ((.cse6 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse2 (and .cse7 .cse8 .cse9)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 (and .cse7 (not .cse4) (= ~t1_st~0 0) .cse8 .cse9) .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0))))) [2019-01-12 15:31:22,488 INFO L448 ceAbstractionStarter]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,488 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-01-12 15:31:22,488 INFO L444 ceAbstractionStarter]: At program point L144-2(lines 132 146) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse4 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~T1_E~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_1~0))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~m_st~0 0) (< ~local~0 ~token~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0) .cse5 .cse6 (= ~m_pc~0 0) .cse2 .cse3))) [2019-01-12 15:31:22,488 INFO L448 ceAbstractionStarter]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,489 INFO L444 ceAbstractionStarter]: At program point L144-3(lines 132 146) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse14 (= ~m_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (= ~m_pc~0 0)) (.cse16 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse13 (not .cse15)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_1~0)) (.cse12 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse8 .cse9 .cse11 .cse12) (and .cse1 .cse13 .cse4 .cse14 .cse5 .cse6 .cse8 .cse0 .cse2 .cse3 .cse10 .cse9 .cse11 .cse12) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse15 .cse8 .cse16 .cse0 .cse2 .cse9 .cse12) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse0 .cse2 .cse10 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse8 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12)))) [2019-01-12 15:31:22,489 INFO L448 ceAbstractionStarter]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,489 INFO L444 ceAbstractionStarter]: At program point L144-4(lines 132 146) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse14 (= ~m_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (= ~m_pc~0 0)) (.cse16 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse13 (not .cse15)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_1~0)) (.cse12 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse8 .cse9 .cse11 .cse12) (and .cse1 .cse13 .cse4 .cse14 .cse5 .cse6 .cse8 .cse0 .cse2 .cse3 .cse10 .cse9 .cse11 .cse12) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse15 .cse8 .cse16 .cse0 .cse2 .cse9 .cse12) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse0 .cse2 .cse10 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse8 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12)))) [2019-01-12 15:31:22,489 INFO L448 ceAbstractionStarter]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,489 INFO L448 ceAbstractionStarter]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,489 INFO L448 ceAbstractionStarter]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-01-12 15:31:22,489 INFO L444 ceAbstractionStarter]: At program point L343(lines 337 345) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,489 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,490 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-01-12 15:31:22,490 INFO L448 ceAbstractionStarter]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,490 INFO L444 ceAbstractionStarter]: At program point L145(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (not (= ~t1_pc~0 1))) (.cse5 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~t1_i~0 1)) (.cse0 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~t1_st~0 0)) (.cse9 (<= 2 ~M_E~0)) (.cse10 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~m_st~0) .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse5 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse0 .cse3 .cse4 (<= ~token~0 ~local~0) .cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse10 (<= ~local~0 ~token~0) (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)))) [2019-01-12 15:31:22,490 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-01-12 15:31:22,490 INFO L444 ceAbstractionStarter]: At program point L145-1(lines 129 147) the Hoare annotation is: (let ((.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_i~0 1))) (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse2 (and .cse7 .cse8 .cse9)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse5 (<= 2 ~t1_st~0)) (.cse10 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse3 .cse6 (and .cse7 (not .cse4) (= ~t1_st~0 0) .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse10)))) [2019-01-12 15:31:22,490 INFO L448 ceAbstractionStarter]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-01-12 15:31:22,490 INFO L444 ceAbstractionStarter]: At program point L145-2(lines 129 147) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse3 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse5 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_1~0))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~m_st~0 0) (< ~local~0 ~token~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0) .cse6 .cse7 (= ~m_pc~0 0) .cse2 .cse4))) [2019-01-12 15:31:22,491 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 15:31:22,491 INFO L444 ceAbstractionStarter]: At program point L145-3(lines 129 147) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse17 (not .cse15)) (.cse14 (= ~m_st~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse16 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse0 .cse2 .cse3 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse0 .cse2 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse15 .cse8 .cse16 .cse0 .cse2 .cse11 .cse9 .cse13) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse13) (and .cse1 .cse17 .cse4 .cse14 .cse5 .cse6 .cse8 .cse0 .cse2 .cse3 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse8 .cse11 .cse16 .cse9 .cse13)))) [2019-01-12 15:31:22,491 INFO L444 ceAbstractionStarter]: At program point L145-4(lines 129 147) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse17 (not .cse15)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse16 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse0 .cse2 .cse3 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse15 .cse8 .cse16 .cse0 .cse2 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse15 .cse8 .cse16 .cse0 .cse2 .cse11 .cse9 .cse13) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse1 .cse17 .cse4 .cse14 .cse5 .cse6 .cse8 .cse0 .cse2 .cse3 .cse10 .cse11 .cse9 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse8 .cse11 .cse16 .cse9 .cse13)))) [2019-01-12 15:31:22,491 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-01-12 15:31:22,491 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-01-12 15:31:22,492 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L444 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse4 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 1) .cse5 (<= ~token~0 ~local~0) .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7))) [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-01-12 15:31:22,493 INFO L444 ceAbstractionStarter]: At program point L381(lines 374 383) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= ~t1_pc~0 1)) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-01-12 15:31:22,493 INFO L448 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-01-12 15:31:22,494 INFO L444 ceAbstractionStarter]: At program point L317-2(lines 277 281) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (not (= ~t1_pc~0 1))) (.cse5 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~t1_i~0 1)) (.cse0 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~t1_st~0 0)) (.cse9 (<= 2 ~M_E~0)) (.cse10 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~m_st~0) .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse5 (= ~m_st~0 0) .cse6 .cse7 .cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse0 .cse3 .cse4 (<= ~token~0 ~local~0) .cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse10 (<= ~local~0 ~token~0) (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)))) [2019-01-12 15:31:22,494 INFO L448 ceAbstractionStarter]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-01-12 15:31:22,495 INFO L444 ceAbstractionStarter]: At program point L317-5(lines 1 473) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~E_M~0)) (.cse6 (= ~t1_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 .cse6 (<= 2 ~t1_st~0) .cse7) (and .cse0 .cse1 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (and .cse2 .cse8 .cse3 .cse4)) (and .cse0 .cse1 .cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (and .cse2 (not .cse6) .cse8 .cse3 .cse4) .cse7 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)))) [2019-01-12 15:31:22,495 INFO L448 ceAbstractionStarter]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-01-12 15:31:22,495 INFO L444 ceAbstractionStarter]: At program point L317-8(lines 1 473) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse1 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0) .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5) (and (and .cse1 (= ~m_st~0 0) .cse4 .cse5) (<= ~token~0 (+ ~local~0 1)) (< ~local~0 ~token~0) .cse0 .cse6 .cse7 .cse8))) [2019-01-12 15:31:22,495 INFO L448 ceAbstractionStarter]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-01-12 15:31:22,495 INFO L444 ceAbstractionStarter]: At program point L317-11(lines 277 281) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,495 INFO L448 ceAbstractionStarter]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-01-12 15:31:22,496 INFO L444 ceAbstractionStarter]: At program point L317-14(lines 350 354) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,496 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-01-12 15:31:22,496 INFO L444 ceAbstractionStarter]: At program point L153(lines 160 164) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= ~t1_pc~0 1)) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-01-12 15:31:22,496 INFO L444 ceAbstractionStarter]: At program point L153-1(lines 148 155) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,497 INFO L444 ceAbstractionStarter]: At program point L418-1(lines 273 455) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L444 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse3 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (= ~m_pc~0 0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse12 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= ~m_st~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= ~token~0 ~local~0) .cse9 (<= ~local~0 ~token~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse5 .cse12 .cse7 .cse9 .cse8 .cse10 .cse11) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 (= ~t1_pc~0 1) .cse7 .cse9 .cse8 .cse10 .cse11))) [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-01-12 15:31:22,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:31:22,498 INFO L444 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,498 INFO L444 ceAbstractionStarter]: At program point L190-1(lines 177 192) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,498 INFO L444 ceAbstractionStarter]: At program point L190-2(lines 177 192) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,499 INFO L444 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,499 INFO L444 ceAbstractionStarter]: At program point L191(lines 174 193) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,499 INFO L444 ceAbstractionStarter]: At program point L191-1(lines 174 193) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,499 INFO L444 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (<= 2 ~M_E~0)) (.cse8 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 0) .cse5 (<= ~token~0 ~local~0) .cse6 .cse7 .cse8 (<= ~local~0 ~token~0)))) [2019-01-12 15:31:22,500 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 174 193) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,500 INFO L444 ceAbstractionStarter]: At program point L125-1(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse3 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse6) (and .cse0 (not .cse3) (= ~t1_st~0 0) .cse1 .cse2 .cse4 .cse5 .cse6))) [2019-01-12 15:31:22,500 INFO L444 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse5 (<= 2 ~t1_st~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_1~0)) (.cse9 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 (< ~local~0 ~token~0) .cse2 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) (not .cse2) (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0) (= 0 ULTIMATE.start_activate_threads_~tmp~1) .cse3 .cse4 .cse8 .cse0 .cse1 (= ~t1_st~0 0) .cse6 .cse7 .cse9))) [2019-01-12 15:31:22,500 INFO L444 ceAbstractionStarter]: At program point L125-2(lines 113 127) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_pc~0 0) .cse3 .cse4 .cse5) (and (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) .cse2 .cse3 .cse4 .cse5))) [2019-01-12 15:31:22,500 INFO L444 ceAbstractionStarter]: At program point L125-3(lines 113 127) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse5 (<= 2 ~t1_st~0)) (.cse1 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (<= 2 ~E_M~0)) (.cse15 (not .cse3)) (.cse7 (<= 2 ~T1_E~0)) (.cse14 (= ~t1_st~0 0)) (.cse0 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse13 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse10 (<= 2 ~E_1~0)) (.cse12 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse7 .cse0 .cse3 .cse13 .cse4 .cse5 .cse10) (and .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse0 .cse1 (< ~local~0 ~token~0) .cse3 .cse4 .cse9 .cse5 .cse10 .cse12) (and .cse6 .cse7 .cse0 .cse2 .cse13 .cse4 .cse5 .cse10) (and .cse6 .cse7 .cse14 .cse0 .cse3 .cse13 .cse8 .cse4 .cse10 .cse11) (and .cse6 .cse7 .cse14 .cse0 .cse2 .cse13 .cse4 .cse10) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse15 .cse7 .cse14 .cse0 .cse13 .cse4 .cse9 .cse10 .cse12)))) [2019-01-12 15:31:22,501 INFO L444 ceAbstractionStarter]: At program point L125-4(lines 113 127) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse14 (<= 2 ~t1_st~0)) (.cse11 (= ~m_st~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse4 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse15 (not .cse13)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ~t1_st~0 0)) (.cse3 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse11 .cse12 .cse13 .cse6 .cse14 .cse0 .cse1 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse10) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse3 .cse11 (< ~local~0 ~token~0) .cse13 .cse6 .cse7 .cse14 .cse8 .cse10) (and .cse0 .cse1 .cse3 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse8) (and .cse15 .cse3 .cse11 .cse12 .cse6 .cse0 .cse1 .cse2 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10)))) [2019-01-12 15:31:22,501 INFO L444 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-01-12 15:31:22,501 INFO L444 ceAbstractionStarter]: At program point L126(lines 110 128) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= ~t1_pc~0 1))) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse2 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 (<= ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse6 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse9))) [2019-01-12 15:31:22,501 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 110 128) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse2 (= ~t1_pc~0 1)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 (not .cse2) (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 (<= ~token~0 ~local~0) .cse2 .cse5 .cse6 (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse7))) [2019-01-12 15:31:22,501 INFO L444 ceAbstractionStarter]: At program point L126-2(lines 110 128) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5) (and (<= ~token~0 (+ ~local~0 1)) .cse1 (< ~local~0 ~token~0) .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse3 .cse4 .cse5))) [2019-01-12 15:31:22,502 INFO L444 ceAbstractionStarter]: At program point L126-3(lines 110 128) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse13)) (.cse12 (= ~m_st~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse10 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse4 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse3 (<= 2 ~T1_E~0)) (.cse5 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~t1_i~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse9) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse12 (< ~local~0 ~token~0) .cse13 .cse7 .cse14 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse5 .cse11 .cse6 .cse7 .cse14 .cse9) (and .cse1 .cse2 .cse5 .cse12 .cse11 .cse7 .cse0 .cse3 .cse4 .cse15 .cse8 .cse9 .cse16 .cse10) (and .cse1 .cse5 .cse12 .cse11 .cse13 .cse7 .cse14 .cse0 .cse3 .cse15 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse13 .cse6 .cse7 .cse9 .cse16) (and .cse0 .cse1 .cse3 .cse5 .cse13 .cse6 .cse7 .cse14 .cse9)))) [2019-01-12 15:31:22,502 INFO L444 ceAbstractionStarter]: At program point L126-4(lines 110 128) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse15)) (.cse4 (= ~t1_st~0 0)) (.cse14 (= ~m_st~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse3 (<= 2 ~T1_E~0)) (.cse5 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse16 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse9) (and .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse14 (< ~local~0 ~token~0) .cse15 .cse7 .cse16 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse5 .cse11 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse5 .cse14 .cse11 .cse7 .cse0 .cse3 .cse4 .cse12 .cse8 .cse9 .cse13 .cse10) (and .cse1 .cse5 .cse14 .cse11 .cse15 .cse7 .cse16 .cse0 .cse3 .cse12 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10)))) [2019-01-12 15:31:22,502 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,502 INFO L444 ceAbstractionStarter]: At program point L292-3(lines 273 300) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse17)) (.cse14 (= ~m_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse13 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse12 .cse9 .cse13) (and .cse1 .cse10 .cse4 .cse14 .cse5 .cse6 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 .cse4 .cse14 .cse5 .cse6 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse15 .cse12 .cse9 .cse16 .cse13) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse14 (< ~local~0 ~token~0) .cse5 .cse17 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9) (and .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse18 .cse11 .cse0 .cse2 .cse12 .cse9 .cse13) (and .cse1 .cse4 .cse5 .cse7 .cse8 .cse11 .cse0 .cse2 .cse3 .cse15 .cse12 .cse9 .cse16 .cse13)))) [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:31:22,503 INFO L444 ceAbstractionStarter]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~M_E~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7))) [2019-01-12 15:31:22,503 INFO L444 ceAbstractionStarter]: At program point L264-3(lines 245 272) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse10)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (<= ~token~0 ~local~0)) (.cse15 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse12 (<= ~local~0 ~token~0)) (.cse16 (= 0 ULTIMATE.start_is_transmit1_triggered_~__retres1~1)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= 0 ULTIMATE.start_is_master_triggered_~__retres1~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11 .cse8 .cse9 .cse12) (and .cse1 .cse13 .cse4 .cse5 .cse7 .cse8 .cse14 .cse0 .cse2 .cse3 .cse15 .cse9 .cse16) (and .cse1 .cse13 .cse4 .cse17 .cse5 .cse6 .cse8 .cse14 .cse0 .cse2 .cse3 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse2 .cse5 .cse7 .cse10 .cse8 .cse18 .cse9 .cse14) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse17 (< ~local~0 ~token~0) .cse10 .cse8 .cse18 .cse15 .cse9 .cse14 .cse16) (and .cse1 .cse4 .cse17 .cse5 .cse6 .cse10 .cse8 .cse18 .cse14 .cse0 .cse2 .cse11 .cse15 .cse9 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9)))) [2019-01-12 15:31:22,512 INFO L444 ceAbstractionStarter]: At program point L165-1(lines 249 253) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~M_E~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_st~0 0) .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~m_st~0) .cse5 .cse6 .cse7))) [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,512 INFO L448 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-01-12 15:31:22,513 INFO L448 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-01-12 15:31:22,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:31:22 BoogieIcfgContainer [2019-01-12 15:31:22,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:31:22,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:31:22,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:31:22,673 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:31:22,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:00" (3/4) ... [2019-01-12 15:31:22,679 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:31:22,702 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:31:22,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:31:22,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 2 <= E_1) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) [2019-01-12 15:31:22,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 2 <= E_1) && local <= token) && 0 == __retres1) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) [2019-01-12 15:31:22,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) || ((((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,736 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,736 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,736 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,736 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,737 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == __retres1 && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((!(t1_pc == 1) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && token <= local) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) [2019-01-12 15:31:22,747 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && t1_pc == 1) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0) && 0 == __retres1) || ((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,747 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && token <= local) && 0 == \result) && local <= token) && tmp___0 == 0) && 0 == __retres1) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || ((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1) [2019-01-12 15:31:22,747 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1 [2019-01-12 15:31:22,747 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) [2019-01-12 15:31:22,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,749 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((token <= local + 1 && 2 <= T1_E) && local < token) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) [2019-01-12 15:31:22,752 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && token <= local) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && local <= token) && 0 == __retres1) || (((((((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && 0 == __retres1) && t1_i == 1) && 0 == \result) && 0 == __retres1) [2019-01-12 15:31:22,752 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,752 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= E_M) && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && 0 == __retres1) && t1_i == 1) && 0 == \result) && 0 == __retres1) || ((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && token <= local) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((token <= local + 1 && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) || ((((((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 0 == __retres1)) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) [2019-01-12 15:31:22,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((token <= local + 1 && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || (((((((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) [2019-01-12 15:31:22,753 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 2 <= t1_st) && 0 == __retres1) || ((((0 == \result && 0 == __retres1) && 0 == tmp) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && 0 == __retres1)) || (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) [2019-01-12 15:31:22,754 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,754 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) || (((((0 == \result && 0 == __retres1) && 0 == tmp) && 0 == \result) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && 0 == __retres1)) || (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 0 == \result) && 2 <= t1_st) && 0 == __retres1) [2019-01-12 15:31:22,754 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,754 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((t1_pc == 1 && (((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == \result) && tmp___0 == 0) && 0 == __retres1) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((((((2 <= T1_E && m_st == 0) && t1_i == 1) && 2 <= E_1) && token <= local + 1) && local < token) && t1_pc == 1) && 0 == \result) && tmp___0 == 0) && 0 == __retres1) [2019-01-12 15:31:22,754 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 2 <= t1_st) && tmp___0 == 0) || ((((((0 == \result && 0 == __retres1) && 0 == tmp) && token <= local) && t1_pc == 1) && local <= token) && ((2 <= E_M && t1_st == 0) && 2 <= T1_E) && t1_i == 1)) || ((((((0 == \result && 0 == __retres1) && 0 == tmp) && 0 == \result) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && tmp___0 == 0) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) || ((((((((((((0 == __retres1 && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((!(t1_pc == 1) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,759 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,759 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) [2019-01-12 15:31:22,759 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) [2019-01-12 15:31:22,873 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:31:22,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:31:22,874 INFO L168 Benchmark]: Toolchain (without parser) took 24364.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -265.1 MB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,876 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-12 15:31:22,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,881 INFO L168 Benchmark]: Boogie Preprocessor took 53.92 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-12 15:31:22,881 INFO L168 Benchmark]: RCFGBuilder took 1239.97 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,882 INFO L168 Benchmark]: TraceAbstraction took 22296.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.3 MB). Peak memory consumption was 546.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,882 INFO L168 Benchmark]: Witness Printer took 201.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:31:22,888 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 433.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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 134.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.92 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 1239.97 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22296.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.3 MB). Peak memory consumption was 546.8 MB. Max. memory is 11.5 GB. * Witness Printer took 201.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 462]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == __retres1 && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || (((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((!(t1_pc == 1) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && t1_pc == 1) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0) && 0 == __retres1) || ((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((2 <= T1_E && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((2 <= T1_E && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((token <= local + 1 && 2 <= T1_E) && local < token) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && token <= local) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && local <= token) && 0 == __retres1) || (((((((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && 0 == __retres1) && t1_i == 1) && 0 == \result) && 0 == __retres1) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) || (((((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) && local <= token) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) || ((((((((((((0 == __retres1 && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || (((((((2 <= E_M && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((2 <= E_M && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((!(t1_pc == 1) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 2 <= t1_st) && 0 == __retres1) || ((((0 == \result && 0 == __retres1) && 0 == tmp) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && 0 == __retres1)) || (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 2 <= E_1) && local <= token) && 0 == __retres1) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && token <= local) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((token <= local + 1 && 2 <= T1_E) && local < token) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= E_M) && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && 0 == __retres1) && t1_i == 1) && 0 == \result) && 0 == __retres1) || ((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && token <= local) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && local <= token) && 0 == __retres1) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 2 <= E_1) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1)) || ((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && token <= local) && 0 == \result) && local <= token) && tmp___0 == 0) && 0 == __retres1) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1)) || ((((((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1)) || ((((((((((2 <= E_M && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) && 0 == __retres1) - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((token <= local + 1 && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 0 == __retres1) || ((((((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && 0 == __retres1)) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((token <= local + 1 && 2 <= T1_E) && m_st == 0) && local < token) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1) || (((((((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_pc == 1) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) || (((((0 == \result && 0 == __retres1) && 0 == tmp) && 0 == \result) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && 0 == __retres1)) || (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 0 == \result) && 2 <= t1_st) && 0 == __retres1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == \result && 0 == __retres1) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && t1_pc == 1) && 2 <= t1_st) && tmp___0 == 0) || ((((((0 == \result && 0 == __retres1) && 0 == tmp) && token <= local) && t1_pc == 1) && local <= token) && ((2 <= E_M && t1_st == 0) && 2 <= T1_E) && t1_i == 1)) || ((((((0 == \result && 0 == __retres1) && 0 == tmp) && 0 == \result) && (((2 <= E_M && !(t1_pc == 1)) && t1_st == 0) && 2 <= T1_E) && t1_i == 1) && tmp___0 == 0) && 0 == __retres1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) || (((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && (((2 <= T1_E && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && 0 == \result) && tmp___0 == 0) && 0 == __retres1) || (((((((0 == \result && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((((((2 <= T1_E && m_st == 0) && t1_i == 1) && 2 <= E_1) && token <= local + 1) && local < token) && t1_pc == 1) && 0 == \result) && tmp___0 == 0) && 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 2 <= E_1) || ((((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) || ((((((((((((0 == \result && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || ((((((((((((((0 == \result && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((((((0 == \result && token <= local + 1) && 0 == __retres1) && m_st == 0) && local < token) && 0 == tmp) && t1_pc == 1) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || (((((((((((2 <= E_M && 0 == \result) && !(t1_pc == 1)) && 2 <= T1_E) && t1_st == 0) && 0 == __retres1) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= E_1) && 0 == __retres1)) || ((((((((((((((0 == \result && !(t1_pc == 1)) && 0 == __retres1) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && t1_st == 0) && token <= local) && 0 == \result) && 2 <= E_1) && local <= token) && 0 == __retres1)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1)) || (((((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == __retres1) && 0 == tmp) && t1_pc == 1) && 2 <= m_st) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && 0 == __retres1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. SAFE Result, 22.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 13.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 3044 SDtfs, 2703 SDslu, 1946 SDs, 0 SdLazy, 243 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2312occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 394 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 650 NumberOfFragments, 10246 HoareAnnotationTreeSize, 52 FomulaSimplifications, 19177 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 52 FomulaSimplificationsInter, 614 FormulaSimplificationTreeSizeReductionInter, 12.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 126390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 203/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...