./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer --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-678e011 [2019-11-19 23:54:51,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:54:51,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:54:51,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:54:51,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:54:51,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:54:51,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:54:51,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:54:51,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:54:51,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:54:51,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:54:51,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:54:51,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:54:51,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:54:51,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:54:51,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:54:51,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:54:51,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:54:51,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:54:51,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:54:51,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:54:51,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:54:51,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:54:51,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:54:51,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:54:51,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:54:51,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:54:51,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:54:51,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:54:51,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:54:51,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:54:51,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:54:51,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:54:51,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:54:51,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:54:51,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:54:51,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:54:51,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:54:51,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:54:51,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:54:51,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:54:51,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:54:51,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:54:51,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:54:51,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:54:51,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:54:51,576 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:54:51,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:54:51,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:54:51,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:54:51,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:54:51,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:54:51,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:54:51,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:54:51,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:54:51,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:54:51,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:54:51,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:54:51,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:54:51,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:54:51,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:54:51,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:54:51,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:54:51,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:54:51,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:54:51,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:54:51,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:54:51,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:54:51,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:54:51,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:54:51,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer 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-11-19 23:54:51,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:54:51,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:54:51,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:54:51,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:54:51,757 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:54:51,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-19 23:54:51,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/data/225d90134/80e2bcf433214d4991fa063cb336c145/FLAG5b0238b15 [2019-11-19 23:54:52,164 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:54:52,165 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2019-11-19 23:54:52,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/data/225d90134/80e2bcf433214d4991fa063cb336c145/FLAG5b0238b15 [2019-11-19 23:54:52,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/data/225d90134/80e2bcf433214d4991fa063cb336c145 [2019-11-19 23:54:52,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:54:52,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:54:52,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:54:52,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:54:52,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:54:52,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:52,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e8ef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52, skipping insertion in model container [2019-11-19 23:54:52,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:52,559 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:54:52,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:54:52,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:54:52,860 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:54:52,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:54:52,947 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:54:52,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52 WrapperNode [2019-11-19 23:54:52,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:54:52,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:54:52,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:54:52,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:54:52,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:52,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:54:53,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:54:53,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:54:53,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:54:53,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... [2019-11-19 23:54:53,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:54:53,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:54:53,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:54:53,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:54:53,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/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-11-19 23:54:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:54:53,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:54:53,650 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:54:53,650 INFO L285 CfgBuilder]: Removed 80 assume(true) statements. [2019-11-19 23:54:53,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:53 BoogieIcfgContainer [2019-11-19 23:54:53,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:54:53,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:54:53,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:54:53,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:54:53,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:54:52" (1/3) ... [2019-11-19 23:54:53,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3f4af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:54:53, skipping insertion in model container [2019-11-19 23:54:53,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:52" (2/3) ... [2019-11-19 23:54:53,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3f4af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:54:53, skipping insertion in model container [2019-11-19 23:54:53,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:53" (3/3) ... [2019-11-19 23:54:53,660 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-11-19 23:54:53,668 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:54:53,675 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:54:53,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:54:53,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:54:53,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:54:53,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:54:53,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:54:53,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:54:53,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:54:53,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:54:53,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:54:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-19 23:54:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:53,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:53,747 INFO L410 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-11-19 23:54:53,747 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-19 23:54:53,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:53,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140461076] [2019-11-19 23:54:53,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:53,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140461076] [2019-11-19 23:54:53,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:53,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:53,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742860451] [2019-11-19 23:54:53,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:53,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:53,907 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-11-19 23:54:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:53,950 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2019-11-19 23:54:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:53,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:53,963 INFO L225 Difference]: With dead ends: 277 [2019-11-19 23:54:53,963 INFO L226 Difference]: Without dead ends: 137 [2019-11-19 23:54:53,966 INFO L630 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-11-19 23:54:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-19 23:54:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-19 23:54:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-19 23:54:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-19 23:54:54,006 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2019-11-19 23:54:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,007 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-19 23:54:54,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-19 23:54:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:54,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,008 INFO L410 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-11-19 23:54:54,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-19 23:54:54,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818288341] [2019-11-19 23:54:54,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818288341] [2019-11-19 23:54:54,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:54,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553529583] [2019-11-19 23:54:54,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,048 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2019-11-19 23:54:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,115 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2019-11-19 23:54:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,119 INFO L225 Difference]: With dead ends: 363 [2019-11-19 23:54:54,119 INFO L226 Difference]: Without dead ends: 232 [2019-11-19 23:54:54,120 INFO L630 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-11-19 23:54:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-19 23:54:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2019-11-19 23:54:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:54:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2019-11-19 23:54:54,150 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2019-11-19 23:54:54,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,150 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2019-11-19 23:54:54,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2019-11-19 23:54:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:54,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,152 INFO L410 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-11-19 23:54:54,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-19 23:54:54,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964362999] [2019-11-19 23:54:54,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964362999] [2019-11-19 23:54:54,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:54,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649595625] [2019-11-19 23:54:54,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,196 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 3 states. [2019-11-19 23:54:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,237 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2019-11-19 23:54:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,240 INFO L225 Difference]: With dead ends: 453 [2019-11-19 23:54:54,240 INFO L226 Difference]: Without dead ends: 230 [2019-11-19 23:54:54,242 INFO L630 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-11-19 23:54:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-19 23:54:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-19 23:54:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:54:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2019-11-19 23:54:54,291 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2019-11-19 23:54:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,291 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2019-11-19 23:54:54,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2019-11-19 23:54:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:54,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,293 INFO L410 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-11-19 23:54:54,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-19 23:54:54,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216666617] [2019-11-19 23:54:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216666617] [2019-11-19 23:54:54,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:54,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777097591] [2019-11-19 23:54:54,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,335 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand 3 states. [2019-11-19 23:54:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,386 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2019-11-19 23:54:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,389 INFO L225 Difference]: With dead ends: 452 [2019-11-19 23:54:54,389 INFO L226 Difference]: Without dead ends: 230 [2019-11-19 23:54:54,390 INFO L630 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-11-19 23:54:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-19 23:54:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-19 23:54:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:54:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2019-11-19 23:54:54,410 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2019-11-19 23:54:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,410 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2019-11-19 23:54:54,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2019-11-19 23:54:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:54,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,412 INFO L410 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-11-19 23:54:54,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-19 23:54:54,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779966701] [2019-11-19 23:54:54,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779966701] [2019-11-19 23:54:54,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:54,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918662694] [2019-11-19 23:54:54,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,453 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand 3 states. [2019-11-19 23:54:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,510 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2019-11-19 23:54:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,513 INFO L225 Difference]: With dead ends: 451 [2019-11-19 23:54:54,513 INFO L226 Difference]: Without dead ends: 230 [2019-11-19 23:54:54,514 INFO L630 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-11-19 23:54:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-19 23:54:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-19 23:54:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:54:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 305 transitions. [2019-11-19 23:54:54,528 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 305 transitions. Word has length 39 [2019-11-19 23:54:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,528 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 305 transitions. [2019-11-19 23:54:54,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2019-11-19 23:54:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:54:54,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,530 INFO L410 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-11-19 23:54:54,530 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-19 23:54:54,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106261020] [2019-11-19 23:54:54,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106261020] [2019-11-19 23:54:54,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:54,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956661026] [2019-11-19 23:54:54,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,575 INFO L87 Difference]: Start difference. First operand 230 states and 305 transitions. Second operand 3 states. [2019-11-19 23:54:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,649 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2019-11-19 23:54:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:54:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,653 INFO L225 Difference]: With dead ends: 638 [2019-11-19 23:54:54,654 INFO L226 Difference]: Without dead ends: 419 [2019-11-19 23:54:54,655 INFO L630 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-11-19 23:54:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-19 23:54:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2019-11-19 23:54:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-19 23:54:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 517 transitions. [2019-11-19 23:54:54,678 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 517 transitions. Word has length 39 [2019-11-19 23:54:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,679 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 517 transitions. [2019-11-19 23:54:54,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 517 transitions. [2019-11-19 23:54:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:54:54,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,688 INFO L410 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-11-19 23:54:54,688 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1499945056, now seen corresponding path program 1 times [2019-11-19 23:54:54,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367782499] [2019-11-19 23:54:54,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367782499] [2019-11-19 23:54:54,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:54,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984375291] [2019-11-19 23:54:54,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,751 INFO L87 Difference]: Start difference. First operand 395 states and 517 transitions. Second operand 3 states. [2019-11-19 23:54:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:54,826 INFO L93 Difference]: Finished difference Result 1095 states and 1440 transitions. [2019-11-19 23:54:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:54,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-19 23:54:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:54,832 INFO L225 Difference]: With dead ends: 1095 [2019-11-19 23:54:54,832 INFO L226 Difference]: Without dead ends: 717 [2019-11-19 23:54:54,833 INFO L630 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-11-19 23:54:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-19 23:54:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 687. [2019-11-19 23:54:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-19 23:54:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 897 transitions. [2019-11-19 23:54:54,872 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 897 transitions. Word has length 63 [2019-11-19 23:54:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:54,875 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 897 transitions. [2019-11-19 23:54:54,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 897 transitions. [2019-11-19 23:54:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:54:54,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:54,877 INFO L410 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-11-19 23:54:54,877 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:54,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1803857567, now seen corresponding path program 1 times [2019-11-19 23:54:54,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:54,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994570509] [2019-11-19 23:54:54,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:54,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994570509] [2019-11-19 23:54:54,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:54,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:54,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287199454] [2019-11-19 23:54:54,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:54,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:54,955 INFO L87 Difference]: Start difference. First operand 687 states and 897 transitions. Second operand 3 states. [2019-11-19 23:54:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:55,053 INFO L93 Difference]: Finished difference Result 1933 states and 2521 transitions. [2019-11-19 23:54:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:55,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-19 23:54:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:55,062 INFO L225 Difference]: With dead ends: 1933 [2019-11-19 23:54:55,062 INFO L226 Difference]: Without dead ends: 1271 [2019-11-19 23:54:55,063 INFO L630 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-11-19 23:54:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-11-19 23:54:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1257. [2019-11-19 23:54:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-11-19 23:54:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1607 transitions. [2019-11-19 23:54:55,130 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1607 transitions. Word has length 63 [2019-11-19 23:54:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:55,131 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 1607 transitions. [2019-11-19 23:54:55,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1607 transitions. [2019-11-19 23:54:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 23:54:55,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:55,133 INFO L410 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-11-19 23:54:55,133 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash -45669778, now seen corresponding path program 1 times [2019-11-19 23:54:55,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:55,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036568265] [2019-11-19 23:54:55,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:55,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036568265] [2019-11-19 23:54:55,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:55,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:55,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514191845] [2019-11-19 23:54:55,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:55,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:55,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:55,203 INFO L87 Difference]: Start difference. First operand 1257 states and 1607 transitions. Second operand 3 states. [2019-11-19 23:54:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:55,339 INFO L93 Difference]: Finished difference Result 3544 states and 4519 transitions. [2019-11-19 23:54:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:55,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 23:54:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:55,351 INFO L225 Difference]: With dead ends: 3544 [2019-11-19 23:54:55,352 INFO L226 Difference]: Without dead ends: 2312 [2019-11-19 23:54:55,354 INFO L630 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-11-19 23:54:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-19 23:54:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2019-11-19 23:54:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-19 23:54:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2876 transitions. [2019-11-19 23:54:55,491 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2876 transitions. Word has length 64 [2019-11-19 23:54:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:55,492 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2876 transitions. [2019-11-19 23:54:55,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2876 transitions. [2019-11-19 23:54:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 23:54:55,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:55,495 INFO L410 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-11-19 23:54:55,495 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash 460727628, now seen corresponding path program 1 times [2019-11-19 23:54:55,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:55,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464514697] [2019-11-19 23:54:55,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:54:55,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464514697] [2019-11-19 23:54:55,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:55,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:55,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134390927] [2019-11-19 23:54:55,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:55,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:55,553 INFO L87 Difference]: Start difference. First operand 2312 states and 2876 transitions. Second operand 3 states. [2019-11-19 23:54:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:55,665 INFO L93 Difference]: Finished difference Result 4080 states and 5097 transitions. [2019-11-19 23:54:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:55,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-19 23:54:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:55,678 INFO L225 Difference]: With dead ends: 4080 [2019-11-19 23:54:55,678 INFO L226 Difference]: Without dead ends: 2324 [2019-11-19 23:54:55,681 INFO L630 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-11-19 23:54:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-11-19 23:54:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2264. [2019-11-19 23:54:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-19 23:54:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2740 transitions. [2019-11-19 23:54:55,771 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2740 transitions. Word has length 93 [2019-11-19 23:54:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:55,778 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2740 transitions. [2019-11-19 23:54:55,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2740 transitions. [2019-11-19 23:54:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:54:55,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:55,782 INFO L410 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-11-19 23:54:55,782 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash -491999912, now seen corresponding path program 1 times [2019-11-19 23:54:55,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:55,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135426476] [2019-11-19 23:54:55,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:54:55,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135426476] [2019-11-19 23:54:55,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:55,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:55,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382027190] [2019-11-19 23:54:55,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:55,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:55,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:55,829 INFO L87 Difference]: Start difference. First operand 2264 states and 2740 transitions. Second operand 3 states. [2019-11-19 23:54:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:55,942 INFO L93 Difference]: Finished difference Result 4484 states and 5430 transitions. [2019-11-19 23:54:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:55,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-19 23:54:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:55,954 INFO L225 Difference]: With dead ends: 4484 [2019-11-19 23:54:55,955 INFO L226 Difference]: Without dead ends: 2266 [2019-11-19 23:54:55,958 INFO L630 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-11-19 23:54:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-11-19 23:54:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-11-19 23:54:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-19 23:54:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2700 transitions. [2019-11-19 23:54:56,055 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2700 transitions. Word has length 94 [2019-11-19 23:54:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:56,055 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 2700 transitions. [2019-11-19 23:54:56,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2700 transitions. [2019-11-19 23:54:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:54:56,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:56,058 INFO L410 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-11-19 23:54:56,058 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2077878383, now seen corresponding path program 1 times [2019-11-19 23:54:56,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940553885] [2019-11-19 23:54:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 23:54:56,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940553885] [2019-11-19 23:54:56,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:56,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:54:56,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428826391] [2019-11-19 23:54:56,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:54:56,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:54:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:54:56,125 INFO L87 Difference]: Start difference. First operand 2264 states and 2700 transitions. Second operand 5 states. [2019-11-19 23:54:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:56,317 INFO L93 Difference]: Finished difference Result 4182 states and 5007 transitions. [2019-11-19 23:54:56,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:54:56,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-19 23:54:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:56,326 INFO L225 Difference]: With dead ends: 4182 [2019-11-19 23:54:56,326 INFO L226 Difference]: Without dead ends: 1933 [2019-11-19 23:54:56,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:54:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-11-19 23:54:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1745. [2019-11-19 23:54:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-11-19 23:54:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2049 transitions. [2019-11-19 23:54:56,447 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2049 transitions. Word has length 94 [2019-11-19 23:54:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:56,448 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 2049 transitions. [2019-11-19 23:54:56,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:54:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2049 transitions. [2019-11-19 23:54:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:54:56,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:56,450 INFO L410 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-11-19 23:54:56,450 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash -267062732, now seen corresponding path program 1 times [2019-11-19 23:54:56,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:56,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482943080] [2019-11-19 23:54:56,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:56,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482943080] [2019-11-19 23:54:56,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:56,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:56,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937585703] [2019-11-19 23:54:56,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:56,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:56,518 INFO L87 Difference]: Start difference. First operand 1745 states and 2049 transitions. Second operand 3 states. [2019-11-19 23:54:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:56,631 INFO L93 Difference]: Finished difference Result 2952 states and 3474 transitions. [2019-11-19 23:54:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:56,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-19 23:54:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:56,657 INFO L225 Difference]: With dead ends: 2952 [2019-11-19 23:54:56,657 INFO L226 Difference]: Without dead ends: 1232 [2019-11-19 23:54:56,659 INFO L630 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-11-19 23:54:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-19 23:54:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1224. [2019-11-19 23:54:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-11-19 23:54:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1403 transitions. [2019-11-19 23:54:56,726 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1403 transitions. Word has length 94 [2019-11-19 23:54:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:56,727 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 1403 transitions. [2019-11-19 23:54:56,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1403 transitions. [2019-11-19 23:54:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:54:56,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:56,729 INFO L410 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-11-19 23:54:56,729 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1230973766, now seen corresponding path program 1 times [2019-11-19 23:54:56,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:56,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640984100] [2019-11-19 23:54:56,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:54:56,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640984100] [2019-11-19 23:54:56,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:56,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:54:56,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097142698] [2019-11-19 23:54:56,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:54:56,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:54:56,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:54:56,786 INFO L87 Difference]: Start difference. First operand 1224 states and 1403 transitions. Second operand 5 states. [2019-11-19 23:54:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:56,927 INFO L93 Difference]: Finished difference Result 2222 states and 2544 transitions. [2019-11-19 23:54:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:54:56,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-19 23:54:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:56,931 INFO L225 Difference]: With dead ends: 2222 [2019-11-19 23:54:56,931 INFO L226 Difference]: Without dead ends: 648 [2019-11-19 23:54:56,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:54:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-19 23:54:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 582. [2019-11-19 23:54:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-19 23:54:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2019-11-19 23:54:56,970 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 95 [2019-11-19 23:54:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:56,971 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2019-11-19 23:54:56,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:54:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2019-11-19 23:54:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:54:56,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:56,972 INFO L410 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-11-19 23:54:56,973 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2019-11-19 23:54:56,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:56,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298964916] [2019-11-19 23:54:56,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 23:54:57,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298964916] [2019-11-19 23:54:57,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:57,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:54:57,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165498918] [2019-11-19 23:54:57,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:54:57,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:54:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:57,081 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2019-11-19 23:54:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:57,136 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2019-11-19 23:54:57,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:54:57,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:54:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:57,137 INFO L225 Difference]: With dead ends: 586 [2019-11-19 23:54:57,137 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:54:57,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:54:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:54:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:54:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:54:57,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-19 23:54:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:57,141 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:54:57,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:54:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:54:57,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:54:57,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:54:58,359 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:54:58,674 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:54:59,026 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:54:59,287 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:54:59,574 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:54:59,825 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:00,050 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-19 23:55:00,312 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:00,915 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:01,185 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:01,404 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-19 23:55:01,690 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:01,855 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:01,990 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-11-19 23:55:02,177 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 23:55:02,390 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 23:55:02,623 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:02,784 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:03,060 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:03,245 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:03,412 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:03,595 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:03,757 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 23:55:03,913 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 23:55:04,084 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-19 23:55:04,266 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:04,509 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:55:04,693 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-11-19 23:55:05,114 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 23:55:05,339 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 23:55:05,342 INFO L440 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,342 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 23:55:05,342 INFO L440 ceAbstractionStarter]: At program point L400(lines 384 402) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,342 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-19 23:55:05,342 INFO L440 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (and (<= 2 ~E_M~0) (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (< ~local~0 ~token~0) (= ~t1_i~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= 2 ~t1_st~0) (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) (<= 2 ~E_1~0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) [2019-11-19 23:55:05,343 INFO L444 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-19 23:55:05,343 INFO L444 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-11-19 23:55:05,343 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-11-19 23:55:05,343 INFO L440 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,343 INFO L440 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,343 INFO L440 ceAbstractionStarter]: At program point L471(lines 462 473) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-19 23:55:05,344 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-19 23:55:05,344 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,344 INFO L444 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,344 INFO L444 ceAbstractionStarter]: For program point L309-3(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,344 INFO L440 ceAbstractionStarter]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,344 INFO L440 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 (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-19 23:55:05,344 INFO L444 ceAbstractionStarter]: For program point L309-5(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,345 INFO L440 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 ((.cse2 (and .cse7 .cse8 .cse9)) (.cse5 (<= 2 ~t1_st~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse5 .cse6 (<= ~local~0 ~token~0)) (and .cse0 .cse7 (not .cse1) .cse8 .cse3 .cse4 .cse9 (= 0 ~t1_st~0) .cse6)))) [2019-11-19 23:55:05,345 INFO L444 ceAbstractionStarter]: For program point L309-6(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,345 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 86) no Hoare annotation was computed. [2019-11-19 23:55:05,345 INFO L440 ceAbstractionStarter]: At program point L144-2(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse4))) [2019-11-19 23:55:05,345 INFO L444 ceAbstractionStarter]: For program point L309-8(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,345 INFO L440 ceAbstractionStarter]: At program point L144-3(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse15 .cse5 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse8 .cse3 .cse15 .cse9 .cse5 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse11 .cse12)))) [2019-11-19 23:55:05,345 INFO L444 ceAbstractionStarter]: For program point L309-9(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,346 INFO L440 ceAbstractionStarter]: At program point L144-4(lines 132 146) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse14 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse14 .cse8 .cse3 .cse16 .cse5 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse7 .cse8 .cse3 .cse16 .cse9 .cse5 .cse10 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse16 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse15 .cse11 .cse12) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse16 .cse5 .cse6 .cse11 .cse12)))) [2019-11-19 23:55:05,346 INFO L444 ceAbstractionStarter]: For program point L309-11(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,346 INFO L444 ceAbstractionStarter]: For program point L309-12(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,346 INFO L444 ceAbstractionStarter]: For program point L309-14(lines 309 313) no Hoare annotation was computed. [2019-11-19 23:55:05,346 INFO L440 ceAbstractionStarter]: At program point L343(lines 337 345) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,346 INFO L444 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,347 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-11-19 23:55:05,347 INFO L444 ceAbstractionStarter]: For program point L277-3(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,347 INFO L440 ceAbstractionStarter]: At program point L145(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-19 23:55:05,347 INFO L444 ceAbstractionStarter]: For program point L178-1(lines 178 188) no Hoare annotation was computed. [2019-11-19 23:55:05,347 INFO L440 ceAbstractionStarter]: At program point L145-1(lines 129 147) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_i~0 1))) (let ((.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and .cse6 .cse7 .cse9)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0)) (and .cse0 .cse6 (not .cse1) .cse7 .cse3 .cse8 .cse9 .cse10 (= 0 ~t1_st~0) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5)))) [2019-11-19 23:55:05,347 INFO L444 ceAbstractionStarter]: For program point L178-2(lines 178 188) no Hoare annotation was computed. [2019-11-19 23:55:05,347 INFO L440 ceAbstractionStarter]: At program point L145-2(lines 129 147) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4))) [2019-11-19 23:55:05,347 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 23:55:05,348 INFO L440 ceAbstractionStarter]: At program point L145-3(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-11-19 23:55:05,348 INFO L440 ceAbstractionStarter]: At program point L145-4(lines 129 147) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0))) (let ((.cse17 (not .cse1)) (.cse9 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse16 (= 0 ~t1_st~0)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse8 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse15 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse0 .cse17 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse16 .cse12 .cse13) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse12 .cse13) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse12 .cse13) (and .cse7 .cse0 .cse8 .cse3 .cse4 .cse15 .cse5 .cse6 .cse12 .cse13)))) [2019-11-19 23:55:05,348 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-11-19 23:55:05,348 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,348 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-19 23:55:05,348 INFO L444 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,348 INFO L444 ceAbstractionStarter]: For program point L114-3(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-5(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-6(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-8(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-9(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-11(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-12(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L114-14(lines 114 123) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L115-1(lines 115 120) no Hoare annotation was computed. [2019-11-19 23:55:05,349 INFO L440 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_activate_threads_~tmp~1)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= 1 ~t1_pc~0) .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 (<= ~local~0 ~token~0) .cse7))) [2019-11-19 23:55:05,349 INFO L444 ceAbstractionStarter]: For program point L115-2(lines 115 120) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L115-3(lines 115 120) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L115-4(lines 115 120) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 182 187) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L440 ceAbstractionStarter]: At program point L381(lines 374 383) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L249-2(lines 249 253) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L282-3(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,350 INFO L444 ceAbstractionStarter]: For program point L249-4(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L444 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L440 ceAbstractionStarter]: At program point L317-2(lines 277 281) the Hoare annotation is: (let ((.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (<= 2 ~T1_E~0)) (.cse2 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse8 (<= 2 ~M_E~0)) (.cse5 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse6 .cse7 (<= ~token~0 ~local~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse8 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse9 .cse10 (<= ~local~0 ~token~0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse8 .cse5 .cse9 .cse10))) [2019-11-19 23:55:05,351 INFO L444 ceAbstractionStarter]: For program point L317-3(lines 317 321) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L440 ceAbstractionStarter]: At program point L317-5(lines 1 473) the Hoare annotation is: (let ((.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse5 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~t1_i~0 1)) (.cse8 (= 0 ~t1_st~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 (<= 2 ~t1_st~0) .cse6 .cse7) (and .cse0 .cse2 (not .cse1) .cse3 .cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse4 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|) .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse1 .cse3 .cse5 (<= ~token~0 ~local~0) .cse4 .cse8 .cse6 (<= ~local~0 ~token~0)))) [2019-11-19 23:55:05,351 INFO L444 ceAbstractionStarter]: For program point L317-6(lines 317 321) no Hoare annotation was computed. [2019-11-19 23:55:05,351 INFO L440 ceAbstractionStarter]: At program point L317-8(lines 1 473) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse2 (<= 2 ~m_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0))) (or (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3 .cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4 .cse8) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) (= ~m_st~0 0) .cse6 .cse3 .cse7 .cse4 .cse8))) [2019-11-19 23:55:05,352 INFO L444 ceAbstractionStarter]: For program point L317-9(lines 317 321) no Hoare annotation was computed. [2019-11-19 23:55:05,352 INFO L440 ceAbstractionStarter]: At program point L317-11(lines 277 281) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,352 INFO L444 ceAbstractionStarter]: For program point L317-12(lines 317 321) no Hoare annotation was computed. [2019-11-19 23:55:05,352 INFO L440 ceAbstractionStarter]: At program point L317-14(lines 350 354) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,352 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-11-19 23:55:05,353 INFO L440 ceAbstractionStarter]: At program point L153(lines 160 164) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= 1 ~t1_pc~0)) (<= 2 ~T1_E~0) (= ~m_st~0 0) (= ~m_pc~0 0) (<= ~token~0 ~local~0) (= ~t1_i~0 1) (<= 2 ~M_E~0) (= 0 ~t1_st~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) [2019-11-19 23:55:05,355 INFO L440 ceAbstractionStarter]: At program point L153-1(lines 148 155) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,355 INFO L440 ceAbstractionStarter]: At program point L418-1(lines 273 455) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,356 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 23:55:05,356 INFO L444 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,356 INFO L444 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,356 INFO L444 ceAbstractionStarter]: For program point L287-3(lines 276 299) no Hoare annotation was computed. [2019-11-19 23:55:05,356 INFO L444 ceAbstractionStarter]: For program point L254-3(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,356 INFO L440 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse9 (<= 2 ~m_st~0)) (.cse10 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (= ~m_st~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse8 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ~t1_i~0 1)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse4 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and (= 1 ~t1_pc~0) (<= ~token~0 (+ ~local~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (< ~local~0 ~token~0) .cse5 .cse6 .cse7) (and .cse5 .cse6 (and .cse0 .cse1 .cse8 .cse9 .cse3 .cse4) .cse7) (and .cse10 .cse0 .cse1 .cse11 .cse8 .cse9 .cse3 .cse4 .cse12) (and .cse10 .cse2 .cse11 .cse8 .cse3 .cse7 .cse0 .cse1 (<= ~token~0 ~local~0) .cse5 .cse6 .cse4 .cse12 (<= ~local~0 ~token~0)))) [2019-11-19 23:55:05,357 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-19 23:55:05,357 INFO L444 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-11-19 23:55:05,357 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:55:05,357 INFO L440 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,358 INFO L440 ceAbstractionStarter]: At program point L190-1(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,358 INFO L440 ceAbstractionStarter]: At program point L190-2(lines 177 192) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,358 INFO L440 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,359 INFO L440 ceAbstractionStarter]: At program point L191(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,359 INFO L440 ceAbstractionStarter]: At program point L191-1(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,359 INFO L440 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-11-19 23:55:05,360 INFO L440 ceAbstractionStarter]: At program point L191-2(lines 174 193) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,360 INFO L440 ceAbstractionStarter]: At program point L125-1(lines 113 127) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 (= 0 ~t1_st~0) .cse6) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 (<= ~local~0 ~token~0)))) [2019-11-19 23:55:05,360 INFO L440 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse5 (<= 2 ~t1_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse9 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse0 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse8) (and (= 0 |ULTIMATE.start_is_master_triggered_#res|) (not .cse1) (= 0 ULTIMATE.start_activate_threads_~tmp~1) .cse9 .cse3 (= 0 ~t1_st~0) .cse8 .cse0 .cse2 .cse4 .cse6 .cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)))) [2019-11-19 23:55:05,361 INFO L440 ceAbstractionStarter]: At program point L125-2(lines 113 127) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 (= ~m_pc~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= ~token~0 (+ ~local~0 1)) .cse0 (< ~local~0 ~token~0) .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-11-19 23:55:05,361 INFO L440 ceAbstractionStarter]: At program point L125-3(lines 113 127) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0))) (let ((.cse1 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t1_st~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~m_st~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse14 .cse10 .cse11) (and .cse5 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse1 (< ~local~0 ~token~0) .cse3 .cse8 .cse9 .cse4 .cse10 .cse11) (and .cse5 .cse6 .cse2 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse15 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse15 .cse6 .cse13 .cse3 .cse8 .cse9 .cse14 .cse10 .cse11) (and .cse5 .cse0 .cse6 .cse13 .cse7 .cse3 .cse14 .cse10 .cse11 .cse12) (and .cse5 .cse0 .cse6 .cse13 .cse3 .cse4 .cse10 .cse11)))) [2019-11-19 23:55:05,361 INFO L440 ceAbstractionStarter]: At program point L125-4(lines 113 127) the Hoare annotation is: (let ((.cse8 (= 1 ~t1_pc~0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse9 (= ~m_st~0 0)) (.cse2 (= ~m_pc~0 0)) (.cse15 (not .cse8)) (.cse0 (<= 2 ~E_M~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse13 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse4 .cse10 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse9 (< ~local~0 ~token~0) .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse12 .cse13 .cse10 .cse6 .cse7) (and .cse15 .cse9 .cse2 .cse4 .cse5 .cse0 .cse1 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse15 .cse1 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse6 .cse7 .cse14)))) [2019-11-19 23:55:05,361 INFO L440 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (= ~t1_i~0 1) [2019-11-19 23:55:05,362 INFO L440 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 (= 1 ~t1_pc~0))) (.cse6 (<= 2 ~T1_E~0)) (.cse2 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse7 (<= 2 ~M_E~0)) (.cse4 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) .cse7 .cse8 .cse9 (<= ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse6 .cse2 (<= 2 ~m_st~0) .cse3 .cse7 .cse4 .cse8 .cse9))) [2019-11-19 23:55:05,362 INFO L440 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)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 (<= 2 ~t1_st~0) .cse7 (<= ~local~0 ~token~0)))) [2019-11-19 23:55:05,362 INFO L440 ceAbstractionStarter]: At program point L126-2(lines 110 128) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse0 .cse2 (= ~m_pc~0 0) .cse3 .cse4 .cse5 .cse6))) [2019-11-19 23:55:05,362 INFO L440 ceAbstractionStarter]: At program point L126-3(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse1 (not .cse14)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse16 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse15 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse6 .cse0 .cse1 .cse7 .cse16 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (and .cse6 .cse0 .cse14 .cse7 .cse8 .cse16 .cse4 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse7 .cse3 .cse16 .cse4 .cse15 .cse11 .cse12) (and .cse6 .cse0 .cse14 .cse7 .cse16 .cse4 .cse15 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse3 .cse16 .cse4 .cse5 .cse11 .cse12)))) [2019-11-19 23:55:05,363 INFO L440 ceAbstractionStarter]: At program point L126-4(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse2 (= ~m_st~0 0)) (.cse1 (not .cse14)) (.cse16 (<= 2 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse7 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse14 .cse7 .cse15 .cse4 .cse9 .cse10 .cse16 .cse11 .cse12) (and .cse0 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse4 .cse16 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse14 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse7 .cse15 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse16 .cse11 .cse12) (and .cse0 .cse6 .cse7 .cse15 .cse8 .cse4 .cse9 .cse10 .cse5 .cse11 .cse12 .cse13) (and .cse6 .cse0 .cse7 .cse3 .cse15 .cse4 .cse5 .cse11 .cse12)))) [2019-11-19 23:55:05,363 INFO L444 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,363 INFO L440 ceAbstractionStarter]: At program point L292-3(lines 273 300) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse10 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse17 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse3 .cse17 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse6 .cse13 .cse14) (and .cse0 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse2 (< ~local~0 ~token~0) .cse3 .cse5 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse14)))) [2019-11-19 23:55:05,363 INFO L444 ceAbstractionStarter]: For program point L259-3(lines 248 271) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-11-19 23:55:05,364 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:55:05,365 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-19 23:55:05,365 INFO L440 ceAbstractionStarter]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-11-19 23:55:05,365 INFO L440 ceAbstractionStarter]: At program point L264-3(lines 245 272) the Hoare annotation is: (let ((.cse16 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse16)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_transmit1_triggered_#res|)) (.cse15 (<= ~local~0 ~token~0)) (.cse6 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~E_M~0)) (.cse0 (= 0 |ULTIMATE.start_is_master_triggered_#res|)) (.cse9 (<= 2 ~T1_E~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ~m_pc~0 0)) (.cse18 (<= 2 ~m_st~0)) (.cse5 (= ~t1_i~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_1~0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse2 (< ~local~0 ~token~0) .cse5 .cse11 .cse17 .cse12 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse8 .cse0 .cse16 .cse9 .cse3 .cse18 .cse10 .cse5 .cse6 .cse13 .cse14 .cse15) (and .cse8 .cse16 .cse9 .cse3 .cse18 .cse5 .cse17 .cse13 .cse7) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse6 .cse13 .cse14) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse18 .cse5 .cse17 .cse13 .cse14)))) [2019-11-19 23:55:05,365 INFO L440 ceAbstractionStarter]: At program point L165-1(lines 249 253) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_M~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~E_1~0))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7))) [2019-11-19 23:55:05,365 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-3(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-5(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-6(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-8(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,366 INFO L444 ceAbstractionStarter]: For program point L133-9(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L133-11(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L133-12(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L133-14(lines 133 142) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L134-2(lines 134 139) no Hoare annotation was computed. [2019-11-19 23:55:05,367 INFO L444 ceAbstractionStarter]: For program point L134-3(lines 134 139) no Hoare annotation was computed. [2019-11-19 23:55:05,368 INFO L444 ceAbstractionStarter]: For program point L134-4(lines 134 139) no Hoare annotation was computed. [2019-11-19 23:55:05,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:55:05 BoogieIcfgContainer [2019-11-19 23:55:05,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:55:05,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:55:05,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:55:05,449 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:55:05,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:53" (3/4) ... [2019-11-19 23:55:05,452 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:55:05,468 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 23:55:05,469 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:55:05,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,498 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,498 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,498 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,498 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,499 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,499 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,499 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) || (((((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && m_pc == 0) && token <= local) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == t1_pc && token <= local + 1) && (((2 <= E_M && 2 <= T1_E) && m_st == 0) && t1_i == 1) && 2 <= E_1) && local < token) && __retres1 == 0) && 0 == \result) && tmp___0 == 0) || (((__retres1 == 0 && 0 == \result) && ((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && tmp___0 == 0)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && m_st == 0) && m_pc == 0) && 0 == tmp) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) [2019-11-19 23:55:05,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0 [2019-11-19 23:55:05,501 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token) && __retres1 == 0) [2019-11-19 23:55:05,501 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,501 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,502 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,502 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,502 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) [2019-11-19 23:55:05,502 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,503 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || ((((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) [2019-11-19 23:55:05,503 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,503 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,503 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= E_1)) || (((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 2 <= E_1) [2019-11-19 23:55:05,504 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1)) || (((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) [2019-11-19 23:55:05,504 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token)) || ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) [2019-11-19 23:55:05,504 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,504 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0)) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) [2019-11-19 23:55:05,505 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,505 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 == \result && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || (((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) [2019-11-19 23:55:05,505 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && 2 <= t1_st) && __retres1 == 0) && tmp___0 == 0) || ((((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) && tmp___0 == 0)) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) && local <= token) [2019-11-19 23:55:05,505 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) || ((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) [2019-11-19 23:55:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,506 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,507 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,507 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,507 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) [2019-11-19 23:55:05,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c9f0180b-af59-400c-bb5d-36448b48b39e/bin/uautomizer/witness.graphml [2019-11-19 23:55:05,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:55:05,558 INFO L168 Benchmark]: Toolchain (without parser) took 13013.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -261.0 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,558 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:55:05,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,559 INFO L168 Benchmark]: Boogie Preprocessor took 68.09 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-11-19 23:55:05,559 INFO L168 Benchmark]: RCFGBuilder took 564.41 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,560 INFO L168 Benchmark]: TraceAbstraction took 11795.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 276.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.1 MB). Peak memory consumption was 542.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,560 INFO L168 Benchmark]: Witness Printer took 108.39 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:55:05,562 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.09 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 564.41 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: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11795.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 276.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.1 MB). Peak memory consumption was 542.0 MB. Max. memory is 11.5 GB. * Witness Printer took 108.39 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: 15.7 MB). Peak memory consumption was 15.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: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) || (((((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && m_pc == 0) && token <= local) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && local <= token) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((2 <= T1_E && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || (((((1 == t1_pc && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) || ((((((((((((1 == t1_pc && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((2 <= E_M && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((!(1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_st == 0) && m_pc == 0) && token <= local) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && local <= token) || ((((((((2 <= E_M && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 2 <= t1_st) && __retres1 == 0) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token)) || ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && 2 <= T1_E) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && 2 <= m_st) && t1_i == 1) && 2 <= E_1)) || ((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && local <= token) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) || ((((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && token <= local) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && 2 <= M_E) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 437]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && 2 <= T1_E) && m_st == 0) && local < token) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((2 <= E_M && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && tmp___0 == 0)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && token <= local) && t1_i == 1) && __retres1 == 0) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 2 <= E_1) && __retres1 == 0)) || ((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((1 == t1_pc && token <= local + 1) && (((2 <= E_M && 2 <= T1_E) && m_st == 0) && t1_i == 1) && 2 <= E_1) && local < token) && __retres1 == 0) && 0 == \result) && tmp___0 == 0) || (((__retres1 == 0 && 0 == \result) && ((((2 <= E_M && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && tmp___0 == 0)) || ((((((((0 == \result && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && m_st == 0) && m_pc == 0) && 0 == tmp) && t1_i == 1) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 2 <= E_1)) || (((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 2 <= E_1) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 1 == t1_pc) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((0 == \result && !(1 == t1_pc)) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || ((((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && m_pc == 0) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1)) || (((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && token <= local) && 2 <= t1_st) && __retres1 == 0) && local <= token) || (((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0)) || (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && __retres1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == \result && 1 == t1_pc) && (2 <= E_M && 2 <= T1_E) && t1_i == 1) && 0 == tmp) && 2 <= t1_st) && __retres1 == 0) && tmp___0 == 0) || ((((((((((0 == \result && 2 <= E_M) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 0 == t1_st) && __retres1 == 0) && tmp___0 == 0)) || (((((((((0 == \result && 2 <= E_M) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && token <= local) && t1_i == 1) && 0 == t1_st) && __retres1 == 0) && local <= token) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((0 == \result && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && m_pc == 0) && t1_i == 1) && 2 <= E_1) && __retres1 == 0) || ((((((((1 == t1_pc && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && tmp___0 == 0)) || (((((((((1 == t1_pc && token <= local + 1) && 2 <= T1_E) && local < token) && m_st == 0) && __retres1 == 0) && t1_i == 1) && 0 == \result) && 2 <= E_1) && tmp___0 == 0) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && tmp___0 == 0) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 2 <= M_E) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= M_E) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == \result && 1 == t1_pc) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token) || ((((((((((((0 == \result && 0 == tmp) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((2 <= E_M && 0 == \result) && !(1 == t1_pc)) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || ((((((((((((((0 == \result && !(1 == t1_pc)) && m_st == 0) && 0 == tmp) && m_pc == 0) && t1_i == 1) && 0 == t1_st) && 2 <= E_M) && 2 <= T1_E) && token <= local) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0) && local <= token)) || (((((((((((((0 == \result && 1 == t1_pc) && token <= local + 1) && m_st == 0) && local < token) && 0 == tmp) && t1_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= T1_E) && __retres1 == 0) && 0 == \result) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 0 == t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((((2 <= E_M && 0 == \result) && 1 == t1_pc) && 2 <= T1_E) && 0 == tmp) && 2 <= m_st) && t1_i == 1) && __retres1 == 0) && 0 == \result) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0)) || (((((((((2 <= E_M && 0 == \result) && 2 <= T1_E) && 0 == tmp) && m_pc == 0) && 2 <= m_st) && t1_i == 1) && 2 <= t1_st) && 2 <= E_1) && __retres1 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, HoareTripleCheckerStatistics: 3044 SDtfs, 2703 SDslu, 1946 SDs, 0 SdLazy, 243 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.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 DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 394 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 650 NumberOfFragments, 10241 HoareAnnotationTreeSize, 52 FomulaSimplifications, 19155 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 52 FomulaSimplificationsInter, 628 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...