./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 460c5a2466ddacef0b654abb4130c31f8265660c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:13:06,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:13:06,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:13:06,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:13:06,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:13:06,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:13:06,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:13:06,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:13:06,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:13:06,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:13:06,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:13:06,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:13:06,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:13:06,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:13:06,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:13:06,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:13:06,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:13:06,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:13:06,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:13:06,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:13:06,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:13:06,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:13:06,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:13:06,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:13:06,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:13:06,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:13:06,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:13:06,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:13:06,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:13:06,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:13:06,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:13:06,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:13:06,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:13:06,649 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:13:06,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:13:06,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:13:06,651 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:13:06,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:13:06,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:13:06,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:13:06,659 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:13:06,659 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:13:06,659 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:13:06,659 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:13:06,659 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:13:06,659 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:13:06,660 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:13:06,660 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:13:06,660 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:13:06,660 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:13:06,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:13:06,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:13:06,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:13:06,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:13:06,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:13:06,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:13:06,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:13:06,664 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan 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 -> Taipan 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 -> 460c5a2466ddacef0b654abb4130c31f8265660c [2018-11-18 16:13:06,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:13:06,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:13:06,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:13:06,700 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:13:06,700 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:13:06,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 16:13:06,745 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/data/4f73f26e0/b444936aac974a38a7065c1aa796ac41/FLAG7a8029804 [2018-11-18 16:13:07,166 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:13:07,166 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/sv-benchmarks/c/systemc/token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 16:13:07,173 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/data/4f73f26e0/b444936aac974a38a7065c1aa796ac41/FLAG7a8029804 [2018-11-18 16:13:07,184 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/data/4f73f26e0/b444936aac974a38a7065c1aa796ac41 [2018-11-18 16:13:07,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:13:07,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:13:07,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:13:07,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:13:07,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:13:07,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07, skipping insertion in model container [2018-11-18 16:13:07,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:13:07,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:13:07,371 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:13:07,376 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:13:07,409 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:13:07,422 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:13:07,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07 WrapperNode [2018-11-18 16:13:07,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:13:07,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:13:07,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:13:07,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:13:07,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:13:07,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:13:07,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:13:07,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:13:07,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... [2018-11-18 16:13:07,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:13:07,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:13:07,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:13:07,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:13:07,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/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 [2018-11-18 16:13:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 16:13:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 16:13:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-11-18 16:13:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-11-18 16:13:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-18 16:13:07,539 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-18 16:13:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 16:13:07,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 16:13:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 16:13:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 16:13:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 16:13:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 16:13:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 16:13:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 16:13:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 16:13:07,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 16:13:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 16:13:07,542 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 16:13:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 16:13:07,542 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 16:13:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 16:13:07,542 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 16:13:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 16:13:07,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 16:13:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:13:07,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:13:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 16:13:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 16:13:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-11-18 16:13:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-11-18 16:13:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 16:13:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 16:13:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 16:13:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 16:13:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:13:07,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:13:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 16:13:07,544 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 16:13:07,937 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:13:07,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:07 BoogieIcfgContainer [2018-11-18 16:13:07,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:13:07,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:13:07,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:13:07,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:13:07,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:13:07" (1/3) ... [2018-11-18 16:13:07,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2e8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:13:07, skipping insertion in model container [2018-11-18 16:13:07,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:07" (2/3) ... [2018-11-18 16:13:07,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2e8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:13:07, skipping insertion in model container [2018-11-18 16:13:07,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:07" (3/3) ... [2018-11-18 16:13:07,943 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_true-unreach-call_false-termination.cil.c [2018-11-18 16:13:07,949 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:13:07,955 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:13:07,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:13:07,987 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:13:07,987 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:13:07,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:13:07,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:13:07,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:13:07,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:13:07,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:13:07,988 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:13:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-11-18 16:13:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:08,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:08,010 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:08,012 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:08,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1597294722, now seen corresponding path program 1 times [2018-11-18 16:13:08,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:08,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:08,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:08,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:13:08,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:08,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:13:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:13:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:13:08,231 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-11-18 16:13:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:08,421 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2018-11-18 16:13:08,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:13:08,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-18 16:13:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:08,432 INFO L225 Difference]: With dead ends: 403 [2018-11-18 16:13:08,432 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 16:13:08,436 INFO L604 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 [2018-11-18 16:13:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 16:13:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-18 16:13:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2018-11-18 16:13:08,480 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 107 [2018-11-18 16:13:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:08,482 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2018-11-18 16:13:08,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:13:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2018-11-18 16:13:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:08,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:08,485 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:08,485 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:08,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 343287292, now seen corresponding path program 1 times [2018-11-18 16:13:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:08,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:08,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:08,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:08,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:08,610 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. Second operand 5 states. [2018-11-18 16:13:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:08,946 INFO L93 Difference]: Finished difference Result 416 states and 586 transitions. [2018-11-18 16:13:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:08,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:08,949 INFO L225 Difference]: With dead ends: 416 [2018-11-18 16:13:08,949 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 16:13:08,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 16:13:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 201. [2018-11-18 16:13:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 273 transitions. [2018-11-18 16:13:08,970 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 273 transitions. Word has length 107 [2018-11-18 16:13:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:08,970 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 273 transitions. [2018-11-18 16:13:08,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 273 transitions. [2018-11-18 16:13:08,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:08,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:08,972 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:08,973 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:08,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1668143486, now seen corresponding path program 1 times [2018-11-18 16:13:08,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:08,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:09,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:09,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:09,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:09,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:09,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:09,065 INFO L87 Difference]: Start difference. First operand 201 states and 273 transitions. Second operand 5 states. [2018-11-18 16:13:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:09,342 INFO L93 Difference]: Finished difference Result 414 states and 580 transitions. [2018-11-18 16:13:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:09,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:09,343 INFO L225 Difference]: With dead ends: 414 [2018-11-18 16:13:09,344 INFO L226 Difference]: Without dead ends: 234 [2018-11-18 16:13:09,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-18 16:13:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 201. [2018-11-18 16:13:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 272 transitions. [2018-11-18 16:13:09,359 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 272 transitions. Word has length 107 [2018-11-18 16:13:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:09,359 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 272 transitions. [2018-11-18 16:13:09,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 272 transitions. [2018-11-18 16:13:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:09,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:09,361 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:09,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:09,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1060065860, now seen corresponding path program 1 times [2018-11-18 16:13:09,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:09,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:09,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:09,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:09,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:09,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:09,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:09,423 INFO L87 Difference]: Start difference. First operand 201 states and 272 transitions. Second operand 5 states. [2018-11-18 16:13:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:09,751 INFO L93 Difference]: Finished difference Result 412 states and 574 transitions. [2018-11-18 16:13:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:09,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:09,753 INFO L225 Difference]: With dead ends: 412 [2018-11-18 16:13:09,753 INFO L226 Difference]: Without dead ends: 232 [2018-11-18 16:13:09,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-18 16:13:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2018-11-18 16:13:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2018-11-18 16:13:09,771 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 107 [2018-11-18 16:13:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:09,771 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2018-11-18 16:13:09,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2018-11-18 16:13:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:09,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:09,774 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:09,774 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:09,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2117903938, now seen corresponding path program 1 times [2018-11-18 16:13:09,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:09,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:09,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:09,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:09,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:09,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:09,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:09,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:09,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:09,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:09,853 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand 5 states. [2018-11-18 16:13:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:10,095 INFO L93 Difference]: Finished difference Result 434 states and 608 transitions. [2018-11-18 16:13:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:10,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:10,098 INFO L225 Difference]: With dead ends: 434 [2018-11-18 16:13:10,099 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 16:13:10,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 16:13:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2018-11-18 16:13:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 270 transitions. [2018-11-18 16:13:10,114 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 270 transitions. Word has length 107 [2018-11-18 16:13:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:10,114 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 270 transitions. [2018-11-18 16:13:10,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 270 transitions. [2018-11-18 16:13:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:10,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:10,115 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:10,115 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:10,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1034560892, now seen corresponding path program 1 times [2018-11-18 16:13:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:10,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:10,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:10,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:10,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:10,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:10,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:10,178 INFO L87 Difference]: Start difference. First operand 201 states and 270 transitions. Second operand 5 states. [2018-11-18 16:13:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:10,416 INFO L93 Difference]: Finished difference Result 427 states and 596 transitions. [2018-11-18 16:13:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:10,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:10,418 INFO L225 Difference]: With dead ends: 427 [2018-11-18 16:13:10,418 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 16:13:10,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 16:13:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2018-11-18 16:13:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 269 transitions. [2018-11-18 16:13:10,431 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 269 transitions. Word has length 107 [2018-11-18 16:13:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:10,432 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 269 transitions. [2018-11-18 16:13:10,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 269 transitions. [2018-11-18 16:13:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:10,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:10,433 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:10,433 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:10,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1274800638, now seen corresponding path program 1 times [2018-11-18 16:13:10,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:10,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:10,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:10,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:10,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:10,498 INFO L87 Difference]: Start difference. First operand 201 states and 269 transitions. Second operand 5 states. [2018-11-18 16:13:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:10,722 INFO L93 Difference]: Finished difference Result 430 states and 596 transitions. [2018-11-18 16:13:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:10,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:10,724 INFO L225 Difference]: With dead ends: 430 [2018-11-18 16:13:10,724 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 16:13:10,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 16:13:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 201. [2018-11-18 16:13:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 268 transitions. [2018-11-18 16:13:10,743 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 268 transitions. Word has length 107 [2018-11-18 16:13:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:10,743 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 268 transitions. [2018-11-18 16:13:10,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 268 transitions. [2018-11-18 16:13:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:10,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:10,744 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:10,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:10,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2113834300, now seen corresponding path program 1 times [2018-11-18 16:13:10,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:10,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:10,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:10,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:10,817 INFO L87 Difference]: Start difference. First operand 201 states and 268 transitions. Second operand 5 states. [2018-11-18 16:13:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:11,071 INFO L93 Difference]: Finished difference Result 428 states and 590 transitions. [2018-11-18 16:13:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:11,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-18 16:13:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:11,073 INFO L225 Difference]: With dead ends: 428 [2018-11-18 16:13:11,073 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 16:13:11,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 16:13:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 201. [2018-11-18 16:13:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:13:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2018-11-18 16:13:11,088 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 107 [2018-11-18 16:13:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:11,088 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2018-11-18 16:13:11,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2018-11-18 16:13:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 16:13:11,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:11,089 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:11,090 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:11,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2140899902, now seen corresponding path program 1 times [2018-11-18 16:13:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:11,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:11,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:11,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:11,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:11,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:11,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:13:11,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:11,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:13:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:13:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:13:11,138 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand 4 states. [2018-11-18 16:13:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:11,274 INFO L93 Difference]: Finished difference Result 551 states and 764 transitions. [2018-11-18 16:13:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:13:11,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-18 16:13:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:11,275 INFO L225 Difference]: With dead ends: 551 [2018-11-18 16:13:11,276 INFO L226 Difference]: Without dead ends: 372 [2018-11-18 16:13:11,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:13:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-18 16:13:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-18 16:13:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 16:13:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 492 transitions. [2018-11-18 16:13:11,299 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 492 transitions. Word has length 107 [2018-11-18 16:13:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:11,299 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 492 transitions. [2018-11-18 16:13:11,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:13:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 492 transitions. [2018-11-18 16:13:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 16:13:11,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:11,301 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:11,302 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:11,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2002304772, now seen corresponding path program 1 times [2018-11-18 16:13:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:11,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 16:13:11,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:11,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:11,354 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-11-18 16:13:11,356 INFO L202 CegarAbsIntRunner]: [90], [95], [109], [112], [115], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [249], [252], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [301], [307], [313], [321], [325], [331], [337], [343], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [473], [486], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:11,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:11,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:11,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:11,530 INFO L272 AbstractInterpreter]: Visited 44 different actions 44 times. Never merged. Never widened. Performed 495 root evaluator evaluations with a maximum evaluation depth of 3. Performed 495 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:11,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:11,535 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:11,669 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 68.41% of their original sizes. [2018-11-18 16:13:11,669 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:11,748 INFO L415 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-11-18 16:13:11,748 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:11,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:11,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-18 16:13:11,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:11,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:13:11,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:13:11,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:13:11,750 INFO L87 Difference]: Start difference. First operand 371 states and 492 transitions. Second operand 11 states. [2018-11-18 16:13:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:13,556 INFO L93 Difference]: Finished difference Result 856 states and 1155 transitions. [2018-11-18 16:13:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:13:13,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 173 [2018-11-18 16:13:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:13,559 INFO L225 Difference]: With dead ends: 856 [2018-11-18 16:13:13,559 INFO L226 Difference]: Without dead ends: 501 [2018-11-18 16:13:13,560 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:13:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-18 16:13:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 487. [2018-11-18 16:13:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-11-18 16:13:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 631 transitions. [2018-11-18 16:13:13,590 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 631 transitions. Word has length 173 [2018-11-18 16:13:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:13,591 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 631 transitions. [2018-11-18 16:13:13,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:13:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 631 transitions. [2018-11-18 16:13:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-18 16:13:13,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:13,593 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:13,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:13,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1048041096, now seen corresponding path program 1 times [2018-11-18 16:13:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:13,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 16:13:13,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:13,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:13,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-18 16:13:13,646 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [460], [464], [467], [473], [486], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:13,649 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:13,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:13,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:13,672 INFO L272 AbstractInterpreter]: Visited 54 different actions 54 times. Never merged. Never widened. Performed 554 root evaluator evaluations with a maximum evaluation depth of 3. Performed 554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:13,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:13,673 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:13,722 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 67.49% of their original sizes. [2018-11-18 16:13:13,722 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:13,840 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-18 16:13:13,840 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:13,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:13,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-18 16:13:13,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:13,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:13:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:13:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:13:13,842 INFO L87 Difference]: Start difference. First operand 487 states and 631 transitions. Second operand 16 states. [2018-11-18 16:13:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:16,014 INFO L93 Difference]: Finished difference Result 963 states and 1255 transitions. [2018-11-18 16:13:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:13:16,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 195 [2018-11-18 16:13:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:16,017 INFO L225 Difference]: With dead ends: 963 [2018-11-18 16:13:16,017 INFO L226 Difference]: Without dead ends: 498 [2018-11-18 16:13:16,018 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:13:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-18 16:13:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 484. [2018-11-18 16:13:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-18 16:13:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 622 transitions. [2018-11-18 16:13:16,068 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 622 transitions. Word has length 195 [2018-11-18 16:13:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:16,068 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 622 transitions. [2018-11-18 16:13:16,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:13:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 622 transitions. [2018-11-18 16:13:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 16:13:16,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:16,071 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:16,071 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:16,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1751463822, now seen corresponding path program 1 times [2018-11-18 16:13:16,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 16:13:16,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:16,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:16,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-18 16:13:16,146 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [486], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:16,149 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:16,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:16,181 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:16,181 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Performed 616 root evaluator evaluations with a maximum evaluation depth of 3. Performed 616 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:16,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,183 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:16,248 INFO L227 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 66.25% of their original sizes. [2018-11-18 16:13:16,248 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:16,555 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-18 16:13:16,556 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:16,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:16,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-18 16:13:16,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:16,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 16:13:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 16:13:16,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:13:16,557 INFO L87 Difference]: Start difference. First operand 484 states and 622 transitions. Second operand 20 states. [2018-11-18 16:13:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:19,752 INFO L93 Difference]: Finished difference Result 960 states and 1239 transitions. [2018-11-18 16:13:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 16:13:19,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 196 [2018-11-18 16:13:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:19,754 INFO L225 Difference]: With dead ends: 960 [2018-11-18 16:13:19,754 INFO L226 Difference]: Without dead ends: 498 [2018-11-18 16:13:19,755 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 16:13:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-18 16:13:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 484. [2018-11-18 16:13:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-18 16:13:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 620 transitions. [2018-11-18 16:13:19,782 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 620 transitions. Word has length 196 [2018-11-18 16:13:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:19,782 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 620 transitions. [2018-11-18 16:13:19,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 16:13:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 620 transitions. [2018-11-18 16:13:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 16:13:19,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:19,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:19,785 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:19,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -352510220, now seen corresponding path program 1 times [2018-11-18 16:13:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:19,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:19,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 16:13:19,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:19,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:19,824 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-18 16:13:19,824 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [486], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:19,826 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:19,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:19,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:19,850 INFO L272 AbstractInterpreter]: Visited 75 different actions 75 times. Never merged. Never widened. Performed 675 root evaluator evaluations with a maximum evaluation depth of 3. Performed 675 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:19,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:19,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:19,897 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 64.83% of their original sizes. [2018-11-18 16:13:19,897 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:20,097 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-18 16:13:20,097 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:20,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:20,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-18 16:13:20,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 16:13:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 16:13:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:13:20,098 INFO L87 Difference]: Start difference. First operand 484 states and 620 transitions. Second operand 24 states. [2018-11-18 16:13:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:24,217 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2018-11-18 16:13:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 16:13:24,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 196 [2018-11-18 16:13:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:24,218 INFO L225 Difference]: With dead ends: 960 [2018-11-18 16:13:24,219 INFO L226 Difference]: Without dead ends: 498 [2018-11-18 16:13:24,220 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 16:13:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-18 16:13:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 484. [2018-11-18 16:13:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-18 16:13:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 618 transitions. [2018-11-18 16:13:24,243 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 618 transitions. Word has length 196 [2018-11-18 16:13:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:24,244 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 618 transitions. [2018-11-18 16:13:24,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 16:13:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 618 transitions. [2018-11-18 16:13:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 16:13:24,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:24,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:24,246 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:24,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash 562687005, now seen corresponding path program 1 times [2018-11-18 16:13:24,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:24,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 16:13:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:13:24,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:24,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:13:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:13:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:24,291 INFO L87 Difference]: Start difference. First operand 484 states and 618 transitions. Second operand 6 states. [2018-11-18 16:13:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:24,326 INFO L93 Difference]: Finished difference Result 848 states and 1133 transitions. [2018-11-18 16:13:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:13:24,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-11-18 16:13:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:24,329 INFO L225 Difference]: With dead ends: 848 [2018-11-18 16:13:24,329 INFO L226 Difference]: Without dead ends: 500 [2018-11-18 16:13:24,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:13:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-18 16:13:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 489. [2018-11-18 16:13:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-11-18 16:13:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 622 transitions. [2018-11-18 16:13:24,355 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 622 transitions. Word has length 173 [2018-11-18 16:13:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:24,355 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 622 transitions. [2018-11-18 16:13:24,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:13:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 622 transitions. [2018-11-18 16:13:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 16:13:24,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:24,356 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:24,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:24,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:24,357 INFO L82 PathProgramCache]: Analyzing trace with hash -741493776, now seen corresponding path program 1 times [2018-11-18 16:13:24,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:24,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 16:13:24,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:24,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:13:24,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:24,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:13:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:13:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:13:24,399 INFO L87 Difference]: Start difference. First operand 489 states and 622 transitions. Second operand 4 states. [2018-11-18 16:13:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:24,534 INFO L93 Difference]: Finished difference Result 1183 states and 1600 transitions. [2018-11-18 16:13:24,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:13:24,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-11-18 16:13:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:24,537 INFO L225 Difference]: With dead ends: 1183 [2018-11-18 16:13:24,537 INFO L226 Difference]: Without dead ends: 830 [2018-11-18 16:13:24,538 INFO L604 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 [2018-11-18 16:13:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-11-18 16:13:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 821. [2018-11-18 16:13:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-18 16:13:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1061 transitions. [2018-11-18 16:13:24,580 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1061 transitions. Word has length 196 [2018-11-18 16:13:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:24,581 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1061 transitions. [2018-11-18 16:13:24,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:13:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1061 transitions. [2018-11-18 16:13:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 16:13:24,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:24,582 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:24,582 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:24,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash 603361755, now seen corresponding path program 1 times [2018-11-18 16:13:24,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 16:13:24,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:24,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:13:24,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:24,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:13:24,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:13:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:24,627 INFO L87 Difference]: Start difference. First operand 821 states and 1061 transitions. Second operand 6 states. [2018-11-18 16:13:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:24,678 INFO L93 Difference]: Finished difference Result 1532 states and 2058 transitions. [2018-11-18 16:13:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:13:24,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2018-11-18 16:13:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:24,681 INFO L225 Difference]: With dead ends: 1532 [2018-11-18 16:13:24,682 INFO L226 Difference]: Without dead ends: 847 [2018-11-18 16:13:24,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:13:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-11-18 16:13:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 831. [2018-11-18 16:13:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-11-18 16:13:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1069 transitions. [2018-11-18 16:13:24,724 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1069 transitions. Word has length 173 [2018-11-18 16:13:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:24,724 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1069 transitions. [2018-11-18 16:13:24,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:13:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1069 transitions. [2018-11-18 16:13:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 16:13:24,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:24,726 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:24,726 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:24,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:24,726 INFO L82 PathProgramCache]: Analyzing trace with hash 250273373, now seen corresponding path program 1 times [2018-11-18 16:13:24,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:24,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 16:13:24,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:24,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:24,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-11-18 16:13:24,766 INFO L202 CegarAbsIntRunner]: [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [473], [486], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:24,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:24,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:24,806 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:24,807 INFO L272 AbstractInterpreter]: Visited 119 different actions 160 times. Never merged. Never widened. Performed 1240 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:24,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:24,816 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:24,920 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 78.19% of their original sizes. [2018-11-18 16:13:24,920 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:25,627 INFO L415 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-11-18 16:13:25,627 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:25,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:25,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [4] total 66 [2018-11-18 16:13:25,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:25,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-18 16:13:25,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-18 16:13:25,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3575, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 16:13:25,629 INFO L87 Difference]: Start difference. First operand 831 states and 1069 transitions. Second operand 64 states. [2018-11-18 16:13:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:37,244 INFO L93 Difference]: Finished difference Result 2878 states and 3896 transitions. [2018-11-18 16:13:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-11-18 16:13:37,244 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 173 [2018-11-18 16:13:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:37,251 INFO L225 Difference]: With dead ends: 2878 [2018-11-18 16:13:37,251 INFO L226 Difference]: Without dead ends: 2070 [2018-11-18 16:13:37,258 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10906 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2706, Invalid=28094, Unknown=0, NotChecked=0, Total=30800 [2018-11-18 16:13:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2018-11-18 16:13:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2001. [2018-11-18 16:13:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-11-18 16:13:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2597 transitions. [2018-11-18 16:13:37,424 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2597 transitions. Word has length 173 [2018-11-18 16:13:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:37,424 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 2597 transitions. [2018-11-18 16:13:37,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-18 16:13:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2597 transitions. [2018-11-18 16:13:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 16:13:37,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:37,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:37,427 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:37,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash -158735383, now seen corresponding path program 1 times [2018-11-18 16:13:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:37,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:37,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:37,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 16:13:37,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:37,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:37,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:37,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:37,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:37,504 INFO L87 Difference]: Start difference. First operand 2001 states and 2597 transitions. Second operand 5 states. [2018-11-18 16:13:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:38,087 INFO L93 Difference]: Finished difference Result 4904 states and 6689 transitions. [2018-11-18 16:13:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:13:38,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-11-18 16:13:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:38,106 INFO L225 Difference]: With dead ends: 4904 [2018-11-18 16:13:38,106 INFO L226 Difference]: Without dead ends: 3191 [2018-11-18 16:13:38,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:13:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2018-11-18 16:13:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3093. [2018-11-18 16:13:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3093 states. [2018-11-18 16:13:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 4069 transitions. [2018-11-18 16:13:38,263 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 4069 transitions. Word has length 181 [2018-11-18 16:13:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:38,263 INFO L480 AbstractCegarLoop]: Abstraction has 3093 states and 4069 transitions. [2018-11-18 16:13:38,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 4069 transitions. [2018-11-18 16:13:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-18 16:13:38,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:38,268 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:38,268 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:38,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1005205339, now seen corresponding path program 1 times [2018-11-18 16:13:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:38,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:13:38,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:38,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:38,336 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-11-18 16:13:38,336 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [464], [467], [486], [490], [493], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:38,337 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:38,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:38,375 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:38,375 INFO L272 AbstractInterpreter]: Visited 132 different actions 177 times. Never merged. Never widened. Performed 1310 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:13:38,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:38,384 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:38,471 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 74.01% of their original sizes. [2018-11-18 16:13:38,471 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:39,256 INFO L415 sIntCurrentIteration]: We unified 234 AI predicates to 234 [2018-11-18 16:13:39,256 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:39,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:39,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2018-11-18 16:13:39,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:39,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-18 16:13:39,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-18 16:13:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3499, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 16:13:39,258 INFO L87 Difference]: Start difference. First operand 3093 states and 4069 transitions. Second operand 63 states. [2018-11-18 16:13:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:52,460 INFO L93 Difference]: Finished difference Result 5483 states and 7296 transitions. [2018-11-18 16:13:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-11-18 16:13:52,460 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 235 [2018-11-18 16:13:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:52,467 INFO L225 Difference]: With dead ends: 5483 [2018-11-18 16:13:52,467 INFO L226 Difference]: Without dead ends: 3487 [2018-11-18 16:13:52,473 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 318 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7191 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1682, Invalid=19780, Unknown=0, NotChecked=0, Total=21462 [2018-11-18 16:13:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2018-11-18 16:13:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3390. [2018-11-18 16:13:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-11-18 16:13:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4439 transitions. [2018-11-18 16:13:52,632 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4439 transitions. Word has length 235 [2018-11-18 16:13:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:52,632 INFO L480 AbstractCegarLoop]: Abstraction has 3390 states and 4439 transitions. [2018-11-18 16:13:52,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-18 16:13:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4439 transitions. [2018-11-18 16:13:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-18 16:13:52,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:52,636 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:52,636 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:52,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash 391479021, now seen corresponding path program 1 times [2018-11-18 16:13:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:52,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:52,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:13:52,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:52,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:52,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-11-18 16:13:52,694 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [464], [467], [477], [483], [490], [493], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:13:52,695 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:52,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:52,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:52,731 INFO L272 AbstractInterpreter]: Visited 137 different actions 182 times. Never merged. Never widened. Performed 1376 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1376 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 16:13:52,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:52,736 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:52,818 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 74.34% of their original sizes. [2018-11-18 16:13:52,818 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:53,647 INFO L415 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2018-11-18 16:13:53,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2018-11-18 16:13:53,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:53,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-18 16:13:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-18 16:13:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 16:13:53,649 INFO L87 Difference]: Start difference. First operand 3390 states and 4439 transitions. Second operand 65 states. [2018-11-18 16:14:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:06,818 INFO L93 Difference]: Finished difference Result 3917 states and 5151 transitions. [2018-11-18 16:14:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-18 16:14:06,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2018-11-18 16:14:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:06,827 INFO L225 Difference]: With dead ends: 3917 [2018-11-18 16:14:06,827 INFO L226 Difference]: Without dead ends: 3491 [2018-11-18 16:14:06,830 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 319 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7343 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1689, Invalid=20363, Unknown=0, NotChecked=0, Total=22052 [2018-11-18 16:14:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2018-11-18 16:14:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3400. [2018-11-18 16:14:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-18 16:14:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4455 transitions. [2018-11-18 16:14:07,107 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4455 transitions. Word has length 236 [2018-11-18 16:14:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:07,107 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4455 transitions. [2018-11-18 16:14:07,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-18 16:14:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4455 transitions. [2018-11-18 16:14:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-18 16:14:07,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:07,112 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:07,112 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:07,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1517550092, now seen corresponding path program 1 times [2018-11-18 16:14:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:07,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 16:14:07,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:07,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:07,192 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-11-18 16:14:07,193 INFO L202 CegarAbsIntRunner]: [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [464], [470], [477], [480], [490], [493], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:07,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:07,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:07,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:14:07,249 INFO L272 AbstractInterpreter]: Visited 135 different actions 178 times. Never merged. Never widened. Performed 1372 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1372 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 16:14:07,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:07,251 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:14:07,363 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 74.66% of their original sizes. [2018-11-18 16:14:07,363 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:14:08,153 INFO L415 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2018-11-18 16:14:08,153 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:14:08,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:14:08,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2018-11-18 16:14:08,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:08,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-18 16:14:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-18 16:14:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=3745, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 16:14:08,155 INFO L87 Difference]: Start difference. First operand 3400 states and 4455 transitions. Second operand 65 states. [2018-11-18 16:14:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:17,233 INFO L93 Difference]: Finished difference Result 4653 states and 6210 transitions. [2018-11-18 16:14:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 16:14:17,233 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2018-11-18 16:14:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:17,244 INFO L225 Difference]: With dead ends: 4653 [2018-11-18 16:14:17,244 INFO L226 Difference]: Without dead ends: 3840 [2018-11-18 16:14:17,248 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 305 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5835 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1548, Invalid=16542, Unknown=0, NotChecked=0, Total=18090 [2018-11-18 16:14:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2018-11-18 16:14:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3759. [2018-11-18 16:14:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2018-11-18 16:14:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 4937 transitions. [2018-11-18 16:14:17,479 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 4937 transitions. Word has length 236 [2018-11-18 16:14:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:17,479 INFO L480 AbstractCegarLoop]: Abstraction has 3759 states and 4937 transitions. [2018-11-18 16:14:17,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-18 16:14:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 4937 transitions. [2018-11-18 16:14:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-18 16:14:17,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:17,485 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:17,486 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:17,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 830257043, now seen corresponding path program 1 times [2018-11-18 16:14:17,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:17,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:17,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:14:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:17,567 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-18 16:14:17,567 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [464], [467], [477], [480], [490], [493], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:17,569 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:17,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:17,617 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:14:17,617 INFO L272 AbstractInterpreter]: Visited 144 different actions 189 times. Never merged. Never widened. Performed 1428 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1428 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 16:14:17,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:17,624 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:14:17,711 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 74.7% of their original sizes. [2018-11-18 16:14:17,711 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:14:18,543 INFO L415 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2018-11-18 16:14:18,543 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:14:18,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:14:18,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [5] total 70 [2018-11-18 16:14:18,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:18,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-18 16:14:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-18 16:14:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4002, Unknown=0, NotChecked=0, Total=4422 [2018-11-18 16:14:18,544 INFO L87 Difference]: Start difference. First operand 3759 states and 4937 transitions. Second operand 67 states. [2018-11-18 16:14:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:37,211 INFO L93 Difference]: Finished difference Result 4640 states and 6170 transitions. [2018-11-18 16:14:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-11-18 16:14:37,211 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 243 [2018-11-18 16:14:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:37,219 INFO L225 Difference]: With dead ends: 4640 [2018-11-18 16:14:37,220 INFO L226 Difference]: Without dead ends: 4214 [2018-11-18 16:14:37,223 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 326 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7586 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1695, Invalid=20955, Unknown=0, NotChecked=0, Total=22650 [2018-11-18 16:14:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2018-11-18 16:14:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4098. [2018-11-18 16:14:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2018-11-18 16:14:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5378 transitions. [2018-11-18 16:14:37,468 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5378 transitions. Word has length 243 [2018-11-18 16:14:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:37,469 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 5378 transitions. [2018-11-18 16:14:37,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-18 16:14:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5378 transitions. [2018-11-18 16:14:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 16:14:37,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:37,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:37,474 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:37,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash -37249503, now seen corresponding path program 1 times [2018-11-18 16:14:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:37,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:14:37,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:37,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:37,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-11-18 16:14:37,635 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [486], [490], [493], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:37,636 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:37,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:37,712 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:14:37,713 INFO L272 AbstractInterpreter]: Visited 134 different actions 190 times. Merged at 4 different actions 4 times. Never widened. Performed 1529 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1529 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 16:14:37,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:37,716 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:14:37,903 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 75.87% of their original sizes. [2018-11-18 16:14:37,903 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:14:39,099 INFO L415 sIntCurrentIteration]: We unified 249 AI predicates to 249 [2018-11-18 16:14:39,099 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:14:39,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:14:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [4] total 77 [2018-11-18 16:14:39,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:39,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-18 16:14:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-18 16:14:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=4918, Unknown=0, NotChecked=0, Total=5550 [2018-11-18 16:14:39,101 INFO L87 Difference]: Start difference. First operand 4098 states and 5378 transitions. Second operand 75 states. [2018-11-18 16:14:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:53,725 INFO L93 Difference]: Finished difference Result 4877 states and 6384 transitions. [2018-11-18 16:14:53,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-11-18 16:14:53,725 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 250 [2018-11-18 16:14:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:53,738 INFO L225 Difference]: With dead ends: 4877 [2018-11-18 16:14:53,738 INFO L226 Difference]: Without dead ends: 4193 [2018-11-18 16:14:53,743 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 352 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10883 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2426, Invalid=29080, Unknown=0, NotChecked=0, Total=31506 [2018-11-18 16:14:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2018-11-18 16:14:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4121. [2018-11-18 16:14:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2018-11-18 16:14:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 5405 transitions. [2018-11-18 16:14:54,118 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 5405 transitions. Word has length 250 [2018-11-18 16:14:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:54,118 INFO L480 AbstractCegarLoop]: Abstraction has 4121 states and 5405 transitions. [2018-11-18 16:14:54,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-18 16:14:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 5405 transitions. [2018-11-18 16:14:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 16:14:54,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:54,126 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:54,126 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:54,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1223640512, now seen corresponding path program 1 times [2018-11-18 16:14:54,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:54,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:54,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:54,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:14:54,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:54,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:54,218 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-18 16:14:54,218 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [483], [486], [490], [493], [496], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:54,219 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:54,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:54,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:14:54,427 INFO L272 AbstractInterpreter]: Visited 146 different actions 468 times. Merged at 36 different actions 82 times. Never widened. Performed 6019 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6019 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 16:14:54,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:54,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:14:54,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:54,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:14:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:54,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:14:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:54,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:14:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 16:14:54,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:14:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 16:14:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:14:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-11-18 16:14:54,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:54,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:14:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:14:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:14:54,915 INFO L87 Difference]: Start difference. First operand 4121 states and 5405 transitions. Second operand 3 states. [2018-11-18 16:14:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:55,183 INFO L93 Difference]: Finished difference Result 7731 states and 10453 transitions. [2018-11-18 16:14:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:14:55,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-11-18 16:14:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:55,197 INFO L225 Difference]: With dead ends: 7731 [2018-11-18 16:14:55,197 INFO L226 Difference]: Without dead ends: 5406 [2018-11-18 16:14:55,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:14:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2018-11-18 16:14:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 5387. [2018-11-18 16:14:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5387 states. [2018-11-18 16:14:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7171 transitions. [2018-11-18 16:14:55,496 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7171 transitions. Word has length 252 [2018-11-18 16:14:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:55,496 INFO L480 AbstractCegarLoop]: Abstraction has 5387 states and 7171 transitions. [2018-11-18 16:14:55,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:14:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7171 transitions. [2018-11-18 16:14:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-18 16:14:55,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:55,502 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:55,502 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:55,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1035035879, now seen corresponding path program 1 times [2018-11-18 16:14:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:55,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 16:14:55,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:55,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:55,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-18 16:14:55,569 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [470], [477], [483], [486], [490], [493], [496], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:55,571 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:55,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:55,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:14:55,785 INFO L272 AbstractInterpreter]: Visited 146 different actions 606 times. Merged at 37 different actions 114 times. Never widened. Performed 6684 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6684 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:14:55,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:55,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:14:55,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:55,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:14:55,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:55,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:14:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:14:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 16:14:55,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:14:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 16:14:56,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:14:56,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-11-18 16:14:56,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:56,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:14:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:14:56,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:14:56,047 INFO L87 Difference]: Start difference. First operand 5387 states and 7171 transitions. Second operand 3 states. [2018-11-18 16:14:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:56,407 INFO L93 Difference]: Finished difference Result 11169 states and 15801 transitions. [2018-11-18 16:14:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:14:56,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-11-18 16:14:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:56,430 INFO L225 Difference]: With dead ends: 11169 [2018-11-18 16:14:56,430 INFO L226 Difference]: Without dead ends: 8183 [2018-11-18 16:14:56,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:14:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8183 states. [2018-11-18 16:14:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8183 to 8082. [2018-11-18 16:14:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8082 states. [2018-11-18 16:14:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8082 states to 8082 states and 11298 transitions. [2018-11-18 16:14:56,882 INFO L78 Accepts]: Start accepts. Automaton has 8082 states and 11298 transitions. Word has length 253 [2018-11-18 16:14:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:56,883 INFO L480 AbstractCegarLoop]: Abstraction has 8082 states and 11298 transitions. [2018-11-18 16:14:56,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:14:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8082 states and 11298 transitions. [2018-11-18 16:14:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-18 16:14:56,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:56,891 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:56,891 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:56,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1001293414, now seen corresponding path program 1 times [2018-11-18 16:14:56,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:56,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:56,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:56,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:56,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 16:14:56,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:56,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:56,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-18 16:14:56,971 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [483], [490], [493], [496], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:56,972 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:56,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:57,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:14:57,181 INFO L272 AbstractInterpreter]: Visited 145 different actions 613 times. Merged at 37 different actions 129 times. Never widened. Performed 8756 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:14:57,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:57,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:14:57,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:57,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:14:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:57,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:14:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:57,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:14:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 16:14:57,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:14:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-18 16:14:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:14:57,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-18 16:14:57,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:57,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:14:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:14:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:14:57,530 INFO L87 Difference]: Start difference. First operand 8082 states and 11298 transitions. Second operand 3 states. [2018-11-18 16:14:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:14:58,012 INFO L93 Difference]: Finished difference Result 14329 states and 20713 transitions. [2018-11-18 16:14:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:14:58,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-11-18 16:14:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:14:58,028 INFO L225 Difference]: With dead ends: 14329 [2018-11-18 16:14:58,028 INFO L226 Difference]: Without dead ends: 8910 [2018-11-18 16:14:58,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 501 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:14:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8910 states. [2018-11-18 16:14:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8910 to 8538. [2018-11-18 16:14:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2018-11-18 16:14:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 11618 transitions. [2018-11-18 16:14:58,472 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 11618 transitions. Word has length 253 [2018-11-18 16:14:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:14:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 8538 states and 11618 transitions. [2018-11-18 16:14:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:14:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 11618 transitions. [2018-11-18 16:14:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-18 16:14:58,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:14:58,479 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:14:58,479 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:14:58,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1813709337, now seen corresponding path program 1 times [2018-11-18 16:14:58,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:14:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:14:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:14:58,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:14:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:14:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 16:14:58,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:14:58,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:14:58,559 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-18 16:14:58,559 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [480], [486], [490], [493], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:14:58,560 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:14:58,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:14:58,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:14:58,607 INFO L272 AbstractInterpreter]: Visited 147 different actions 216 times. Merged at 9 different actions 9 times. Never widened. Performed 2063 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2063 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 16:14:58,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:14:58,609 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:14:58,735 INFO L227 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 75.28% of their original sizes. [2018-11-18 16:14:58,735 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:14:59,888 INFO L415 sIntCurrentIteration]: We unified 258 AI predicates to 258 [2018-11-18 16:14:59,888 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:14:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:14:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [10] total 87 [2018-11-18 16:14:59,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:14:59,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-18 16:14:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-18 16:14:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=5546, Unknown=0, NotChecked=0, Total=6162 [2018-11-18 16:14:59,889 INFO L87 Difference]: Start difference. First operand 8538 states and 11618 transitions. Second operand 79 states. [2018-11-18 16:15:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:20,223 INFO L93 Difference]: Finished difference Result 12423 states and 16914 transitions. [2018-11-18 16:15:20,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-11-18 16:15:20,224 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 259 [2018-11-18 16:15:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:20,242 INFO L225 Difference]: With dead ends: 12423 [2018-11-18 16:15:20,243 INFO L226 Difference]: Without dead ends: 8166 [2018-11-18 16:15:20,256 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 368 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12355 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2382, Invalid=33150, Unknown=0, NotChecked=0, Total=35532 [2018-11-18 16:15:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-18 16:15:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 8085. [2018-11-18 16:15:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8085 states. [2018-11-18 16:15:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8085 states to 8085 states and 10917 transitions. [2018-11-18 16:15:20,831 INFO L78 Accepts]: Start accepts. Automaton has 8085 states and 10917 transitions. Word has length 259 [2018-11-18 16:15:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:20,832 INFO L480 AbstractCegarLoop]: Abstraction has 8085 states and 10917 transitions. [2018-11-18 16:15:20,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-18 16:15:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8085 states and 10917 transitions. [2018-11-18 16:15:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 16:15:20,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:20,837 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:20,837 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:20,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1163710004, now seen corresponding path program 1 times [2018-11-18 16:15:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:20,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:20,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:20,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:20,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 16:15:20,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:20,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:20,972 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 16:15:20,972 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [480], [486], [490], [493], [496], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:20,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:20,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:21,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:21,123 INFO L272 AbstractInterpreter]: Visited 154 different actions 403 times. Merged at 24 different actions 44 times. Never widened. Performed 5305 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 9 different actions. Largest state had 54 variables. [2018-11-18 16:15:21,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:21,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:21,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:21,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:21,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:21,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:21,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 16:15:21,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 16:15:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:15:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-18 16:15:21,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:21,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:15:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:15:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:15:21,409 INFO L87 Difference]: Start difference. First operand 8085 states and 10917 transitions. Second operand 3 states. [2018-11-18 16:15:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:21,986 INFO L93 Difference]: Finished difference Result 17235 states and 25578 transitions. [2018-11-18 16:15:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:15:21,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-11-18 16:15:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:22,012 INFO L225 Difference]: With dead ends: 17235 [2018-11-18 16:15:22,013 INFO L226 Difference]: Without dead ends: 11880 [2018-11-18 16:15:22,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:15:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11880 states. [2018-11-18 16:15:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11880 to 11780. [2018-11-18 16:15:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11780 states. [2018-11-18 16:15:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11780 states to 11780 states and 16593 transitions. [2018-11-18 16:15:22,660 INFO L78 Accepts]: Start accepts. Automaton has 11780 states and 16593 transitions. Word has length 260 [2018-11-18 16:15:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:22,660 INFO L480 AbstractCegarLoop]: Abstraction has 11780 states and 16593 transitions. [2018-11-18 16:15:22,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:15:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 11780 states and 16593 transitions. [2018-11-18 16:15:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 16:15:22,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:22,669 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:22,669 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:22,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2117254892, now seen corresponding path program 1 times [2018-11-18 16:15:22,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 16:15:22,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:22,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:22,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 16:15:22,762 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [480], [486], [490], [493], [496], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:22,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:22,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:22,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:22,882 INFO L272 AbstractInterpreter]: Visited 155 different actions 407 times. Merged at 24 different actions 44 times. Never widened. Performed 5310 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 9 different actions. Largest state had 54 variables. [2018-11-18 16:15:22,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:22,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:22,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:23,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 16:15:23,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 16:15:23,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:23,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 4] total 12 [2018-11-18 16:15:23,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:23,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:15:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:15:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:15:23,404 INFO L87 Difference]: Start difference. First operand 11780 states and 16593 transitions. Second operand 3 states. [2018-11-18 16:15:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:23,979 INFO L93 Difference]: Finished difference Result 15621 states and 22160 transitions. [2018-11-18 16:15:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:15:23,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-11-18 16:15:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:24,004 INFO L225 Difference]: With dead ends: 15621 [2018-11-18 16:15:24,004 INFO L226 Difference]: Without dead ends: 11843 [2018-11-18 16:15:24,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 512 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:15:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2018-11-18 16:15:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11780. [2018-11-18 16:15:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11780 states. [2018-11-18 16:15:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11780 states to 11780 states and 16196 transitions. [2018-11-18 16:15:24,688 INFO L78 Accepts]: Start accepts. Automaton has 11780 states and 16196 transitions. Word has length 260 [2018-11-18 16:15:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:24,688 INFO L480 AbstractCegarLoop]: Abstraction has 11780 states and 16196 transitions. [2018-11-18 16:15:24,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:15:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 11780 states and 16196 transitions. [2018-11-18 16:15:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 16:15:24,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:24,695 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:24,696 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:24,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1546830856, now seen corresponding path program 1 times [2018-11-18 16:15:24,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:24,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:24,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-18 16:15:24,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:24,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:24,776 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 16:15:24,777 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [280], [283], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [460], [464], [470], [477], [480], [486], [490], [493], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:24,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:24,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:24,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:15:24,830 INFO L272 AbstractInterpreter]: Visited 146 different actions 211 times. Merged at 13 different actions 13 times. Never widened. Performed 1652 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1652 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 16:15:24,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,831 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:15:24,947 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 74.12% of their original sizes. [2018-11-18 16:15:24,947 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:15:26,125 INFO L415 sIntCurrentIteration]: We unified 259 AI predicates to 259 [2018-11-18 16:15:26,125 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:15:26,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:15:26,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [3] total 79 [2018-11-18 16:15:26,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:26,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-18 16:15:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-18 16:15:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=5520, Unknown=0, NotChecked=0, Total=6006 [2018-11-18 16:15:26,127 INFO L87 Difference]: Start difference. First operand 11780 states and 16196 transitions. Second operand 78 states. [2018-11-18 16:15:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:41,771 INFO L93 Difference]: Finished difference Result 17332 states and 23905 transitions. [2018-11-18 16:15:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-18 16:15:41,771 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 260 [2018-11-18 16:15:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:41,789 INFO L225 Difference]: With dead ends: 17332 [2018-11-18 16:15:41,790 INFO L226 Difference]: Without dead ends: 8903 [2018-11-18 16:15:41,805 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8590 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1846, Invalid=22646, Unknown=0, NotChecked=0, Total=24492 [2018-11-18 16:15:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2018-11-18 16:15:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 8475. [2018-11-18 16:15:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8475 states. [2018-11-18 16:15:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8475 states to 8475 states and 11148 transitions. [2018-11-18 16:15:42,229 INFO L78 Accepts]: Start accepts. Automaton has 8475 states and 11148 transitions. Word has length 260 [2018-11-18 16:15:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:42,230 INFO L480 AbstractCegarLoop]: Abstraction has 8475 states and 11148 transitions. [2018-11-18 16:15:42,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-18 16:15:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8475 states and 11148 transitions. [2018-11-18 16:15:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 16:15:42,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:42,235 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:42,235 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:42,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2107730743, now seen corresponding path program 1 times [2018-11-18 16:15:42,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:42,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:42,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-18 16:15:42,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:42,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:42,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 16:15:42,308 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [470], [477], [480], [486], [490], [493], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:42,310 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:42,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:42,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:42,533 INFO L272 AbstractInterpreter]: Visited 149 different actions 368 times. Merged at 18 different actions 32 times. Never widened. Performed 4718 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4718 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 16:15:42,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:42,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:42,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:42,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:42,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:42,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:42,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 16:15:42,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-18 16:15:42,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2018-11-18 16:15:42,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:15:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:15:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:15:42,830 INFO L87 Difference]: Start difference. First operand 8475 states and 11148 transitions. Second operand 4 states. [2018-11-18 16:15:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:43,576 INFO L93 Difference]: Finished difference Result 17947 states and 26483 transitions. [2018-11-18 16:15:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:15:43,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-11-18 16:15:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:43,601 INFO L225 Difference]: With dead ends: 17947 [2018-11-18 16:15:43,601 INFO L226 Difference]: Without dead ends: 10208 [2018-11-18 16:15:43,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 507 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:15:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10208 states. [2018-11-18 16:15:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10208 to 9458. [2018-11-18 16:15:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9458 states. [2018-11-18 16:15:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9458 states to 9458 states and 12432 transitions. [2018-11-18 16:15:44,143 INFO L78 Accepts]: Start accepts. Automaton has 9458 states and 12432 transitions. Word has length 260 [2018-11-18 16:15:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:44,144 INFO L480 AbstractCegarLoop]: Abstraction has 9458 states and 12432 transitions. [2018-11-18 16:15:44,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:15:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9458 states and 12432 transitions. [2018-11-18 16:15:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 16:15:44,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:44,149 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:44,149 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:44,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1198432791, now seen corresponding path program 1 times [2018-11-18 16:15:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:44,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-18 16:15:44,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:44,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:44,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 16:15:44,229 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [470], [477], [480], [486], [490], [493], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:44,230 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:44,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:44,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:44,352 INFO L272 AbstractInterpreter]: Visited 152 different actions 453 times. Merged at 30 different actions 47 times. Never widened. Performed 5787 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5787 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 54 variables. [2018-11-18 16:15:44,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:44,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:44,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:44,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:44,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:44,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:44,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 16:15:44,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-18 16:15:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 16:15:44,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:44,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:15:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:15:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:15:44,605 INFO L87 Difference]: Start difference. First operand 9458 states and 12432 transitions. Second operand 3 states. [2018-11-18 16:15:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:45,316 INFO L93 Difference]: Finished difference Result 21647 states and 30391 transitions. [2018-11-18 16:15:45,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:15:45,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-11-18 16:15:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:45,347 INFO L225 Difference]: With dead ends: 21647 [2018-11-18 16:15:45,347 INFO L226 Difference]: Without dead ends: 12567 [2018-11-18 16:15:45,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 514 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:15:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12567 states. [2018-11-18 16:15:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12567 to 12507. [2018-11-18 16:15:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12507 states. [2018-11-18 16:15:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12507 states to 12507 states and 16484 transitions. [2018-11-18 16:15:46,008 INFO L78 Accepts]: Start accepts. Automaton has 12507 states and 16484 transitions. Word has length 260 [2018-11-18 16:15:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:46,008 INFO L480 AbstractCegarLoop]: Abstraction has 12507 states and 16484 transitions. [2018-11-18 16:15:46,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:15:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12507 states and 16484 transitions. [2018-11-18 16:15:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-18 16:15:46,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:46,015 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:46,016 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:46,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1312569979, now seen corresponding path program 1 times [2018-11-18 16:15:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:46,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:46,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-18 16:15:46,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:46,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:46,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-18 16:15:46,102 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [280], [283], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [460], [464], [470], [477], [480], [483], [490], [493], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:46,104 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:46,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:46,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:46,268 INFO L272 AbstractInterpreter]: Visited 156 different actions 599 times. Merged at 33 different actions 83 times. Never widened. Performed 6139 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:15:46,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:46,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:46,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:46,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:46,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 16:15:46,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-18 16:15:46,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:46,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-18 16:15:46,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:46,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:15:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:15:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:15:46,532 INFO L87 Difference]: Start difference. First operand 12507 states and 16484 transitions. Second operand 4 states. [2018-11-18 16:15:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:48,046 INFO L93 Difference]: Finished difference Result 27171 states and 39555 transitions. [2018-11-18 16:15:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:15:48,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-11-18 16:15:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:48,092 INFO L225 Difference]: With dead ends: 27171 [2018-11-18 16:15:48,092 INFO L226 Difference]: Without dead ends: 19668 [2018-11-18 16:15:48,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:15:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19668 states. [2018-11-18 16:15:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19668 to 18409. [2018-11-18 16:15:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18409 states. [2018-11-18 16:15:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18409 states to 18409 states and 26506 transitions. [2018-11-18 16:15:49,260 INFO L78 Accepts]: Start accepts. Automaton has 18409 states and 26506 transitions. Word has length 262 [2018-11-18 16:15:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:49,260 INFO L480 AbstractCegarLoop]: Abstraction has 18409 states and 26506 transitions. [2018-11-18 16:15:49,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:15:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 18409 states and 26506 transitions. [2018-11-18 16:15:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-18 16:15:49,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:49,270 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:49,270 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1158776633, now seen corresponding path program 1 times [2018-11-18 16:15:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:49,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-18 16:15:49,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:49,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:49,352 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-18 16:15:49,352 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [470], [477], [480], [486], [490], [493], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:49,353 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:49,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:49,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:15:49,523 INFO L272 AbstractInterpreter]: Visited 154 different actions 481 times. Merged at 34 different actions 54 times. Never widened. Performed 6028 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6028 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:15:49,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:49,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:15:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:49,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:15:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:49,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:15:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:49,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 16:15:49,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:15:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-18 16:15:49,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:49,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-11-18 16:15:49,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:49,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:15:49,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:15:49,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:15:49,825 INFO L87 Difference]: Start difference. First operand 18409 states and 26506 transitions. Second operand 4 states. [2018-11-18 16:15:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:51,383 INFO L93 Difference]: Finished difference Result 39497 states and 66614 transitions. [2018-11-18 16:15:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:15:51,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2018-11-18 16:15:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:15:51,458 INFO L225 Difference]: With dead ends: 39497 [2018-11-18 16:15:51,458 INFO L226 Difference]: Without dead ends: 21968 [2018-11-18 16:15:51,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 511 SyntacticMatches, 12 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:15:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21968 states. [2018-11-18 16:15:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21968 to 19876. [2018-11-18 16:15:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19876 states. [2018-11-18 16:15:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19876 states to 19876 states and 28956 transitions. [2018-11-18 16:15:52,860 INFO L78 Accepts]: Start accepts. Automaton has 19876 states and 28956 transitions. Word has length 262 [2018-11-18 16:15:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:15:52,860 INFO L480 AbstractCegarLoop]: Abstraction has 19876 states and 28956 transitions. [2018-11-18 16:15:52,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:15:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19876 states and 28956 transitions. [2018-11-18 16:15:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-18 16:15:52,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:15:52,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:52,875 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:15:52,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -615472464, now seen corresponding path program 1 times [2018-11-18 16:15:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:15:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:52,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:52,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:15:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-18 16:15:52,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:52,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:15:52,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-18 16:15:52,951 INFO L202 CegarAbsIntRunner]: [32], [43], [49], [51], [59], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [280], [283], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [460], [464], [470], [477], [480], [483], [490], [493], [499], [505], [508], [511], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [578], [579], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:15:52,952 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:15:52,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:15:53,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:15:53,017 INFO L272 AbstractInterpreter]: Visited 141 different actions 223 times. Merged at 16 different actions 21 times. Never widened. Performed 2033 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2033 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 54 variables. [2018-11-18 16:15:53,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:53,019 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:15:53,134 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 73.59% of their original sizes. [2018-11-18 16:15:53,134 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:15:54,170 INFO L415 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2018-11-18 16:15:54,171 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:15:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:15:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [5] total 76 [2018-11-18 16:15:54,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:15:54,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-18 16:15:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-18 16:15:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=4805, Unknown=0, NotChecked=0, Total=5256 [2018-11-18 16:15:54,172 INFO L87 Difference]: Start difference. First operand 19876 states and 28956 transitions. Second operand 73 states. [2018-11-18 16:16:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:15,038 INFO L93 Difference]: Finished difference Result 36655 states and 55191 transitions. [2018-11-18 16:16:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-18 16:16:15,038 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 254 [2018-11-18 16:16:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:15,103 INFO L225 Difference]: With dead ends: 36655 [2018-11-18 16:16:15,103 INFO L226 Difference]: Without dead ends: 27296 [2018-11-18 16:16:15,129 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 327 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7293 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1754, Invalid=19708, Unknown=0, NotChecked=0, Total=21462 [2018-11-18 16:16:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27296 states. [2018-11-18 16:16:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27296 to 25505. [2018-11-18 16:16:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25505 states. [2018-11-18 16:16:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25505 states to 25505 states and 37770 transitions. [2018-11-18 16:16:16,957 INFO L78 Accepts]: Start accepts. Automaton has 25505 states and 37770 transitions. Word has length 254 [2018-11-18 16:16:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:16,958 INFO L480 AbstractCegarLoop]: Abstraction has 25505 states and 37770 transitions. [2018-11-18 16:16:16,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-18 16:16:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25505 states and 37770 transitions. [2018-11-18 16:16:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-18 16:16:16,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:16,976 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:16,976 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1478155929, now seen corresponding path program 1 times [2018-11-18 16:16:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:16,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:16,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-18 16:16:17,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:17,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:17,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-18 16:16:17,051 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [477], [480], [483], [490], [496], [499], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [574], [575], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [606], [607], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:17,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:17,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:17,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:17,275 INFO L272 AbstractInterpreter]: Visited 160 different actions 879 times. Merged at 45 different actions 190 times. Never widened. Performed 8868 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8868 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 26 fixpoints after 9 different actions. Largest state had 54 variables. [2018-11-18 16:16:17,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:17,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:17,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:17,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:17,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:17,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:17,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-18 16:16:17,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-18 16:16:17,523 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:16:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-18 16:16:17,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:17,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:16:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:16:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:16:17,524 INFO L87 Difference]: Start difference. First operand 25505 states and 37770 transitions. Second operand 3 states. [2018-11-18 16:16:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:19,021 INFO L93 Difference]: Finished difference Result 48675 states and 74406 transitions. [2018-11-18 16:16:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:16:19,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2018-11-18 16:16:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:19,245 INFO L225 Difference]: With dead ends: 48675 [2018-11-18 16:16:19,245 INFO L226 Difference]: Without dead ends: 24909 [2018-11-18 16:16:19,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:16:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2018-11-18 16:16:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 24698. [2018-11-18 16:16:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24698 states. [2018-11-18 16:16:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24698 states to 24698 states and 35108 transitions. [2018-11-18 16:16:20,783 INFO L78 Accepts]: Start accepts. Automaton has 24698 states and 35108 transitions. Word has length 262 [2018-11-18 16:16:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:20,783 INFO L480 AbstractCegarLoop]: Abstraction has 24698 states and 35108 transitions. [2018-11-18 16:16:20,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:16:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24698 states and 35108 transitions. [2018-11-18 16:16:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-18 16:16:20,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:20,796 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:20,796 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash -109976156, now seen corresponding path program 1 times [2018-11-18 16:16:20,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:20,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:20,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 16:16:20,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:20,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:20,888 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-18 16:16:20,889 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [90], [95], [109], [112], [115], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [477], [483], [490], [496], [505], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [574], [575], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:20,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:20,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:21,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:21,081 INFO L272 AbstractInterpreter]: Visited 149 different actions 543 times. Merged at 38 different actions 93 times. Never widened. Performed 6220 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 16:16:21,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:21,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:21,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:21,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:21,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:21,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 16:16:21,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-18 16:16:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:16:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [4] total 8 [2018-11-18 16:16:21,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:21,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:16:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:16:21,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:16:21,366 INFO L87 Difference]: Start difference. First operand 24698 states and 35108 transitions. Second operand 4 states. [2018-11-18 16:16:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:23,253 INFO L93 Difference]: Finished difference Result 46795 states and 73638 transitions. [2018-11-18 16:16:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:16:23,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-11-18 16:16:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:23,303 INFO L225 Difference]: With dead ends: 46795 [2018-11-18 16:16:23,303 INFO L226 Difference]: Without dead ends: 23106 [2018-11-18 16:16:23,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 499 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:16:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23106 states. [2018-11-18 16:16:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23106 to 21127. [2018-11-18 16:16:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21127 states. [2018-11-18 16:16:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21127 states to 21127 states and 28927 transitions. [2018-11-18 16:16:24,738 INFO L78 Accepts]: Start accepts. Automaton has 21127 states and 28927 transitions. Word has length 256 [2018-11-18 16:16:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:24,738 INFO L480 AbstractCegarLoop]: Abstraction has 21127 states and 28927 transitions. [2018-11-18 16:16:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:16:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 21127 states and 28927 transitions. [2018-11-18 16:16:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-18 16:16:24,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:24,751 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:24,751 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:24,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -44206946, now seen corresponding path program 1 times [2018-11-18 16:16:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 16:16:24,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:24,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:24,831 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-18 16:16:24,831 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [483], [490], [493], [499], [505], [508], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [574], [575], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:24,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:24,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:24,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:24,982 INFO L272 AbstractInterpreter]: Visited 153 different actions 466 times. Merged at 41 different actions 83 times. Never widened. Performed 5576 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5576 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:16:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:24,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:24,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:24,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:25,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-18 16:16:25,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 16:16:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-18 16:16:25,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:16:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:16:25,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:16:25,249 INFO L87 Difference]: Start difference. First operand 21127 states and 28927 transitions. Second operand 4 states. [2018-11-18 16:16:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:26,507 INFO L93 Difference]: Finished difference Result 32850 states and 46040 transitions. [2018-11-18 16:16:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:16:26,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2018-11-18 16:16:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:26,546 INFO L225 Difference]: With dead ends: 32850 [2018-11-18 16:16:26,546 INFO L226 Difference]: Without dead ends: 16712 [2018-11-18 16:16:26,591 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:16:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16712 states. [2018-11-18 16:16:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16712 to 16446. [2018-11-18 16:16:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16446 states. [2018-11-18 16:16:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16446 states to 16446 states and 21813 transitions. [2018-11-18 16:16:27,729 INFO L78 Accepts]: Start accepts. Automaton has 16446 states and 21813 transitions. Word has length 335 [2018-11-18 16:16:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 16446 states and 21813 transitions. [2018-11-18 16:16:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:16:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16446 states and 21813 transitions. [2018-11-18 16:16:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-18 16:16:27,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:27,736 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:27,736 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:27,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash -212372686, now seen corresponding path program 1 times [2018-11-18 16:16:27,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:27,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:27,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 16:16:27,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:27,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:27,802 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-18 16:16:27,802 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [473], [477], [483], [490], [493], [505], [508], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:27,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:27,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:27,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:27,998 INFO L272 AbstractInterpreter]: Visited 157 different actions 733 times. Merged at 51 different actions 156 times. Never widened. Performed 8414 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8414 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 22 fixpoints after 10 different actions. Largest state had 54 variables. [2018-11-18 16:16:28,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:28,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:28,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:28,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:28,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:28,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 16:16:28,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 16:16:28,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:28,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-11-18 16:16:28,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:28,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:16:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:16:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:16:28,320 INFO L87 Difference]: Start difference. First operand 16446 states and 21813 transitions. Second operand 6 states. [2018-11-18 16:16:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:29,280 INFO L93 Difference]: Finished difference Result 24703 states and 34162 transitions. [2018-11-18 16:16:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:16:29,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2018-11-18 16:16:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:29,314 INFO L225 Difference]: With dead ends: 24703 [2018-11-18 16:16:29,314 INFO L226 Difference]: Without dead ends: 16446 [2018-11-18 16:16:29,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 521 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:16:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16446 states. [2018-11-18 16:16:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16446 to 16434. [2018-11-18 16:16:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16434 states. [2018-11-18 16:16:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16434 states to 16434 states and 21781 transitions. [2018-11-18 16:16:30,352 INFO L78 Accepts]: Start accepts. Automaton has 16434 states and 21781 transitions. Word has length 263 [2018-11-18 16:16:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:30,353 INFO L480 AbstractCegarLoop]: Abstraction has 16434 states and 21781 transitions. [2018-11-18 16:16:30,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:16:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 16434 states and 21781 transitions. [2018-11-18 16:16:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-18 16:16:30,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:30,360 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:30,360 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:30,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:30,360 INFO L82 PathProgramCache]: Analyzing trace with hash 548553387, now seen corresponding path program 1 times [2018-11-18 16:16:30,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:30,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:30,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 16:16:30,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:30,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:30,404 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-18 16:16:30,404 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [470], [477], [483], [490], [493], [505], [508], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:30,405 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:30,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:30,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:30,880 INFO L272 AbstractInterpreter]: Visited 158 different actions 1300 times. Merged at 54 different actions 282 times. Widened at 1 different actions 1 times. Performed 14989 root evaluator evaluations with a maximum evaluation depth of 3. Performed 14989 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 45 fixpoints after 12 different actions. Largest state had 54 variables. [2018-11-18 16:16:30,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:30,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:30,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:30,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:30,895 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:30,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 16:16:31,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 16:16:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-18 16:16:31,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:16:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:16:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:16:31,187 INFO L87 Difference]: Start difference. First operand 16434 states and 21781 transitions. Second operand 6 states. [2018-11-18 16:16:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:32,208 INFO L93 Difference]: Finished difference Result 32036 states and 44771 transitions. [2018-11-18 16:16:32,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:16:32,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-11-18 16:16:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:32,244 INFO L225 Difference]: With dead ends: 32036 [2018-11-18 16:16:32,244 INFO L226 Difference]: Without dead ends: 16441 [2018-11-18 16:16:32,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 527 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:16:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16441 states. [2018-11-18 16:16:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16441 to 16441. [2018-11-18 16:16:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16441 states. [2018-11-18 16:16:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16441 states to 16441 states and 21215 transitions. [2018-11-18 16:16:33,324 INFO L78 Accepts]: Start accepts. Automaton has 16441 states and 21215 transitions. Word has length 264 [2018-11-18 16:16:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:33,324 INFO L480 AbstractCegarLoop]: Abstraction has 16441 states and 21215 transitions. [2018-11-18 16:16:33,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:16:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16441 states and 21215 transitions. [2018-11-18 16:16:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-18 16:16:33,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:33,332 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:33,332 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:33,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 304257327, now seen corresponding path program 1 times [2018-11-18 16:16:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:33,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 16:16:33,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:33,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:33,410 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-18 16:16:33,411 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [467], [470], [477], [483], [490], [493], [505], [508], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [604], [605], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:33,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:33,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:33,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:33,803 INFO L272 AbstractInterpreter]: Visited 157 different actions 1219 times. Merged at 54 different actions 274 times. Widened at 1 different actions 1 times. Performed 14446 root evaluator evaluations with a maximum evaluation depth of 3. Performed 14446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 45 fixpoints after 12 different actions. Largest state had 54 variables. [2018-11-18 16:16:33,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:33,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:33,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:33,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:33,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:33,816 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:33,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 16:16:33,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 16:16:34,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:34,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-18 16:16:34,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:34,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:16:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:16:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:16:34,057 INFO L87 Difference]: Start difference. First operand 16441 states and 21215 transitions. Second operand 6 states. [2018-11-18 16:16:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:35,026 INFO L93 Difference]: Finished difference Result 29091 states and 38564 transitions. [2018-11-18 16:16:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:16:35,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2018-11-18 16:16:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:35,053 INFO L225 Difference]: With dead ends: 29091 [2018-11-18 16:16:35,053 INFO L226 Difference]: Without dead ends: 14014 [2018-11-18 16:16:35,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 527 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:16:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14014 states. [2018-11-18 16:16:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14014 to 13961. [2018-11-18 16:16:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13961 states. [2018-11-18 16:16:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13961 states to 13961 states and 17196 transitions. [2018-11-18 16:16:35,936 INFO L78 Accepts]: Start accepts. Automaton has 13961 states and 17196 transitions. Word has length 264 [2018-11-18 16:16:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:35,936 INFO L480 AbstractCegarLoop]: Abstraction has 13961 states and 17196 transitions. [2018-11-18 16:16:35,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:16:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13961 states and 17196 transitions. [2018-11-18 16:16:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-18 16:16:35,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:35,944 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:35,944 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:35,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:35,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1858121113, now seen corresponding path program 1 times [2018-11-18 16:16:35,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:35,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-11-18 16:16:36,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:36,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:36,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-18 16:16:36,014 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [182], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [470], [477], [480], [483], [490], [493], [505], [508], [511], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [578], [579], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:36,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:36,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:36,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:36,196 INFO L272 AbstractInterpreter]: Visited 151 different actions 739 times. Merged at 49 different actions 139 times. Never widened. Performed 7266 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7266 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 16:16:36,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:36,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:36,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:36,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:36,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:36,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 16:16:36,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-18 16:16:36,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:36,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-11-18 16:16:36,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:16:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:16:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:16:36,472 INFO L87 Difference]: Start difference. First operand 13961 states and 17196 transitions. Second operand 3 states. [2018-11-18 16:16:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:37,301 INFO L93 Difference]: Finished difference Result 24813 states and 30649 transitions. [2018-11-18 16:16:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:16:37,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-18 16:16:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:37,328 INFO L225 Difference]: With dead ends: 24813 [2018-11-18 16:16:37,328 INFO L226 Difference]: Without dead ends: 13937 [2018-11-18 16:16:37,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 617 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:16:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2018-11-18 16:16:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 13937. [2018-11-18 16:16:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13937 states. [2018-11-18 16:16:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13937 states to 13937 states and 17110 transitions. [2018-11-18 16:16:38,184 INFO L78 Accepts]: Start accepts. Automaton has 13937 states and 17110 transitions. Word has length 313 [2018-11-18 16:16:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:38,185 INFO L480 AbstractCegarLoop]: Abstraction has 13937 states and 17110 transitions. [2018-11-18 16:16:38,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:16:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13937 states and 17110 transitions. [2018-11-18 16:16:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-18 16:16:38,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:38,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:38,288 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:38,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 331916491, now seen corresponding path program 1 times [2018-11-18 16:16:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:38,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:38,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:38,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-18 16:16:38,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:38,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:16:38,340 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-11-18 16:16:38,340 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [182], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [391], [393], [396], [402], [408], [410], [412], [416], [424], [427], [428], [429], [433], [439], [442], [445], [451], [454], [457], [464], [470], [477], [480], [490], [493], [505], [508], [511], [513], [515], [517], [519], [520], [521], [530], [536], [538], [568], [572], [573], [576], [577], [578], [579], [580], [581], [582], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [600], [601], [602], [603], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [640], [641], [642] [2018-11-18 16:16:38,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:16:38,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:16:38,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:16:38,519 INFO L272 AbstractInterpreter]: Visited 162 different actions 631 times. Merged at 56 different actions 119 times. Never widened. Performed 6600 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6600 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 9 different actions. Largest state had 54 variables. [2018-11-18 16:16:38,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:38,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:16:38,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:16:38,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:16:38,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:38,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:16:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:38,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 16:16:38,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:16:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-18 16:16:38,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:16:38,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-18 16:16:38,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:38,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:16:38,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:16:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:16:38,865 INFO L87 Difference]: Start difference. First operand 13937 states and 17110 transitions. Second operand 4 states. [2018-11-18 16:16:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:39,284 INFO L93 Difference]: Finished difference Result 15586 states and 19026 transitions. [2018-11-18 16:16:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:16:39,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-11-18 16:16:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:39,289 INFO L225 Difference]: With dead ends: 15586 [2018-11-18 16:16:39,290 INFO L226 Difference]: Without dead ends: 1156 [2018-11-18 16:16:39,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:16:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-11-18 16:16:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1095. [2018-11-18 16:16:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-11-18 16:16:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1154 transitions. [2018-11-18 16:16:39,382 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1154 transitions. Word has length 320 [2018-11-18 16:16:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:39,382 INFO L480 AbstractCegarLoop]: Abstraction has 1095 states and 1154 transitions. [2018-11-18 16:16:39,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:16:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1154 transitions. [2018-11-18 16:16:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-11-18 16:16:39,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:16:39,384 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:39,384 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:16:39,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash 532240633, now seen corresponding path program 1 times [2018-11-18 16:16:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:16:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:39,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:16:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-18 16:16:39,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:16:39,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:16:39,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:16:39,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:16:39,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:16:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:16:39,534 INFO L87 Difference]: Start difference. First operand 1095 states and 1154 transitions. Second operand 8 states. [2018-11-18 16:16:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:40,220 INFO L93 Difference]: Finished difference Result 1096 states and 1156 transitions. [2018-11-18 16:16:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:16:40,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 385 [2018-11-18 16:16:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:16:40,221 INFO L225 Difference]: With dead ends: 1096 [2018-11-18 16:16:40,221 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:16:40,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:16:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:16:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:16:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:16:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:16:40,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 385 [2018-11-18 16:16:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:16:40,225 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:16:40,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:16:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:16:40,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:16:40,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:16:41,037 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 419 [2018-11-18 16:16:42,897 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 256 [2018-11-18 16:16:43,451 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 419 [2018-11-18 16:16:43,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:43,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:43,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:43,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:44,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:45,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:46,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:47,259 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 237 [2018-11-18 16:16:47,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:47,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:47,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:47,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:48,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:16:49,073 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:16:53,019 WARN L180 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 540 DAG size of output: 264 [2018-11-18 16:16:54,571 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 229 DAG size of output: 174 [2018-11-18 16:16:54,911 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:16:56,316 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 242 DAG size of output: 148 [2018-11-18 16:16:58,681 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 276 DAG size of output: 154 [2018-11-18 16:16:59,428 WARN L180 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 145 [2018-11-18 16:17:00,263 WARN L180 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 158 [2018-11-18 16:17:00,701 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 146 [2018-11-18 16:17:00,864 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 109 [2018-11-18 16:17:01,599 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 139 [2018-11-18 16:17:01,746 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 1 [2018-11-18 16:17:03,857 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 238 DAG size of output: 178 [2018-11-18 16:17:06,282 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 296 DAG size of output: 146 [2018-11-18 16:17:06,623 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:08,500 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 363 DAG size of output: 208 [2018-11-18 16:17:12,497 WARN L180 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 540 DAG size of output: 264 [2018-11-18 16:17:13,806 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 214 DAG size of output: 161 [2018-11-18 16:17:14,869 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 241 DAG size of output: 153 [2018-11-18 16:17:17,323 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 256 DAG size of output: 188 [2018-11-18 16:17:17,563 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 109 [2018-11-18 16:17:19,768 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 249 DAG size of output: 183 [2018-11-18 16:17:19,931 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 81 [2018-11-18 16:17:20,995 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 256 DAG size of output: 186 [2018-11-18 16:17:23,677 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 267 DAG size of output: 198 [2018-11-18 16:17:24,075 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 132 [2018-11-18 16:17:25,685 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 258 DAG size of output: 152 [2018-11-18 16:17:27,190 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 235 DAG size of output: 176 [2018-11-18 16:17:29,370 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 354 DAG size of output: 207 [2018-11-18 16:17:30,972 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 305 DAG size of output: 188 [2018-11-18 16:17:31,313 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:32,172 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 142 [2018-11-18 16:17:34,170 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 267 DAG size of output: 149 [2018-11-18 16:17:34,306 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 1 [2018-11-18 16:17:36,269 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 251 DAG size of output: 176 [2018-11-18 16:17:36,437 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 109 [2018-11-18 16:17:36,594 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 102 [2018-11-18 16:17:37,668 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 206 DAG size of output: 154 [2018-11-18 16:17:37,846 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 109 [2018-11-18 16:17:38,001 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 102 [2018-11-18 16:17:38,381 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 132 [2018-11-18 16:17:41,298 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 271 DAG size of output: 202 [2018-11-18 16:17:42,283 WARN L180 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 148 [2018-11-18 16:17:42,453 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 107 [2018-11-18 16:17:42,794 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:43,136 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:45,411 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 335 DAG size of output: 192 [2018-11-18 16:17:46,637 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 221 DAG size of output: 157 [2018-11-18 16:17:47,015 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:47,267 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 1 [2018-11-18 16:17:47,953 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 161 [2018-11-18 16:17:49,222 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 186 DAG size of output: 143 [2018-11-18 16:17:50,712 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 345 DAG size of output: 209 [2018-11-18 16:17:50,924 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 76 [2018-11-18 16:17:51,677 WARN L180 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 140 [2018-11-18 16:17:52,019 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:52,143 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 1 [2018-11-18 16:17:54,376 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 249 DAG size of output: 183 [2018-11-18 16:17:54,513 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 1 [2018-11-18 16:17:54,655 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 65 [2018-11-18 16:17:56,594 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 233 DAG size of output: 178 [2018-11-18 16:17:56,994 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2018-11-18 16:17:58,443 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 338 DAG size of output: 205 [2018-11-18 16:17:59,364 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-11-18 16:17:59,959 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2018-11-18 16:18:00,439 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 146 [2018-11-18 16:18:02,577 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 365 DAG size of output: 194 [2018-11-18 16:18:02,748 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 109 [2018-11-18 16:18:02,918 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 109 [2018-11-18 16:18:05,083 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 276 DAG size of output: 192 [2018-11-18 16:18:05,085 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-18 16:18:05,086 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 86 121) the Hoare annotation is: (let ((.cse55 (= 1 ~m_pc~0)) (.cse54 (= ~m_i~0 1))) (let ((.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse45 (= ~m_st~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse14 (not .cse54)) (.cse18 (= |old(~t1_pc~0)| 1)) (.cse1 (= ~T3_E~0 0)) (.cse2 (= ~T2_E~0 0)) (.cse13 (not (= 1 ~t2_pc~0))) (.cse8 (not (= 2 ~E_3~0))) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse10 (not (= 0 ~t3_pc~0))) (.cse20 (not (= 1 ~t3_pc~0))) (.cse52 (not (= 0 ~t2_pc~0))) (.cse50 (not (= 2 ~E_M~0))) (.cse7 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (= 2 |old(~E_2~0)|))) (.cse57 (not (= 0 |old(~m_st~0)|))) (.cse58 (not (= 0 ~m_pc~0))) (.cse53 (= ~t1_pc~0 1)) (.cse11 (not (= 0 |old(~t3_st~0)|))) (.cse56 (not (= 2 |old(~t3_st~0)|))) (.cse35 (not .cse55)) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse46 (= ~t3_st~0 0))) (let ((.cse17 (or (= ~t3_st~0 2) .cse46)) (.cse5 (and (or .cse35 .cse15 .cse11) (or .cse56 .cse35 .cse15))) (.cse27 (= 0 ~m_st~0)) (.cse37 (< 0 ~t2_pc~0)) (.cse23 (not .cse53)) (.cse40 (= 0 ~t2_st~0)) (.cse19 (< |old(~t3_st~0)| 2)) (.cse24 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse28 (= ~token~0 0)) (.cse30 (or (not (= |old(~token~0)| 0)) .cse57 (not (= 0 ~local~0)) .cse58)) (.cse33 (= ~m_st~0 2)) (.cse47 (= ~t2_st~0 0)) (.cse48 (= ~E_2~0 2)) (.cse3 (= ~t1_pc~0 0)) (.cse49 (and (or .cse7 .cse35 .cse9 .cse15) (or .cse7 .cse57 .cse9 .cse58))) (.cse31 (and (or .cse7 .cse9 .cse52 .cse10 .cse50) (or .cse7 .cse9 .cse20 .cse52 .cse50))) (.cse51 (not (= 2 ~E_1~0))) (.cse16 (and (or .cse13 .cse7 .cse56 .cse8 .cse35 .cse9 (not (= 2 |old(~t2_st~0)|)) .cse20) (or .cse7 .cse8 .cse32 .cse35 .cse9 .cse52 .cse10 .cse11))) (.cse6 (< ~E_1~0 2)) (.cse38 (or .cse0 .cse14 (= 0 ~E_1~0) (not .cse18) .cse1 (= 0 ~E_M~0) .cse2)) (.cse21 (< ~E_3~0 2)) (.cse22 (< |old(~E_2~0)| 2)) (.cse36 (< 0 ~t3_pc~0)) (.cse25 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse34 (= 0 ~t3_st~0)) (.cse39 (and (= ~m_st~0 |old(~m_st~0)|) (not .cse2) .cse53 .cse54 .cse26 (not .cse45) (not .cse1) (not .cse0) .cse55 (not (= ~E_3~0 0)))) (.cse41 (<= ~token~0 ~local~0)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (<= ~local~0 ~token~0)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse4 (< ~E_M~0 2)) (.cse43 (< ~local~0 |old(~token~0)|)) (.cse44 (< |old(~token~0)| ~local~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14) (or .cse6 .cse0 .cse15 (and (= ~t2_st~0 2) .cse3) .cse1 .cse2 .cse13 .cse14 .cse4 .cse16) (or .cse6 .cse0 .cse12 .cse17 .cse1 .cse18 .cse19 .cse20 .cse2 .cse13 .cse14 .cse21 .cse4 .cse5 .cse22) (or .cse0 .cse1 .cse2 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse4 .cse6 .cse30 .cse12 .cse18 .cse20 .cse19 .cse13 .cse14 .cse21 .cse22) (or .cse6 .cse0 (and .cse3 .cse17) .cse1 .cse19 .cse20 .cse2 .cse31 .cse14 .cse32 .cse21 .cse5) (or .cse6 .cse0 .cse12 (and .cse23 .cse25 .cse26 .cse33 .cse34 .cse29) .cse15 .cse1 .cse18 .cse2 .cse11 .cse13 .cse14 .cse21 .cse35 .cse4 .cse22 .cse36) (or .cse37 .cse4 (or .cse6 .cse38 .cse21 .cse32 .cse35 .cse15 .cse22 .cse19 .cse20) (and .cse39 .cse40 .cse24 .cse29)) (or .cse0 .cse1 .cse2 .cse4 (and .cse23 .cse25 .cse26 .cse34 .cse27 .cse28 .cse29) .cse6 .cse30 .cse12 .cse18 .cse11 .cse13 .cse14 .cse21 .cse22 .cse36) (or (and .cse34 .cse40 .cse39 .cse29) .cse37 .cse4 (or .cse6 .cse38 .cse21 .cse32 .cse35 .cse15 .cse22 .cse36) .cse11) (or .cse6 .cse0 .cse12 (and .cse23 .cse24 .cse25 .cse26 .cse33 .cse29) .cse15 .cse1 .cse18 .cse19 .cse20 .cse2 .cse13 .cse14 .cse21 .cse35 .cse4 .cse22) (or .cse0 (and .cse23 .cse24 .cse26 .cse40 .cse27 .cse28 .cse29) .cse37 .cse1 .cse2 .cse4 .cse6 .cse30 .cse18 .cse20 .cse19 .cse14 .cse32 .cse21 .cse22) (or .cse6 .cse0 .cse37 .cse15 .cse1 .cse18 .cse19 .cse20 .cse2 .cse14 .cse32 .cse21 .cse35 .cse4 .cse22 (and .cse23 .cse24 .cse26 .cse33 .cse40 .cse29)) (or (or .cse13 .cse6 .cse38 .cse21 .cse35 .cse15 .cse22 .cse19 .cse20) .cse12 (and .cse25 .cse39 .cse41 .cse24 .cse29 .cse42) .cse4 .cse43 .cse44) (or (and .cse29 .cse45 .cse46 .cse47 .cse28 .cse48 .cse3) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse8 (not (= 1 ~t1_i~0)) .cse30 (not (= ~T2_E~0 2)) .cse49 .cse11 .cse10 .cse50 (not (= 1 ~t3_i~0)) .cse14 .cse32 .cse51 (not (= 1 ~t2_i~0)) .cse52 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 (and .cse33 .cse34 .cse47 .cse48 .cse3 .cse29) .cse49 .cse31 .cse14 .cse51 .cse16) (or (or .cse13 .cse6 .cse38 .cse21 .cse35 .cse15 .cse22 .cse36) (and .cse25 .cse34 .cse39 .cse41 .cse29 .cse42) .cse12 .cse4 .cse43 .cse44 .cse11))))) [2018-11-18 16:18:05,086 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-18 16:18:05,087 INFO L421 ceAbstractionStarter]: At program point L94(lines 89 120) the Hoare annotation is: (let ((.cse40 (= 1 ~m_pc~0)) (.cse39 (= ~m_i~0 1))) (let ((.cse11 (not .cse39)) (.cse7 (= |old(~t1_pc~0)| 1)) (.cse2 (= ~T2_E~0 0)) (.cse1 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse15 (not .cse40)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse38 (not (= 0 ~m_pc~0)))) (let ((.cse17 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse23 (< ~local~0 |old(~token~0)|)) (.cse24 (< |old(~token~0)| ~local~0)) (.cse26 (let ((.cse41 (not (= |old(~t1_pc~0)| 0))) (.cse42 (not (= 2 |old(~E_2~0)|)))) (and (or .cse41 .cse15 .cse42 .cse16) (or .cse41 .cse37 .cse42 .cse38)))) (.cse29 (not (= 2 ~E_M~0))) (.cse31 (not (= 2 ~E_1~0))) (.cse25 (not (= 2 ~E_3~0))) (.cse32 (not (= 0 ~t2_pc~0))) (.cse28 (not (= 0 ~t3_pc~0))) (.cse20 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse34 (= 0 ~t3_st~0)) (.cse36 (= 0 ~t2_st~0)) (.cse18 (and (= ~m_st~0 |old(~m_st~0)|) (not .cse2) (= ~t1_pc~0 1) .cse39 (= |old(~E_2~0)| ~E_2~0) (not (= ~m_st~0 0)) (not .cse1) (not .cse0) .cse40 (not (= ~E_3~0 0)))) (.cse21 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (or .cse0 .cse11 (= 0 ~E_1~0) (not .cse7) .cse1 (= 0 ~E_M~0) .cse2)) (.cse6 (< |old(~t2_st~0)| 2)) (.cse27 (not (= 0 |old(~t3_st~0)|))) (.cse10 (not (= 1 ~t2_pc~0))) (.cse33 (< 0 ~t3_pc~0)) (.cse35 (< 0 ~t2_pc~0)) (.cse3 (< ~E_M~0 2)) (.cse4 (< ~E_1~0 2)) (.cse5 (and (or .cse15 .cse16) (or (not (= |old(~token~0)| 0)) .cse37 (not (= 0 ~local~0)) .cse38))) (.cse8 (not (= 1 ~t3_pc~0))) (.cse9 (< |old(~t3_st~0)| 2)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse12 (< ~E_3~0 2)) (.cse13 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (or .cse10 .cse4 .cse14 .cse12 .cse15 .cse16 .cse13 .cse9 .cse8) .cse6 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse3 .cse23 .cse24) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse25 (not (= 1 ~t1_i~0)) .cse5 (not (= ~T2_E~0 2)) .cse26 .cse27 .cse28 .cse29 (not (= 1 ~t3_i~0)) .cse11 .cse30 .cse31 (not (= 1 ~t2_i~0)) .cse32 (not (= 2 ~M_E~0))) (or (or .cse10 .cse4 .cse14 .cse12 .cse15 .cse16 .cse13 .cse33) (and .cse17 .cse34 .cse18 .cse19 .cse21 .cse22) .cse6 .cse3 .cse23 .cse24 .cse27) (or .cse0 .cse1 .cse2 .cse26 .cse29 .cse11 .cse31 (or .cse25 .cse30 .cse15 .cse32 .cse28 .cse27)) (or .cse35 .cse3 (or .cse4 .cse14 .cse12 .cse30 .cse15 .cse16 .cse13 .cse9 .cse8) (and .cse18 .cse36 .cse20 .cse21)) (or (and .cse34 .cse36 .cse18 .cse21) .cse35 .cse3 (or .cse4 .cse14 .cse12 .cse30 .cse15 .cse16 .cse13 .cse33) .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse10 .cse11 .cse12 .cse13 .cse33) (or .cse0 .cse35 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse30 .cse12 .cse13))))) [2018-11-18 16:18:05,088 INFO L421 ceAbstractionStarter]: At program point L115(lines 86 121) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse8 (not (= ~m_i~0 1))) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse3 (= ~T3_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse50 (not (= 0 |old(~m_st~0)|))) (.cse51 (not (= 0 ~m_pc~0))) (.cse31 (not (= 0 |old(~t3_st~0)|))) (.cse14 (not (= 1 ~m_pc~0))) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse45 (not (= 0 ~t3_pc~0))) (.cse48 (not (= |old(~t1_pc~0)| 0))) (.cse49 (not (= 2 |old(~E_2~0)|))) (.cse5 (not (= 1 ~t3_pc~0))) (.cse47 (not (= 0 ~t2_pc~0))) (.cse46 (not (= 2 ~E_M~0)))) (let ((.cse7 (and (or .cse48 .cse49 .cse47 .cse45 .cse46) (or .cse48 .cse49 .cse5 .cse47 .cse46))) (.cse2 (or (= ~t3_st~0 0) (= ~t3_st~0 2))) (.cse11 (and (or .cse14 .cse15 .cse31) (or (not (= 2 |old(~t3_st~0)|)) .cse14 .cse15))) (.cse36 (<= |old(~E_2~0)| ~E_2~0)) (.cse39 (= ~t1_st~0 2)) (.cse40 (= ~t2_st~0 0)) (.cse34 (= 0 ~m_st~0)) (.cse35 (= ~token~0 0)) (.cse41 (= ~E_2~0 2)) (.cse44 (not (= 2 ~E_3~0))) (.cse37 (or (not (= |old(~token~0)| 0)) .cse50 (not (= 0 ~local~0)) .cse51)) (.cse42 (and (or .cse48 .cse14 .cse49 .cse15) (or .cse48 .cse50 .cse49 .cse51))) (.cse43 (not (= 2 ~E_1~0))) (.cse12 (not (= 1 ~t2_pc~0))) (.cse4 (< |old(~t3_st~0)| 2)) (.cse26 (< |old(~t2_st~0)| 2)) (.cse20 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse25 (<= (+ ~local~0 1) ~token~0)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse33 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse29 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (< 0 ~t2_pc~0)) (.cse27 (< ~E_M~0 2)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse21 (<= 2 ~E_2~0)) (.cse22 (= ~m_st~0 2)) (.cse23 (= 0 ~t3_st~0)) (.cse24 (= 0 ~t2_st~0)) (.cse0 (< ~E_1~0 2)) (.cse13 (or .cse1 .cse8 (= 0 ~E_1~0) (not .cse38) .cse3 (= 0 ~E_M~0) .cse6)) (.cse10 (< ~E_3~0 2)) (.cse9 (not (= 0 |old(~t2_st~0)|))) (.cse16 (< |old(~E_2~0)| 2)) (.cse17 (< 0 ~t3_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (or .cse12 .cse0 .cse13 .cse10 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse27 .cse28 (and .cse18 .cse19 .cse21 .cse29 .cse22 .cse23) .cse30 .cse31) (or .cse1 .cse32 .cse3 .cse6 .cse27 (and .cse18 .cse19 .cse33 .cse24 .cse34 .cse35 .cse36) .cse0 .cse37 .cse38 .cse5 .cse4 .cse8 .cse9 .cse10 .cse16) (or .cse1 .cse3 .cse6 .cse27 .cse0 .cse37 .cse26 (and .cse18 .cse19 .cse33 .cse29 .cse34 .cse35 .cse36) .cse38 .cse5 .cse4 .cse12 .cse8 .cse10 .cse16) (or .cse0 .cse1 .cse32 .cse15 .cse3 .cse38 .cse4 .cse5 .cse6 (and .cse18 .cse19 .cse33 .cse22 .cse24 .cse36) .cse8 .cse9 .cse10 .cse14 .cse27 .cse16) (or .cse1 .cse3 .cse6 (and .cse18 .cse22 .cse39 .cse23 .cse40 .cse41) .cse42 .cse7 .cse8 .cse43 (or .cse44 .cse9 .cse14 .cse45 .cse31)) (or .cse0 .cse1 .cse26 .cse3 .cse38 .cse4 .cse5 .cse6 .cse12 .cse8 .cse2 .cse10 .cse27 .cse11 .cse16) (or .cse0 .cse1 .cse26 .cse15 .cse3 .cse38 .cse6 .cse31 .cse12 .cse8 .cse10 .cse14 .cse27 .cse16 .cse17 (and .cse18 .cse19 .cse29 .cse22 .cse23 .cse36)) (or .cse1 (and .cse18 .cse19 .cse29 .cse23 .cse34 .cse35 .cse36) .cse3 .cse6 .cse27 .cse0 .cse37 .cse26 .cse38 .cse31 .cse12 .cse8 .cse10 .cse16 .cse17) (or .cse0 .cse1 .cse26 .cse15 (and .cse18 .cse19 .cse33 .cse29 .cse22 .cse36) .cse3 .cse38 .cse4 .cse5 .cse6 .cse12 .cse8 .cse10 .cse14 .cse27 .cse16) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (and .cse18 .cse39 .cse23 .cse40 .cse34 .cse35 .cse41) .cse44 (not (= 1 ~t1_i~0)) .cse37 (not (= ~T2_E~0 2)) .cse42 .cse31 .cse45 .cse46 (not (= 1 ~t3_i~0)) .cse8 .cse9 .cse43 (not (= 1 ~t2_i~0)) .cse47 (not (= 2 ~M_E~0))) (or .cse32 .cse27 (or .cse0 .cse13 .cse10 .cse9 .cse14 .cse15 .cse16 .cse4 .cse5) (and .cse18 .cse19 .cse21 .cse33 .cse22 .cse24)) (or (or .cse12 .cse0 .cse13 .cse10 .cse14 .cse15 .cse16 .cse4 .cse5) .cse26 (and .cse18 .cse19 .cse20 .cse21 .cse33 .cse22 .cse24 .cse25) .cse27 .cse28 .cse30 (and .cse18 .cse19 .cse21 .cse33 .cse29 .cse22)) (or .cse32 .cse27 (and .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse13 .cse10 .cse9 .cse14 .cse15 .cse16 .cse17) .cse31)))) [2018-11-18 16:18:05,088 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 86 121) no Hoare annotation was computed. [2018-11-18 16:18:05,088 INFO L421 ceAbstractionStarter]: At program point L111(line 111) the Hoare annotation is: (let ((.cse4 (not (= 1 ~m_pc~0))) (.cse5 (not (= 2 |old(~m_st~0)|))) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse40 (not (= 0 ~m_pc~0))) (.cse21 (= ~T1_E~0 0)) (.cse26 (not (= ~m_i~0 1))) (.cse25 (= |old(~t1_pc~0)| 1)) (.cse22 (= ~T3_E~0 0)) (.cse23 (= ~T2_E~0 0))) (let ((.cse11 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse19 (< ~local~0 |old(~token~0)|)) (.cse20 (< |old(~token~0)| ~local~0)) (.cse10 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse13 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse15 (<= (+ ~local~0 1) ~token~0)) (.cse9 (= ~t1_pc~0 1)) (.cse12 (not (= ~E_2~0 0))) (.cse14 (= ~m_st~0 2)) (.cse31 (= 0 ~t3_st~0)) (.cse27 (= 0 ~t2_st~0)) (.cse16 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (or .cse21 .cse26 (= 0 ~E_1~0) (not .cse25) .cse22 (= 0 ~E_M~0) .cse23)) (.cse34 (let ((.cse41 (not (= |old(~t1_pc~0)| 0))) (.cse42 (not (= 2 |old(~E_2~0)|)))) (and (or .cse41 .cse4 .cse42 .cse5) (or .cse41 .cse39 .cse42 .cse40)))) (.cse36 (not (= 2 ~E_M~0))) (.cse37 (not (= 2 ~E_1~0))) (.cse33 (not (= 2 ~E_3~0))) (.cse38 (not (= 0 ~t2_pc~0))) (.cse35 (not (= 0 ~t3_pc~0))) (.cse17 (< |old(~t2_st~0)| 2)) (.cse32 (not (= 0 |old(~t3_st~0)|))) (.cse0 (not (= 1 ~t2_pc~0))) (.cse30 (< 0 ~t3_pc~0)) (.cse28 (< 0 ~t2_pc~0)) (.cse18 (< ~E_M~0 2)) (.cse1 (< ~E_1~0 2)) (.cse24 (and (or .cse4 .cse5) (or (not (= |old(~token~0)| 0)) .cse39 (not (= 0 ~local~0)) .cse40))) (.cse8 (not (= 1 ~t3_pc~0))) (.cse7 (< |old(~t3_st~0)| 2)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse3 (< ~E_3~0 2)) (.cse6 (< |old(~E_2~0)| 2))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse22 .cse23 .cse18 .cse1 .cse24 .cse17 .cse25 .cse8 .cse7 .cse0 .cse26 .cse3 .cse6) (or (and .cse9 .cse11 .cse12 .cse14 .cse27 .cse16) .cse28 .cse18 (or .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8)) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30) .cse17 .cse18 .cse19 .cse20 (and .cse9 .cse10 .cse12 .cse13 .cse14 .cse31 .cse15 .cse16) .cse32) (or .cse28 .cse18 (and .cse9 .cse12 .cse14 .cse31 .cse27 .cse16) (or .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse30) .cse32) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse33 (not (= 1 ~t1_i~0)) .cse24 (not (= ~T2_E~0 2)) .cse34 .cse32 .cse35 .cse36 (not (= 1 ~t3_i~0)) .cse26 .cse29 .cse37 (not (= 1 ~t2_i~0)) .cse38 (not (= 2 ~M_E~0))) (or .cse21 .cse22 .cse23 .cse34 .cse36 .cse26 .cse37 (or .cse33 .cse29 .cse4 .cse38 .cse35 .cse32)) (or .cse21 .cse22 .cse23 .cse18 .cse1 .cse24 .cse17 .cse25 .cse32 .cse0 .cse26 .cse3 .cse6 .cse30) (or .cse21 .cse28 .cse22 .cse23 .cse18 .cse1 .cse24 .cse25 .cse8 .cse7 .cse26 .cse29 .cse3 .cse6)))) [2018-11-18 16:18:05,088 INFO L425 ceAbstractionStarter]: For program point L111-1(line 111) no Hoare annotation was computed. [2018-11-18 16:18:05,088 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 114) no Hoare annotation was computed. [2018-11-18 16:18:05,089 INFO L421 ceAbstractionStarter]: At program point L101-2(lines 89 120) the Hoare annotation is: (let ((.cse17 (= ~T1_E~0 0)) (.cse18 (= ~T3_E~0 0)) (.cse19 (= ~T2_E~0 0))) (let ((.cse55 (not .cse19)) (.cse56 (not .cse18)) (.cse57 (not .cse17)) (.cse61 (= 1 ~m_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse62 (= ~m_i~0 1)) (.cse60 (= 1 ~t3_pc~0))) (let ((.cse9 (not (= 0 |old(~t3_st~0)|))) (.cse10 (not (= 0 ~t3_pc~0))) (.cse30 (not .cse60)) (.cse15 (not (= 0 ~t2_pc~0))) (.cse11 (not (= 2 ~E_M~0))) (.cse32 (<= 2 ~E_2~0)) (.cse31 (= 0 ~t2_st~0)) (.cse12 (not .cse62)) (.cse36 (= |old(~t1_pc~0)| 1)) (.cse16 (= ~m_st~0 2)) (.cse34 (and (and .cse55 .cse62 (not (= ~E_M~0 0)) .cse56 .cse57 .cse61 (not (= ~E_3~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0))) (= ~m_st~0 |old(~m_st~0)|) (not .cse2))) (.cse21 (not .cse61)) (.cse27 (not (= 2 |old(~m_st~0)|))) (.cse53 (not (= |old(~t1_pc~0)| 0))) (.cse58 (not (= 0 |old(~m_st~0)|))) (.cse54 (not (= 2 |old(~E_2~0)|))) (.cse59 (not (= 0 ~m_pc~0)))) (let ((.cse4 (= ~t2_st~0 0)) (.cse8 (and (or .cse53 .cse21 .cse54 .cse27) (or .cse53 .cse58 .cse54 .cse59))) (.cse14 (not (= 2 ~E_1~0))) (.cse0 (not (= 2 ~E_3~0))) (.cse44 (< ~local~0 |old(~token~0)|)) (.cse45 (< |old(~token~0)| ~local~0)) (.cse42 (and .cse60 .cse16 (<= 2 ~E_1~0) .cse34)) (.cse47 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse48 (<= (+ ~local~0 1) ~token~0)) (.cse25 (or .cse17 .cse12 (= 0 ~E_1~0) (not .cse36) .cse18 (= 0 ~E_M~0) .cse19)) (.cse46 (and .cse32 .cse34 .cse31)) (.cse22 (< 0 ~t2_pc~0)) (.cse3 (= 0 ~t3_st~0)) (.cse43 (< 0 ~t3_pc~0)) (.cse23 (< ~E_M~0 2)) (.cse1 (or (not (= |old(~token~0)| 0)) .cse58 (not (= 0 ~local~0)) .cse59)) (.cse37 (< |old(~t2_st~0)| 2)) (.cse41 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse49 (and (and (and .cse55 .cse56 .cse57) .cse2 (= ~m_pc~0 0)) (= ~local~0 0))) (.cse50 (<= ~token~0 ~local~0)) (.cse33 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse7 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse51 (<= ~local~0 ~token~0)) (.cse35 (<= |old(~E_2~0)| ~E_2~0)) (.cse38 (not (= 1 ~t2_pc~0))) (.cse28 (< |old(~E_2~0)| 2)) (.cse24 (< ~E_1~0 2)) (.cse29 (< |old(~t3_st~0)| 2)) (.cse20 (and (or .cse53 .cse54 .cse15 .cse10 .cse11) (or .cse53 .cse54 .cse30 .cse15 .cse11))) (.cse5 (= ~E_2~0 2)) (.cse6 (= ~t1_pc~0 0)) (.cse40 (let ((.cse52 (= ~m_pc~0 1))) (or (and .cse52 .cse16 (= ~t3_st~0 0)) (and .cse52 (= ~t3_st~0 2) .cse16)))) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse26 (< ~E_3~0 2)) (.cse39 (and (or .cse21 .cse27 .cse9) (or (not (= 2 |old(~t3_st~0)|)) .cse21 .cse27)))) (and (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse0 (not (= 1 ~t1_i~0)) .cse1 (not (= ~T2_E~0 2)) (and (and .cse2 (= ~token~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 (not (= 1 ~t3_i~0)) .cse12 .cse13 .cse14 (not (= 1 ~t2_i~0)) .cse15 (not (= 2 ~M_E~0))) (or (and .cse16 .cse3 .cse4 .cse5 .cse6 .cse7) .cse17 .cse18 .cse19 .cse8 .cse20 .cse12 .cse14 (or .cse0 .cse13 .cse21 .cse10 .cse9)) (or .cse22 .cse23 (or .cse24 .cse25 .cse26 .cse13 .cse21 .cse27 .cse28 .cse29 .cse30) (and .cse31 .cse32 .cse33 .cse7 .cse34)) (or (and .cse31 .cse33 .cse7 .cse34 .cse35) .cse24 .cse17 .cse22 .cse27 .cse18 .cse36 .cse29 .cse30 .cse19 .cse12 .cse13 .cse26 .cse21 .cse23 .cse28) (or .cse24 .cse17 .cse37 .cse18 .cse36 .cse29 .cse30 .cse19 .cse38 .cse12 .cse26 .cse23 .cse39 .cse28 .cse40) (or .cse24 .cse17 .cse37 .cse27 .cse18 .cse36 .cse29 .cse30 .cse19 .cse38 .cse12 .cse26 .cse21 .cse23 .cse28 (and .cse41 .cse33 .cse7 .cse42 .cse35)) (or (or .cse38 .cse24 .cse25 .cse26 .cse21 .cse27 .cse28 .cse43) .cse37 .cse23 .cse44 .cse45 (and .cse41 (and .cse34 .cse32) .cse7 .cse3) (and .cse46 .cse47 .cse48 .cse7 .cse3) .cse9) (or (or .cse38 .cse24 .cse25 .cse26 .cse21 .cse27 .cse28 .cse29 .cse30) .cse37 .cse23 .cse44 .cse45 (and .cse41 .cse32 .cse33 .cse7 .cse42) (and .cse31 .cse47 .cse32 .cse48 .cse33 .cse7 .cse34)) (or .cse22 .cse23 (or .cse24 .cse25 .cse26 .cse13 .cse21 .cse27 .cse28 .cse43) (and .cse46 .cse7 .cse3) .cse9) (or .cse17 (and .cse41 .cse49 .cse3 .cse50 .cse7 .cse51 .cse35) .cse18 .cse19 .cse23 .cse24 .cse1 .cse37 .cse36 .cse9 .cse38 .cse12 .cse26 .cse28 .cse43) (or (and .cse49 .cse31 .cse50 .cse33 .cse7 .cse51 .cse35) .cse17 .cse22 .cse18 .cse19 .cse23 .cse24 .cse1 .cse36 .cse30 .cse29 .cse12 .cse13 .cse26 .cse28) (or .cse24 .cse17 .cse37 .cse27 .cse18 .cse36 .cse19 .cse9 .cse38 .cse12 .cse26 .cse21 .cse23 (and .cse41 .cse3 .cse34 .cse7 .cse35) .cse28 .cse43) (or .cse17 .cse18 .cse19 .cse23 .cse24 .cse1 .cse37 (and .cse41 .cse49 .cse50 .cse33 .cse7 .cse51 .cse35) .cse36 .cse30 .cse29 .cse38 .cse12 .cse26 .cse28) (or .cse24 .cse17 .cse18 .cse29 .cse30 .cse19 .cse20 .cse12 (and (and .cse5 .cse6) .cse40) .cse13 .cse26 .cse39)))))) [2018-11-18 16:18:05,089 INFO L421 ceAbstractionStarter]: At program point transmit3ENTRY(lines 158 193) the Hoare annotation is: (let ((.cse44 (= 0 |old(~m_st~0)|)) (.cse31 (= 1 ~m_pc~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse39 (not (= 0 ~t2_pc~0))) (.cse15 (= ~T1_E~0 0)) (.cse35 (not (= 2 ~E_2~0))) (.cse16 (not .cse29)) (.cse17 (= ~T3_E~0 0)) (.cse18 (= ~T2_E~0 0)) (.cse37 (not (= 0 |old(~t3_pc~0)|))) (.cse3 (not (= 1 ~t2_pc~0))) (.cse19 (not (= ~m_i~0 1))) (.cse45 (not (= 2 ~E_1~0))) (.cse20 (not .cse31)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse46 (not (= |old(~token~0)| 0))) (.cse47 (not .cse44)) (.cse48 (not (= 0 ~local~0))) (.cse49 (not (= 0 ~m_pc~0)))) (let ((.cse43 (not (= 2 ~E_3~0))) (.cse41 (= ~t1_st~0 0)) (.cse40 (= ~E_M~0 2)) (.cse42 (= ~t2_st~0 0)) (.cse36 (not (= ~t1_pc~0 0))) (.cse38 (not (= 2 |old(~E_M~0)|))) (.cse25 (= 0 ~m_st~0)) (.cse26 (= ~token~0 0)) (.cse28 (and (or .cse20 .cse2) (or .cse46 .cse47 .cse48 .cse49))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse10 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse13 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (< ~E_1~0 2)) (.cse8 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse9 (= |old(~E_M~0)| ~E_M~0)) (.cse11 (= ~token~0 |old(~token~0)|)) (.cse12 (= ~m_st~0 2)) (.cse23 (= 0 ~t1_st~0)) (.cse33 (= 0 ~t2_st~0)) (.cse24 (<= ~t3_pc~0 0)) (.cse51 (< ~local~0 |old(~token~0)|)) (.cse52 (< |old(~token~0)| ~local~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse21 (< ~E_2~0 2)) (.cse30 (< 0 |old(~t3_pc~0)|)) (.cse32 (< 0 ~t2_pc~0)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse0 (= ~t3_pc~0 0)) (.cse5 (< ~E_3~0 2)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse6 (< |old(~E_M~0)| 2)) (.cse7 (let ((.cse53 (= 0 ~E_3~0)) (.cse54 (= 0 |old(~E_M~0)|))) (and (or .cse15 .cse53 .cse35 .cse16 .cse17 .cse18 .cse37 .cse19 .cse20 .cse45 .cse54 .cse44 .cse39) (or .cse15 .cse53 .cse35 .cse16 .cse17 .cse18 .cse37 .cse3 .cse19 .cse20 .cse45 .cse54 .cse44))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse22 (+ ~local~0 2))) (or (and (= 1 ~t3_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse4 .cse1 (or .cse14 .cse15 .cse2 .cse16 .cse17 (not (= 1 |old(~t3_pc~0)|)) .cse18 .cse3 .cse19 .cse5 .cse20 .cse21) .cse6 (< .cse22 |old(~token~0)|) (< |old(~token~0)| .cse22))) (or .cse15 (and .cse8 .cse9 .cse10 .cse23 .cse24 .cse25 .cse26) .cse17 .cse18 .cse27 .cse6 .cse14 .cse28 .cse1 .cse29 .cse3 .cse19 .cse5 .cse21 .cse30 .cse31) (or .cse15 .cse32 (and .cse8 .cse9 .cse33 .cse24 .cse25 .cse26 .cse13) .cse17 .cse18 .cse4 .cse6 .cse14 .cse28 .cse16 .cse19 .cse34 .cse5 .cse21 .cse30 .cse31) (or .cse15 .cse35 .cse2 .cse17 .cse18 .cse27 .cse36 .cse14 .cse37 .cse38 .cse19 .cse34 .cse5 .cse20 .cse39 (and .cse0 .cse8 .cse40 .cse12 .cse41 .cse42)) (or .cse15 .cse35 .cse17 (not (= 2 |old(~t2_st~0)|)) .cse18 .cse27 .cse36 .cse43 (and .cse0 (= ~t2_st~0 2)) .cse6 .cse14 .cse28 .cse37 .cse3 .cse19 .cse44) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse43 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse19 .cse45 (and .cse0 .cse41 (= ~m_st~0 0) .cse8 .cse40 .cse42 .cse26) (not (= 1 ~t2_i~0)) (not (= 2 ~M_E~0)) (or .cse46 .cse36 .cse47 .cse34 .cse35 .cse48 .cse39 .cse37 .cse49 .cse38 .cse27)) (or .cse14 .cse15 .cse32 (and .cse8 .cse9 .cse12 .cse33 .cse24 .cse13) .cse2 .cse16 .cse17 .cse18 .cse4 .cse19 .cse34 .cse5 .cse20 .cse6 .cse21 .cse30) (let ((.cse50 (+ ~local~0 1))) (or .cse14 .cse15 .cse2 .cse16 .cse17 .cse18 .cse3 .cse4 (and .cse8 .cse9 .cse11 .cse12 .cse33 .cse24 .cse13) (< |old(~token~0)| .cse50) .cse19 .cse34 .cse5 .cse20 .cse6 .cse21 .cse30 (< .cse50 |old(~token~0)|))) (or .cse14 .cse15 .cse1 .cse2 .cse17 .cse29 .cse18 .cse27 .cse3 .cse19 .cse5 .cse20 .cse6 .cse21 .cse30 (and .cse8 .cse9 .cse10 .cse12 .cse23 .cse24)) (or .cse14 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse24) .cse15 .cse1 .cse51 .cse2 .cse16 .cse52 .cse17 .cse18 .cse27 .cse3 .cse19 .cse5 .cse20 .cse6 .cse21 .cse30) (or .cse15 .cse17 .cse18 (and .cse8 .cse9 .cse10 .cse24 .cse25 .cse26 .cse13) .cse4 .cse6 .cse14 .cse28 .cse1 .cse16 .cse3 .cse19 .cse5 .cse21 .cse30 .cse31) (or .cse14 .cse15 .cse1 .cse2 .cse16 .cse17 .cse18 (and .cse8 .cse9 .cse10 .cse12 .cse24 .cse13) .cse3 .cse4 .cse19 .cse5 .cse20 .cse6 .cse21 .cse30) (or .cse14 .cse15 (and .cse8 .cse9 .cse11 .cse12 .cse23 .cse33 .cse24) .cse32 .cse51 .cse2 .cse16 .cse52 .cse17 .cse18 .cse27 .cse19 .cse34 .cse5 .cse20 .cse6 .cse21 .cse30) (or .cse32 .cse2 .cse4 .cse0 .cse5 .cse34 .cse6 .cse7))))) [2018-11-18 16:18:05,090 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-18 16:18:05,090 INFO L421 ceAbstractionStarter]: At program point L166(lines 161 192) the Hoare annotation is: (let ((.cse20 (not (= 1 ~m_pc~0))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse28 (not (= |old(~token~0)| 0))) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse30 (not (= 0 ~local~0))) (.cse31 (not (= 0 ~m_pc~0))) (.cse32 (= ~t1_pc~0 1))) (let ((.cse1 (< 0 ~t2_pc~0)) (.cse8 (not .cse32)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse24 (not (= ~t1_pc~0 0))) (.cse10 (not (= 0 |old(~t2_st~0)|))) (.cse23 (not (= 2 ~E_2~0))) (.cse27 (not (= 0 ~t2_pc~0))) (.cse25 (not (= 0 |old(~t3_pc~0)|))) (.cse26 (not (= 2 |old(~E_M~0)|))) (.cse16 (< ~local~0 |old(~token~0)|)) (.cse18 (< |old(~token~0)| ~local~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse5 (< |old(~E_M~0)| 2)) (.cse6 (< ~E_1~0 2)) (.cse7 (and (or .cse20 .cse17) (or .cse28 .cse29 .cse30 .cse31))) (.cse14 (< |old(~t2_st~0)| 2)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse9 (not (= ~m_i~0 1))) (.cse11 (< ~E_3~0 2)) (.cse12 (< ~E_2~0 2)) (.cse13 (< 0 |old(~t3_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse11 .cse12 .cse13) (or .cse6 .cse0 .cse1 .cse16 .cse17 .cse8 .cse18 .cse2 .cse3 .cse19 .cse9 .cse10 .cse11 .cse20 .cse5 .cse12 .cse13) (let ((.cse21 (+ ~local~0 2))) (or (and (= 1 ~t3_pc~0) (<= |old(~t3_st~0)| ~t3_st~0) (= |old(~E_M~0)| ~E_M~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 2) (<= |old(~t1_st~0)| ~t1_st~0)) .cse4 .cse14 (or .cse6 .cse0 .cse17 .cse8 .cse2 (not (= 1 |old(~t3_pc~0)|)) .cse3 .cse15 .cse9 .cse11 .cse20 .cse12) .cse5 (< .cse21 |old(~token~0)|) (< |old(~token~0)| .cse21))) (let ((.cse22 (+ ~local~0 1))) (or .cse6 .cse0 .cse17 .cse8 .cse2 .cse3 .cse15 .cse4 (< |old(~token~0)| .cse22) .cse9 .cse10 .cse11 .cse20 .cse5 .cse12 .cse13 (< .cse22 |old(~token~0)|))) (or .cse0 .cse23 .cse17 .cse2 .cse3 .cse19 .cse24 .cse6 .cse25 .cse26 .cse9 .cse10 .cse11 .cse20 .cse27) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse9 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 2 ~M_E~0)) (or .cse28 .cse24 .cse29 .cse10 .cse23 .cse30 .cse27 .cse25 .cse31 .cse26 .cse19)) (or .cse6 .cse0 .cse14 .cse16 .cse17 .cse18 .cse2 .cse3 .cse19 .cse15 .cse9 .cse11 .cse20 .cse5 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse14 .cse32 .cse15 .cse9 .cse11 .cse12 .cse13)))) [2018-11-18 16:18:05,091 INFO L421 ceAbstractionStarter]: At program point L187(lines 158 193) the Hoare annotation is: (let ((.cse50 (= 0 |old(~m_st~0)|)) (.cse40 (= 1 ~m_pc~0))) (let ((.cse42 (= ~t1_pc~0 1)) (.cse20 (not .cse40)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse44 (not (= |old(~token~0)| 0))) (.cse45 (not .cse50)) (.cse46 (not (= 0 ~local~0))) (.cse47 (not (= 0 ~m_pc~0)))) (let ((.cse28 (= ~t1_st~0 0)) (.cse29 (= ~t2_st~0 0)) (.cse33 (not (= 0 ~t2_pc~0))) (.cse32 (not (= 2 |old(~E_M~0)|))) (.cse26 (not (= 2 ~E_2~0))) (.cse30 (= ~t3_st~0 2)) (.cse27 (not (= ~t1_pc~0 0))) (.cse43 (not (= 2 ~E_3~0))) (.cse31 (not (= 0 |old(~t3_pc~0)|))) (.cse2 (< 0 ~t2_pc~0)) (.cse34 (and (or .cse20 .cse4) (or .cse44 .cse45 .cse46 .cse47))) (.cse18 (not (= 0 |old(~t2_st~0)|))) (.cse13 (= 0 ~t2_st~0)) (.cse37 (= 0 ~m_st~0)) (.cse38 (= ~token~0 0)) (.cse10 (= ~token~0 |old(~token~0)|)) (.cse12 (= 0 ~t1_st~0)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse6 (< |old(~token~0)| ~local~0)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse35 (< |old(~t2_st~0)| 2)) (.cse7 (= 1 ~t3_pc~0)) (.cse8 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= 2 ~t3_st~0)) (.cse36 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse11 (= ~m_st~0 2)) (.cse25 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not .cse42)) (.cse14 (= ~T3_E~0 0)) (.cse15 (= ~T2_E~0 0)) (.cse39 (not (= 1 ~t2_pc~0))) (.cse24 (< |old(~t1_st~0)| 2)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (< ~E_3~0 2)) (.cse21 (< |old(~E_M~0)| 2)) (.cse22 (< ~E_2~0 2)) (.cse23 (< 0 |old(~t3_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse25)) (or .cse1 .cse26 .cse4 .cse14 .cse15 .cse16 .cse27 .cse0 (and (= ~E_M~0 2) .cse11 .cse28 .cse29 .cse30 (= ~t3_pc~0 1)) .cse31 .cse32 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse1 .cse14 .cse15 .cse24 .cse21 .cse0 .cse34 .cse35 .cse5 (and .cse7 .cse8 .cse9 .cse36 .cse37 .cse38 .cse25) .cse39 .cse17 .cse19 .cse22 .cse23 .cse40) (let ((.cse41 (+ ~local~0 1))) (or .cse0 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse25) .cse1 .cse4 .cse5 .cse14 .cse15 .cse39 .cse24 (< |old(~token~0)| .cse41) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse41 |old(~token~0)|))) (or .cse0 .cse1 .cse35 .cse4 (and .cse7 .cse8 .cse9 .cse36 .cse11 .cse12) .cse14 .cse42 .cse15 .cse16 .cse39 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse43 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and .cse7 .cse8 .cse9 .cse28 .cse29 .cse37 .cse38) (not (= 1 ~t3_i~0)) .cse17 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 2 ~M_E~0)) (or .cse44 .cse27 .cse45 .cse18 .cse26 .cse46 .cse33 .cse31 .cse47 .cse32 .cse16)) (let ((.cse48 (<= 2 ~E_M~0)) (.cse49 (+ ~local~0 2))) (or .cse24 .cse35 (and .cse7 .cse48 .cse9 .cse36 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse37 .cse25) (or .cse0 .cse1 .cse4 .cse5 .cse14 (not (= 1 |old(~t3_pc~0)|)) .cse15 .cse39 .cse17 .cse19 .cse20 .cse22) .cse21 (and .cse7 .cse48 .cse9 .cse36 .cse11 .cse25) (< .cse49 |old(~token~0)|) (< |old(~token~0)| .cse49))) (or .cse1 (and .cse7 .cse8 .cse9 .cse36 .cse12 .cse37 .cse38) .cse14 .cse15 .cse16 .cse21 .cse0 .cse34 .cse35 .cse42 .cse39 .cse17 .cse19 .cse22 .cse23 .cse40) (or .cse1 .cse26 .cse14 (not (= 2 |old(~t2_st~0)|)) .cse15 .cse16 (and (= ~t2_st~0 2) .cse30) .cse27 .cse43 .cse21 .cse0 .cse34 .cse31 .cse39 .cse17 .cse50) (or .cse1 .cse2 .cse14 .cse15 .cse24 .cse21 .cse0 .cse34 .cse5 .cse17 .cse18 .cse19 (and .cse7 .cse8 .cse9 .cse13 .cse37 .cse38 .cse25) .cse22 .cse23 .cse40) (or .cse0 .cse1 (and .cse7 .cse8 .cse9 .cse36 .cse10 .cse11 .cse12) .cse35 .cse3 .cse4 .cse5 .cse6 .cse14 .cse15 .cse16 .cse39 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse35 (and .cse7 .cse8 .cse9 .cse36 .cse11 .cse25) .cse4 .cse5 .cse14 .cse15 .cse39 .cse24 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23))))) [2018-11-18 16:18:05,091 INFO L421 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (let ((.cse20 (not (= 1 ~m_pc~0))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse27 (not (= |old(~token~0)| 0))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse29 (not (= 0 ~local~0))) (.cse30 (not (= 0 ~m_pc~0))) (.cse32 (= ~t1_pc~0 1))) (let ((.cse1 (< 0 ~t2_pc~0)) (.cse23 (not (= ~t1_pc~0 0))) (.cse10 (not (= 0 |old(~t2_st~0)|))) (.cse22 (not (= 2 ~E_2~0))) (.cse26 (not (= 0 ~t2_pc~0))) (.cse24 (not (= 0 |old(~t3_pc~0)|))) (.cse25 (not (= 2 |old(~E_M~0)|))) (.cse4 (< |old(~t1_st~0)| 2)) (.cse8 (not .cse32)) (.cse16 (< ~local~0 |old(~token~0)|)) (.cse18 (< |old(~token~0)| ~local~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse5 (< |old(~E_M~0)| 2)) (.cse6 (< ~E_1~0 2)) (.cse7 (and (or .cse20 .cse17) (or .cse27 .cse28 .cse29 .cse30))) (.cse14 (< |old(~t2_st~0)| 2)) (.cse15 (not (= 1 ~t2_pc~0))) (.cse9 (not (= ~m_i~0 1))) (.cse11 (< ~E_3~0 2)) (.cse12 (< ~E_2~0 2)) (.cse13 (< 0 |old(~t3_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse11 .cse12 .cse13) (or .cse6 .cse0 .cse1 .cse16 .cse17 .cse8 .cse18 .cse2 .cse3 .cse19 .cse9 .cse10 .cse11 .cse20 .cse5 .cse12 .cse13) (let ((.cse21 (+ ~local~0 1))) (or .cse6 .cse0 .cse17 .cse8 .cse2 .cse3 .cse15 .cse4 (< |old(~token~0)| .cse21) .cse9 .cse10 .cse11 .cse20 .cse5 .cse12 .cse13 (< .cse21 |old(~token~0)|))) (or .cse0 .cse22 .cse17 .cse2 .cse3 .cse19 .cse23 .cse6 .cse24 .cse25 .cse9 .cse10 .cse11 .cse20 .cse26) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse9 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 2 ~M_E~0)) (or .cse27 .cse23 .cse28 .cse10 .cse22 .cse29 .cse26 .cse24 .cse30 .cse25 .cse19)) (let ((.cse31 (+ ~local~0 2))) (or .cse4 .cse14 (or .cse6 .cse0 .cse17 .cse8 .cse2 (not (= 1 |old(~t3_pc~0)|)) .cse3 .cse15 .cse9 .cse11 .cse20 .cse12) (and (= 1 ~t3_pc~0) (not (= ~E_M~0 0)) (<= |old(~t3_st~0)| ~t3_st~0) (<= |old(~t2_st~0)| ~t2_st~0) (<= ~token~0 (+ ~local~0 3)) (= ~m_st~0 2) (<= (+ |old(~token~0)| 1) ~token~0) (<= |old(~t1_st~0)| ~t1_st~0)) .cse5 (< .cse31 |old(~token~0)|) (< |old(~token~0)| .cse31))) (or .cse6 .cse0 .cse14 .cse16 .cse17 .cse18 .cse2 .cse3 .cse19 .cse15 .cse9 .cse11 .cse20 .cse5 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse19 .cse5 .cse6 .cse7 .cse14 .cse32 .cse15 .cse9 .cse11 .cse12 .cse13)))) [2018-11-18 16:18:05,091 INFO L425 ceAbstractionStarter]: For program point L183-1(line 183) no Hoare annotation was computed. [2018-11-18 16:18:05,091 INFO L425 ceAbstractionStarter]: For program point transmit3EXIT(lines 158 193) no Hoare annotation was computed. [2018-11-18 16:18:05,091 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 186) no Hoare annotation was computed. [2018-11-18 16:18:05,092 INFO L421 ceAbstractionStarter]: At program point L173-2(lines 161 192) the Hoare annotation is: (let ((.cse55 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~T2_E~0 0)) (.cse54 (= ~t1_pc~0 1)) (.cse56 (= ~m_i~0 1)) (.cse13 (= ~T3_E~0 0)) (.cse7 (= ~T1_E~0 0)) (.cse48 (= 0 |old(~m_st~0)|)) (.cse30 (= 1 ~m_pc~0))) (let ((.cse19 (not .cse30)) (.cse10 (not (= 2 |old(~m_st~0)|))) (.cse50 (not (= |old(~token~0)| 0))) (.cse51 (not .cse48)) (.cse52 (not (= 0 ~local~0))) (.cse53 (not (= 0 ~m_pc~0))) (.cse49 (and .cse55 (not .cse14) .cse54 .cse56 (not (= ~E_M~0 0)) (not (= ~m_st~0 0)) (not .cse13) (not .cse7) .cse30 (not (= ~E_3~0 0)) (not (= ~E_2~0 0)))) (.cse2 (= 0 ~t2_st~0))) (let ((.cse3 (= ~m_st~0 2)) (.cse8 (< 0 ~t2_pc~0)) (.cse45 (and .cse49 (<= 2 ~E_1~0) .cse2)) (.cse4 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse12 (< |old(~token~0)| ~local~0)) (.cse47 (not (= 2 ~E_3~0))) (.cse41 (= ~t3_pc~0 0)) (.cse40 (= ~E_M~0 2)) (.cse42 (= ~t1_st~0 0)) (.cse43 (= ~t2_st~0 0)) (.cse37 (not (= ~t1_pc~0 0))) (.cse17 (not (= 0 |old(~t2_st~0)|))) (.cse36 (not (= 2 ~E_2~0))) (.cse44 (not (= 0 ~t2_pc~0))) (.cse38 (not (= 0 |old(~t3_pc~0)|))) (.cse39 (not (= 2 |old(~E_M~0)|))) (.cse1 (= 0 ~t1_st~0)) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse28 (< |old(~t1_st~0)| 2)) (.cse20 (< |old(~E_M~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse29 (and (or .cse19 .cse10) (or .cse50 .cse51 .cse52 .cse53))) (.cse31 (< |old(~t2_st~0)| 2)) (.cse11 (not .cse54)) (.cse32 (not (= 1 ~t2_pc~0))) (.cse16 (not .cse56)) (.cse18 (< ~E_3~0 2)) (.cse21 (< ~E_2~0 2)) (.cse22 (< 0 |old(~t3_pc~0)|)) (.cse23 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse33 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse24 (<= ~t3_pc~0 0)) (.cse25 (= 0 ~m_st~0)) (.cse26 (= ~token~0 0)) (.cse27 (<= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 (and (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse7 (and .cse23 .cse5 .cse2 .cse24 .cse25 .cse26 .cse27) .cse8 .cse13 .cse14 .cse28 .cse20 .cse0 .cse29 .cse11 .cse16 .cse17 .cse18 .cse21 .cse22 .cse30) (or .cse0 .cse7 .cse31 .cse10 .cse11 .cse13 .cse14 .cse32 .cse28 .cse16 .cse18 (and .cse33 .cse3 .cse5 .cse27) .cse19 .cse20 .cse21 .cse22) (let ((.cse34 (<= 2 ~E_M~0)) (.cse35 (+ ~local~0 2))) (or .cse28 (and (= 1 ~t3_pc~0) .cse34 .cse33 (<= ~token~0 (+ ~local~0 3)) (<= (+ |old(~token~0)| 1) ~token~0) .cse25 .cse27) .cse31 (or .cse0 .cse7 .cse10 .cse11 .cse13 (not (= 1 |old(~t3_pc~0)|)) .cse14 .cse32 .cse16 .cse18 .cse19 .cse21) .cse20 (< .cse35 |old(~token~0)|) (and .cse34 .cse3 .cse33 .cse27) (< |old(~token~0)| .cse35))) (or .cse7 .cse36 .cse10 .cse13 .cse14 .cse15 .cse37 .cse0 .cse38 .cse39 .cse16 .cse17 .cse18 .cse19 (and .cse40 .cse41 .cse3 .cse42 .cse43) .cse44) (or .cse0 .cse7 .cse8 .cse10 .cse11 .cse13 (and .cse5 .cse27 .cse45) .cse14 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse46 (+ ~local~0 1))) (or .cse0 .cse7 .cse10 .cse11 .cse13 .cse14 .cse32 .cse28 (< |old(~token~0)| .cse46) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< .cse46 |old(~token~0)|) (and (= ~token~0 |old(~token~0)|) .cse5 .cse27 .cse45))) (or .cse7 .cse36 .cse13 (not (= 2 |old(~t2_st~0)|)) .cse14 .cse15 .cse37 .cse47 .cse20 (and .cse41 (= ~t2_st~0 2) .cse23) .cse0 .cse29 .cse38 .cse32 .cse16 .cse48) (or .cse0 .cse7 .cse31 (and .cse33 (and .cse1 .cse49) .cse4 .cse5 .cse6) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse47 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and .cse25 .cse41 .cse23 .cse40 .cse42 .cse43 .cse26) (not (= 1 ~t3_i~0)) .cse16 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 2 ~M_E~0)) (or .cse50 .cse37 .cse51 .cse17 .cse36 .cse52 .cse44 .cse38 .cse53 .cse39 .cse15)) (or .cse7 (and .cse23 .cse5 .cse33 .cse1 .cse24 .cse25 .cse26) .cse13 .cse14 .cse15 .cse20 .cse0 .cse29 .cse31 .cse54 .cse32 .cse16 .cse18 .cse21 .cse22 .cse30) (or .cse0 .cse7 (and .cse33 (and .cse1 .cse55) .cse5) .cse31 .cse10 .cse13 .cse54 .cse14 .cse15 .cse32 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse7 .cse13 .cse14 .cse28 .cse20 .cse0 .cse29 .cse31 .cse11 .cse32 .cse16 .cse18 .cse21 .cse22 (and .cse23 .cse5 .cse33 .cse24 .cse25 .cse26 .cse27) .cse30))))) [2018-11-18 16:18:05,092 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2018-11-18 16:18:05,093 INFO L421 ceAbstractionStarter]: At program point L151(lines 122 157) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse34 (= 0 |old(~m_st~0)|))) (let ((.cse16 (not (= 1 ~t3_pc~0))) (.cse46 (not (= ~t1_pc~0 0))) (.cse49 (not (= 2 ~E_M~0))) (.cse5 (= ~m_st~0 2)) (.cse21 (not (= 1 ~m_pc~0))) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse51 (not .cse34)) (.cse45 (not (= 2 ~E_2~0))) (.cse12 (not .cse29)) (.cse50 (not (= 0 |old(~t2_pc~0)|))) (.cse48 (not (= 0 ~t3_pc~0))) (.cse43 (not (= 0 |old(~t3_st~0)|))) (.cse52 (not (= 0 ~m_pc~0)))) (let ((.cse33 (not (= 2 ~E_1~0))) (.cse10 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse39 (not (= 1 |old(~t2_pc~0)|))) (.cse40 (<= 2 ~E_3~0)) (.cse30 (= ~t1_st~0 2)) (.cse32 (let ((.cse53 (not (= |old(~t1_st~0)| 2)))) (and (or .cse53 .cse21 .cse45 .cse11 .cse12 .cse50 .cse48 .cse43) (or .cse51 .cse53 .cse45 .cse12 .cse50 .cse48 .cse43 .cse52)))) (.cse35 (and (= ~t3_st~0 2) .cse5)) (.cse25 (or (not (= |old(~token~0)| 0)) .cse51 (not (= 0 ~local~0)) .cse52)) (.cse6 (= 0 ~t1_st~0)) (.cse26 (= 0 ~m_st~0)) (.cse27 (= ~token~0 0)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse36 (and (or .cse46 .cse45 .cse16 .cse50 .cse49) (or .cse46 .cse45 .cse50 .cse48 .cse49))) (.cse47 (not (= 2 |old(~E_3~0)|))) (.cse37 (and (or .cse21 .cse11 .cse43) (or (not (= 2 |old(~t3_st~0)|)) .cse21 .cse11))) (.cse42 (= 0 ~t3_st~0)) (.cse31 (= ~t2_st~0 2)) (.cse44 (< 0 ~t3_pc~0)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse9 (< 0 |old(~t2_pc~0)|)) (.cse14 (= ~T3_E~0 0)) (.cse15 (< |old(~t3_st~0)| 2)) (.cse17 (= ~T2_E~0 0)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (< |old(~E_3~0)| 2)) (.cse22 (< ~E_M~0 2)) (.cse23 (< ~E_2~0 2)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse8 (<= |old(~E_3~0)| ~E_3~0)) (.cse28 (<= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse9 .cse14 .cse17 .cse24 .cse22 .cse0 .cse25 .cse12 .cse16 .cse15 .cse19 .cse20 .cse23 (and .cse2 .cse3 .cse7 .cse8 .cse26 .cse27 .cse28)) (or .cse0 .cse1 .cse9 .cse11 .cse14 .cse29 (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse14 (and .cse30 .cse31) .cse17 .cse22 .cse32 .cse19 .cse20 .cse33 .cse34) (or .cse0 .cse1 .cse35 .cse14 .cse15 .cse16 .cse17 .cse18 .cse36 .cse19 .cse20 .cse37) (let ((.cse38 (+ ~local~0 1))) (or .cse24 (< |old(~token~0)| .cse38) (or .cse0 .cse1 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse39 .cse19 .cse20 .cse21 .cse23) .cse22 (let ((.cse41 (+ ~local~0 2))) (and .cse40 .cse2 (<= ~token~0 .cse41) .cse5 .cse42 .cse7 (<= .cse41 ~token~0) .cse28)) (< .cse38 |old(~token~0)|) (and .cse40 .cse2 .cse3 .cse5 .cse7 .cse28))) (or .cse0 .cse1 .cse9 .cse11 .cse12 .cse14 .cse17 .cse43 .cse24 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44 (and .cse2 .cse5 .cse42 .cse7 .cse8 .cse28)) (or .cse45 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse18 .cse46 .cse47 (not (= 1 ~t1_i~0)) .cse25 (not (= ~T2_E~0 2)) .cse43 .cse48 .cse49 (not (= 1 ~t3_i~0)) (and .cse2 .cse6 .cse42 .cse7 .cse8 .cse26 .cse27) .cse19 .cse33 (not (= 1 ~t2_i~0)) .cse50 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse43 (and .cse2 .cse4 .cse5 .cse6 .cse42 .cse7 .cse8) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44) (or .cse24 (or .cse0 .cse1 .cse11 .cse12 .cse14 .cse17 .cse39 .cse19 .cse20 .cse21 .cse23 .cse44) .cse22 .cse43 (and .cse40 .cse2 .cse5 .cse42 .cse7 .cse28)) (or .cse1 .cse14 .cse17 (and .cse2 .cse30 .cse42 .cse31 .cse8 .cse26 .cse27) .cse22 .cse0 .cse25 .cse32 .cse19 .cse20) (or .cse0 .cse1 .cse9 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19 .cse20 .cse22 .cse37 .cse23 .cse35) (or .cse1 .cse9 .cse14 .cse17 .cse18 .cse22 .cse0 .cse25 .cse29 .cse16 .cse15 .cse19 .cse20 (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse26 .cse27) .cse23) (or .cse1 .cse14 .cse17 .cse18 .cse36 .cse47 .cse37 .cse0 (and (= ~E_3~0 2) .cse2 .cse5 .cse42 .cse31 (= ~t1_st~0 0)) .cse43 .cse19 .cse44) (or .cse0 .cse1 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse28)))))) [2018-11-18 16:18:05,093 INFO L421 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (let ((.cse19 (not (= 1 ~m_pc~0))) (.cse10 (not (= 2 |old(~m_st~0)|)))) (let ((.cse25 (= ~t1_pc~0 1)) (.cse34 (or .cse19 .cse10))) (let ((.cse1 (= ~t2_pc~0 1)) (.cse3 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse4 (= ~m_st~0 2)) (.cse5 (not (= ~E_3~0 0))) (.cse6 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (not (= 1 |old(~t2_pc~0)|))) (.cse28 (not (= ~t1_pc~0 0))) (.cse33 (not (= 2 |old(~E_3~0)|))) (.cse32 (not (= 2 ~E_M~0))) (.cse14 (not (= 1 ~t3_pc~0))) (.cse13 (< |old(~t3_st~0)| 2)) (.cse26 (< ~local~0 |old(~token~0)|)) (.cse27 (< |old(~token~0)| ~local~0)) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse34 (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0))))) (.cse29 (not (= 2 ~E_2~0))) (.cse30 (not (= 0 |old(~t2_pc~0)|))) (.cse31 (not (= 0 ~t3_pc~0))) (.cse8 (< ~E_1~0 2)) (.cse9 (= ~T1_E~0 0)) (.cse22 (< 0 |old(~t2_pc~0)|)) (.cse11 (not .cse25)) (.cse12 (= ~T3_E~0 0)) (.cse15 (= ~T2_E~0 0)) (.cse35 (not (= 0 |old(~t3_st~0)|))) (.cse0 (< |old(~t1_st~0)| 2)) (.cse17 (not (= ~m_i~0 1))) (.cse18 (< |old(~E_3~0)| 2)) (.cse21 (< ~E_M~0 2)) (.cse20 (< ~E_2~0 2)) (.cse36 (< 0 ~t3_pc~0))) (and (let ((.cse7 (+ ~local~0 1))) (or .cse0 (let ((.cse2 (+ ~local~0 2))) (and .cse1 (<= |old(~t3_st~0)| ~t3_st~0) (<= ~token~0 .cse2) .cse3 .cse4 .cse5 (<= .cse2 ~token~0) .cse6)) (< |old(~token~0)| .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 (< .cse7 |old(~token~0)|))) (or .cse9 .cse22 .cse12 .cse15 .cse23 .cse21 .cse8 .cse24 .cse25 .cse14 .cse13 .cse17 .cse18 .cse20) (or .cse8 .cse9 .cse22 .cse26 .cse10 .cse27 .cse12 .cse13 .cse14 .cse15 .cse23 .cse17 .cse18 .cse19 .cse21 .cse20) (or .cse9 .cse12 .cse15 .cse23 (or .cse28 .cse29 .cse30 .cse31 .cse32) .cse33 .cse34 .cse8 .cse35 .cse17) (or (and .cse1 .cse3 .cse4 (= 0 ~t3_st~0) .cse5 .cse6) .cse0 (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse36) .cse21 .cse35) (or .cse29 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse23 .cse28 .cse33 (not (= 1 ~t1_i~0)) .cse24 (not (= ~T2_E~0 2)) .cse35 .cse31 .cse32 (not (= 1 ~t3_i~0)) .cse17 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse30 (not (= 2 ~M_E~0))) (or .cse9 .cse22 .cse12 .cse15 .cse0 .cse21 .cse8 .cse24 .cse11 .cse14 .cse13 .cse17 .cse18 .cse20) (or .cse8 .cse9 .cse22 .cse26 .cse10 .cse11 .cse27 .cse12 .cse15 .cse35 .cse23 .cse17 .cse18 .cse19 .cse21 .cse20 .cse36) (or .cse9 .cse12 .cse15 .cse21 .cse8 .cse24 (or (not (= |old(~t1_st~0)| 2)) .cse29 .cse11 .cse30 .cse31 .cse35) .cse17 .cse18) (or .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse15 .cse35 .cse0 .cse17 .cse18 .cse19 .cse21 .cse20 .cse36))))) [2018-11-18 16:18:05,093 INFO L425 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2018-11-18 16:18:05,093 INFO L425 ceAbstractionStarter]: For program point transmit2EXIT(lines 122 157) no Hoare annotation was computed. [2018-11-18 16:18:05,093 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 150) no Hoare annotation was computed. [2018-11-18 16:18:05,094 INFO L421 ceAbstractionStarter]: At program point L137-2(lines 125 156) the Hoare annotation is: (let ((.cse59 (= 1 ~m_pc~0)) (.cse53 (= 0 |old(~m_st~0)|)) (.cse46 (= ~t1_pc~0 1))) (let ((.cse24 (not .cse46)) (.cse56 (not .cse53)) (.cse57 (not (= 0 ~m_pc~0))) (.cse2 (= ~T2_E~0 0)) (.cse54 (= ~m_i~0 1)) (.cse18 (= ~m_st~0 2)) (.cse1 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse34 (not (= 0 |old(~t3_st~0)|))) (.cse28 (not .cse59)) (.cse23 (not (= 2 |old(~m_st~0)|))) (.cse26 (not (= 1 ~t3_pc~0))) (.cse48 (not (= ~t1_pc~0 0))) (.cse47 (not (= 2 ~E_2~0))) (.cse52 (not (= 0 |old(~t2_pc~0)|))) (.cse49 (not (= 0 ~t3_pc~0))) (.cse50 (not (= 2 ~E_M~0))) (.cse58 (= ~m_st~0 |old(~m_st~0)|)) (.cse43 (= 0 ~t1_st~0))) (let ((.cse41 (< ~local~0 |old(~token~0)|)) (.cse42 (< |old(~token~0)| ~local~0)) (.cse40 (and .cse58 .cse43)) (.cse45 (= ~t3_st~0 2)) (.cse31 (and (or .cse48 .cse47 .cse26 .cse52 .cse50) (or .cse48 .cse47 .cse52 .cse49 .cse50))) (.cse33 (and (or .cse28 .cse23 .cse34) (or (not (= 2 |old(~t3_st~0)|)) .cse28 .cse23))) (.cse38 (< 0 |old(~t2_pc~0)|)) (.cse25 (< |old(~t3_st~0)| 2)) (.cse39 (<= ~t2_pc~0 0)) (.cse21 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse5 (<= |old(~E_3~0)| ~E_3~0)) (.cse7 (= 0 ~m_st~0)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse10 (< ~E_1~0 2)) (.cse27 (not (= 1 |old(~t2_pc~0)|))) (.cse29 (< ~E_2~0 2)) (.cse37 (< 0 ~t3_pc~0)) (.cse44 (and .cse58 (not .cse2) .cse46 .cse54 (not (= ~E_M~0 0)) .cse18 (not .cse1) (not .cse0) (<= ~t3_pc~0 0) (<= 2 ~E_2~0) .cse59 (<= 2 ~E_1~0))) (.cse16 (<= 2 ~E_3~0)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse35 (= ~E_3~0 2)) (.cse3 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (= 0 ~t3_st~0)) (.cse36 (= ~t1_st~0 0)) (.cse8 (= ~token~0 0)) (.cse32 (not (= 2 |old(~E_3~0)|))) (.cse11 (or (not (= |old(~token~0)| 0)) .cse56 (not (= 0 ~local~0)) .cse57)) (.cse9 (< ~E_M~0 2)) (.cse6 (= ~t2_pc~0 0)) (.cse4 (= ~t1_st~0 2)) (.cse12 (let ((.cse55 (not (= |old(~t1_st~0)| 2)))) (and (or .cse55 .cse28 .cse47 .cse23 .cse24 .cse52 .cse49 .cse34) (or .cse56 .cse55 .cse47 .cse24 .cse52 .cse49 .cse34 .cse57)))) (.cse13 (not .cse54)) (.cse14 (< |old(~E_3~0)| 2)) (.cse51 (not (= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 (= ~t3_st~0 0) .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse22 (+ ~local~0 1))) (or .cse15 (let ((.cse17 (+ ~local~0 2))) (and .cse16 (<= ~token~0 .cse17) .cse3 .cse18 .cse19 (<= .cse17 ~token~0) .cse20)) (and .cse16 .cse21 .cse3 .cse18 .cse20) (< |old(~token~0)| .cse22) (or .cse10 .cse0 .cse23 .cse24 .cse1 .cse25 .cse26 .cse2 .cse27 .cse13 .cse14 .cse28 .cse29) .cse9 (< .cse22 |old(~token~0)|))) (or .cse0 .cse1 .cse2 .cse30 .cse31 .cse32 .cse33 .cse10 .cse34 .cse13 (and .cse35 .cse3 .cse18 .cse19 .cse6 .cse36) .cse37) (or .cse10 .cse0 .cse38 .cse23 .cse24 .cse1 .cse25 .cse26 .cse2 .cse15 .cse13 .cse14 .cse28 (and .cse39 .cse21 .cse3 .cse18 .cse5 .cse20) .cse9 .cse29) (or .cse10 (and .cse3 .cse39 .cse19 .cse5 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse40) .cse0 .cse38 .cse41 .cse23 .cse24 .cse42 .cse1 .cse2 .cse34 .cse30 .cse13 .cse14 .cse28 .cse9 .cse29 .cse37) (or .cse10 .cse0 .cse38 .cse41 .cse23 .cse24 .cse42 .cse1 .cse25 .cse26 .cse2 .cse30 (and .cse39 .cse21 .cse3 (= ~token~0 |old(~token~0)|) .cse18 .cse43 .cse5) .cse13 .cse14 .cse28 .cse9 .cse29) (or .cse10 .cse0 (and .cse44 .cse5 .cse3 .cse39 .cse20 .cse19) .cse38 .cse23 .cse24 .cse1 .cse2 .cse34 .cse15 .cse13 .cse14 .cse28 .cse9 .cse29 .cse37) (or .cse10 .cse0 .cse38 .cse24 .cse45 .cse1 .cse25 .cse26 .cse2 .cse15 .cse13 .cse14 .cse9 .cse33 .cse29) (or .cse10 .cse0 .cse38 .cse23 .cse1 .cse46 .cse25 .cse26 .cse2 .cse30 .cse13 .cse14 .cse28 .cse9 .cse29 (and .cse5 .cse3 .cse21 .cse39 .cse40)) (or .cse10 .cse0 .cse1 .cse25 .cse26 .cse2 (and .cse45 .cse6) .cse30 .cse31 .cse13 .cse14 .cse33) (or .cse0 (and .cse3 .cse39 .cse5 (and .cse7 .cse43) .cse8 .cse21) .cse38 .cse1 .cse2 .cse30 .cse9 .cse10 .cse11 .cse46 .cse26 .cse25 .cse13 .cse14 .cse29) (or .cse0 .cse38 .cse1 .cse2 .cse15 .cse9 .cse10 .cse11 .cse24 .cse26 .cse25 .cse13 .cse14 (and .cse39 .cse21 .cse3 .cse5 .cse7 .cse8 .cse20) .cse29) (or .cse15 (or .cse10 .cse0 .cse23 .cse24 .cse1 .cse2 .cse27 .cse13 .cse14 .cse28 .cse29 .cse37) .cse9 (and .cse44 .cse16 .cse3 .cse20 .cse19) .cse34) (or .cse47 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse30 .cse48 (and .cse35 (= ~m_st~0 0) .cse3 .cse19 .cse6 .cse36 .cse8) .cse32 (not (= 1 ~t1_i~0)) .cse11 (not (= ~T2_E~0 2)) .cse34 .cse49 .cse50 (not (= 1 ~t3_i~0)) .cse13 .cse51 (not (= 1 ~t2_i~0)) .cse52 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse9 (and .cse6 .cse4) .cse12 .cse13 .cse14 .cse51 .cse53))))) [2018-11-18 16:18:05,094 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 133) no Hoare annotation was computed. [2018-11-18 16:18:05,094 INFO L421 ceAbstractionStarter]: At program point transmit2ENTRY(lines 122 157) the Hoare annotation is: (let ((.cse48 (= 0 |old(~m_st~0)|)) (.cse44 (= ~t1_pc~0 1))) (let ((.cse39 (not (= 1 ~t3_pc~0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse12 (not (= 2 ~E_M~0))) (.cse31 (not (= 1 ~m_pc~0))) (.cse25 (not (= 2 |old(~m_st~0)|))) (.cse0 (not (= 2 ~E_2~0))) (.cse26 (not .cse44)) (.cse15 (not (= 0 |old(~t2_pc~0)|))) (.cse11 (not (= 0 ~t3_pc~0))) (.cse10 (not (= 0 |old(~t3_st~0)|))) (.cse53 (not .cse48)) (.cse54 (not (= 0 ~m_pc~0))) (.cse46 (= ~t3_st~0 0))) (let ((.cse41 (or (= ~t3_st~0 2) .cse46)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse27 (< |old(~token~0)| ~local~0)) (.cse21 (= 0 ~t1_st~0)) (.cse37 (= 0 ~m_st~0)) (.cse6 (= ~token~0 0)) (.cse9 (or (not (= |old(~token~0)| 0)) .cse53 (not (= 0 ~local~0)) .cse54)) (.cse45 (= ~t1_st~0 2)) (.cse47 (let ((.cse52 (not (= |old(~t1_st~0)| 2)))) (and (or .cse52 .cse31 .cse0 .cse25 .cse26 .cse15 .cse11 .cse10) (or .cse53 .cse52 .cse0 .cse26 .cse15 .cse11 .cse10 .cse54)))) (.cse14 (not (= 2 ~E_1~0))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse42 (and (or .cse7 .cse0 .cse39 .cse15 .cse12) (or .cse7 .cse0 .cse15 .cse11 .cse12))) (.cse8 (not (= 2 |old(~E_3~0)|))) (.cse43 (and (or .cse31 .cse25 .cse10) (or (not (= 2 |old(~t3_st~0)|)) .cse31 .cse25))) (.cse3 (= 0 ~t3_st~0)) (.cse4 (= ~t2_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse34 (< 0 ~t3_pc~0)) (.cse49 (not (= 1 |old(~t2_pc~0)|))) (.cse50 (= ~t2_pc~0 1)) (.cse19 (= ~token~0 |old(~token~0)|)) (.cse16 (< ~E_1~0 2)) (.cse17 (= ~T1_E~0 0)) (.cse23 (< 0 |old(~t2_pc~0)|)) (.cse28 (= ~T3_E~0 0)) (.cse18 (<= ~t2_pc~0 0)) (.cse36 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse2 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse20 (= ~m_st~0 2)) (.cse22 (= |old(~E_3~0)| ~E_3~0)) (.cse38 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (< |old(~t3_st~0)| 2)) (.cse29 (= ~T2_E~0 0)) (.cse35 (< |old(~t1_st~0)| 2)) (.cse13 (not (= ~m_i~0 1))) (.cse30 (< |old(~E_3~0)| 2)) (.cse32 (< ~E_M~0 2)) (.cse33 (< ~E_2~0 2))) (and (or .cse0 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~E_3~0 2) (= ~m_st~0 0) .cse6) .cse7 .cse8 (not (= 1 ~t1_i~0)) .cse9 (not (= ~T2_E~0 2)) .cse10 .cse11 .cse12 (not (= 1 ~t3_i~0)) .cse13 .cse14 (not (= 1 ~t2_i~0)) .cse15 (not (= 2 ~M_E~0))) (or .cse16 .cse17 (and .cse18 .cse2 .cse19 .cse20 .cse21 .cse22 .cse3) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse10 .cse1 .cse13 .cse30 .cse31 .cse32 .cse33 .cse34) (or .cse17 .cse23 .cse28 .cse29 .cse35 .cse32 (and .cse18 .cse36 .cse2 .cse22 .cse37 .cse6 .cse38) .cse16 .cse9 .cse26 .cse39 .cse40 .cse13 .cse30 .cse33) (or .cse16 .cse17 .cse28 .cse40 .cse39 .cse29 (and .cse4 .cse41) .cse1 .cse42 .cse13 .cse30 .cse43) (or .cse16 .cse17 .cse23 .cse26 .cse28 .cse41 .cse40 .cse39 .cse29 .cse35 .cse13 .cse30 .cse32 .cse43 .cse33) (or .cse16 .cse17 .cse23 .cse25 .cse28 .cse44 .cse40 .cse39 .cse29 (and .cse18 .cse36 .cse2 .cse20 .cse21 .cse22) .cse1 .cse13 .cse30 .cse31 .cse32 .cse33) (or .cse16 .cse17 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse40 .cse39 .cse29 .cse1 .cse13 .cse30 .cse31 (and .cse18 .cse36 .cse2 .cse19 .cse20 .cse21 .cse22) .cse32 .cse33) (or .cse17 .cse23 .cse28 .cse29 .cse1 .cse32 (and .cse18 .cse36 .cse2 .cse21 .cse22 .cse37 .cse6) .cse16 .cse9 .cse44 .cse39 .cse40 .cse13 .cse30 .cse33) (or .cse17 (and .cse2 .cse22 .cse45 .cse46 .cse4 .cse37 .cse6) .cse28 .cse29 .cse32 .cse16 .cse9 .cse47 .cse13 .cse30) (or .cse17 .cse28 (and .cse45 .cse4) .cse29 .cse32 .cse47 .cse13 .cse30 .cse14 .cse48) (or .cse35 (or .cse16 .cse17 .cse25 .cse26 .cse28 .cse29 .cse49 .cse13 .cse30 .cse31 .cse33 .cse34) (and .cse50 .cse2 .cse20 .cse22 .cse3 .cse38) .cse32 .cse10) (or .cse16 .cse17 .cse23 .cse25 .cse26 .cse28 .cse29 .cse10 .cse35 .cse13 .cse30 .cse31 (and .cse18 .cse2 .cse20 .cse22 .cse3 .cse38) .cse32 .cse33 .cse34) (or .cse17 .cse28 .cse29 .cse1 .cse42 .cse8 .cse43 .cse16 .cse10 .cse13 (and .cse2 .cse20 .cse22 .cse3 .cse4 .cse5) .cse34) (let ((.cse51 (+ ~local~0 1))) (or .cse35 (< |old(~token~0)| .cse51) (or .cse16 .cse17 .cse25 .cse26 .cse28 .cse40 .cse39 .cse29 .cse49 .cse13 .cse30 .cse31 .cse33) .cse32 (< .cse51 |old(~token~0)|) (and .cse50 .cse36 .cse2 .cse19 .cse20 .cse22 .cse38))) (or .cse16 .cse17 .cse23 .cse25 .cse26 .cse28 (and .cse18 .cse36 .cse2 .cse20 .cse22 .cse38) .cse40 .cse39 .cse29 .cse35 .cse13 .cse30 .cse31 .cse32 .cse33))))) [2018-11-18 16:18:05,094 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-18 16:18:05,095 INFO L421 ceAbstractionStarter]: At program point L130(lines 125 156) the Hoare annotation is: (let ((.cse17 (not (= 1 ~m_pc~0))) (.cse15 (not (= 2 |old(~m_st~0)|)))) (let ((.cse8 (= ~t1_pc~0 1)) (.cse24 (or .cse17 .cse15))) (let ((.cse18 (not (= ~t1_pc~0 0))) (.cse23 (not (= 2 |old(~E_3~0)|))) (.cse22 (not (= 2 ~E_M~0))) (.cse14 (< ~local~0 |old(~token~0)|)) (.cse16 (< |old(~token~0)| ~local~0)) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse10 (< |old(~t3_st~0)| 2)) (.cse9 (not (= 1 ~t3_pc~0))) (.cse29 (not (= 1 |old(~t2_pc~0)|))) (.cse30 (= ~t2_pc~0 1)) (.cse31 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~m_st~0 2)) (.cse33 (= |old(~E_3~0)| ~E_3~0)) (.cse34 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (and .cse24 (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0))))) (.cse19 (not (= 2 ~E_2~0))) (.cse20 (not (= 0 |old(~t2_pc~0)|))) (.cse21 (not (= 0 ~t3_pc~0))) (.cse6 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< 0 |old(~t2_pc~0)|)) (.cse27 (not .cse8)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse25 (not (= 0 |old(~t3_st~0)|))) (.cse26 (< |old(~t1_st~0)| 2)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (< |old(~E_3~0)| 2)) (.cse5 (< ~E_M~0 2)) (.cse13 (< ~E_2~0 2)) (.cse28 (< 0 ~t3_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse10 .cse9 .cse3 .cse4 .cse11 .cse12 .cse17 .cse5 .cse13) (or .cse0 .cse2 .cse3 .cse4 (or .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24 .cse6 .cse25 .cse11) (or .cse19 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse4 .cse18 .cse23 (not (= 1 ~t1_i~0)) .cse7 (not (= ~T2_E~0 2)) .cse25 .cse21 .cse22 (not (= 1 ~t3_i~0)) .cse11 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse20 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse0 .cse1 .cse14 .cse15 .cse27 .cse16 .cse2 .cse3 .cse25 .cse4 .cse11 .cse12 .cse17 .cse5 .cse13 .cse28) (or .cse26 (or .cse6 .cse0 .cse15 .cse27 .cse2 .cse3 .cse29 .cse11 .cse12 .cse17 .cse13 .cse28) (and .cse30 .cse31 .cse32 .cse33 (= 0 ~t3_st~0) .cse34) .cse5 .cse25) (let ((.cse35 (+ ~local~0 1))) (or .cse26 (< |old(~token~0)| .cse35) (or .cse6 .cse0 .cse15 .cse27 .cse2 .cse10 .cse9 .cse3 .cse29 .cse11 .cse12 .cse17 .cse13) .cse5 (< .cse35 |old(~token~0)|) (and .cse30 (<= |old(~t3_st~0)| ~t3_st~0) .cse31 (= ~token~0 |old(~token~0)|) .cse32 .cse33 .cse34))) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 (or (not (= |old(~t1_st~0)| 2)) .cse19 .cse27 .cse20 .cse21 .cse25) .cse11 .cse12) (or .cse6 .cse0 .cse1 .cse15 .cse27 .cse2 .cse3 .cse25 .cse26 .cse11 .cse12 .cse17 .cse5 .cse13 .cse28))))) [2018-11-18 16:18:05,095 INFO L425 ceAbstractionStarter]: For program point L718(line 718) no Hoare annotation was computed. [2018-11-18 16:18:05,095 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 712 723) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (= |old(~m_i~0)| 1) (not (= |old(~T2_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (not (= ~m_i~0 1)) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 2 |old(~E_1~0)|)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,095 INFO L421 ceAbstractionStarter]: At program point L717(line 717) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (= |old(~m_i~0)| 1) (not (= |old(~T2_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (not (= ~m_i~0 1)) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 2 |old(~E_1~0)|)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,095 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 712 723) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L421 ceAbstractionStarter]: At program point L717-1(line 717) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (= |old(~m_i~0)| 1) (and (= ~m_i~0 1) (= ~t3_pc~0 0) (= ~t2_i~0 1) (= ~t1_i~0 1) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t3_i~0 1) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_1~0)|)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 712 723) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L428 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: true [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point L640-1(line 640) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L428 ceAbstractionStarter]: At program point L649(lines 638 651) the Hoare annotation is: true [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 634 652) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 634 652) the Hoare annotation is: true [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2018-11-18 16:18:05,096 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 634 652) no Hoare annotation was computed. [2018-11-18 16:18:05,097 INFO L421 ceAbstractionStarter]: At program point L247(lines 235 249) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse19 (= 0 ~m_st~0)) (.cse28 (= ~t1_pc~0 1))) (let ((.cse15 (< ~t3_st~0 2)) (.cse37 (= 0 ~E_3~0)) (.cse26 (not (= 2 ~m_st~0))) (.cse27 (= 0 ~E_2~0)) (.cse32 (not (= 2 ~E_2~0))) (.cse30 (not (= ~t1_pc~0 0))) (.cse29 (not (= 2 ~E_3~0))) (.cse35 (not (= 0 ~m_pc~0))) (.cse34 (not (= 0 ~t3_pc~0))) (.cse36 (not (= 2 ~E_M~0))) (.cse33 (not (= 0 ~t2_pc~0))) (.cse20 (< 0 ~t2_pc~0)) (.cse12 (< ~local~0 ~token~0)) (.cse13 (< ~token~0 ~local~0)) (.cse21 (not (= 0 ~t3_st~0))) (.cse11 (not (= ~t1_st~0 0))) (.cse22 (not (= 0 ~t2_st~0))) (.cse3 (< ~E_M~0 2)) (.cse7 (= 0 ~E_1~0)) (.cse23 (< 0 ~t3_pc~0)) (.cse25 (< ~E_1~0 2)) (.cse4 (= ~T1_E~0 0)) (.cse1 (< ~t2_st~0 2)) (.cse8 (not .cse28)) (.cse17 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse9 (= ~T3_E~0 0)) (.cse16 (not (= 1 ~t3_pc~0))) (.cse10 (= ~T2_E~0 0)) (.cse0 (not (= 1 ~t2_pc~0))) (.cse18 (< ~t1_st~0 2)) (.cse31 (not .cse19)) (.cse5 (not (= ~m_i~0 1))) (.cse2 (< ~E_3~0 2)) (.cse6 (not .cse24)) (.cse14 (< ~E_2~0 2)) (.cse39 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse4 .cse1 .cse8 .cse9 .cse15 .cse16 .cse10 .cse0 .cse18 .cse5 .cse2 .cse3 .cse7 .cse14 .cse19 .cse17) (or .cse4 .cse20 .cse8 .cse9 .cse10 .cse21 .cse18 .cse5 .cse22 .cse2 .cse3 .cse7 .cse14 .cse23 .cse19 .cse24 .cse17) (or .cse25 .cse4 .cse20 .cse26 .cse8 .cse9 .cse15 .cse16 .cse10 .cse5 .cse17 .cse22 .cse2 .cse6 .cse3 .cse27) (or .cse4 .cse20 .cse9 .cse17 .cse28 .cse15 .cse16 .cse10 .cse11 .cse5 .cse22 .cse2 .cse3 .cse7 .cse14 .cse19 .cse24) (or .cse17 (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse5 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse29 .cse21) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse30 .cse31 .cse22 .cse32 (not (= 0 ~local~0)) .cse33 .cse34 .cse35 .cse36 .cse11)) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse17) (or .cse4 .cse20 .cse8 .cse9 .cse15 .cse16 .cse10 .cse17 .cse18 .cse5 .cse22 .cse2 .cse3 .cse7 .cse14 .cse19 .cse24) (or .cse4 .cse1 .cse9 .cse28 .cse15 .cse16 .cse17 .cse10 .cse11 .cse0 .cse5 .cse2 .cse3 .cse7 .cse14 .cse19 .cse24) (or .cse4 .cse20 .cse12 .cse13 .cse9 .cse15 .cse16 .cse10 .cse17 .cse11 .cse5 .cse22 .cse2 .cse3 .cse7 .cse14 .cse19 .cse24) (let ((.cse38 (+ ~local~0 2))) (or .cse25 .cse4 .cse37 .cse26 (< .cse38 ~token~0) .cse8 .cse9 .cse15 .cse16 .cse10 .cse0 .cse18 .cse5 .cse6 .cse3 .cse14 .cse17 (< ~token~0 .cse38))) (or .cse4 .cse1 .cse8 .cse9 .cse17 .cse10 .cse21 .cse0 .cse18 .cse5 .cse2 .cse3 .cse7 .cse14 .cse23 .cse19 .cse24) (or .cse4 .cse1 .cse12 .cse8 .cse13 .cse9 .cse15 .cse16 .cse10 .cse17 .cse11 .cse0 .cse5 .cse2 .cse3 .cse7 .cse14 .cse19) (or .cse17 .cse25 .cse4 .cse1 .cse26 .cse8 .cse9 .cse16 .cse10 .cse0 .cse18 .cse5 .cse2 .cse6 .cse14 .cse39) (or .cse4 .cse1 .cse9 .cse28 .cse17 .cse10 .cse21 .cse11 .cse0 .cse5 .cse2 .cse3 .cse7 .cse14 .cse23 .cse19 .cse24) (or .cse17 .cse4 .cse1 .cse12 .cse13 .cse9 .cse10 .cse21 .cse11 .cse0 .cse5 .cse2 .cse3 .cse7 .cse14 .cse23 .cse19 .cse24) (or .cse25 .cse4 .cse37 .cse26 .cse8 .cse9 .cse10 .cse21 .cse17 .cse0 .cse18 .cse5 .cse6 .cse3 .cse14 .cse23) (or .cse25 .cse4 .cse20 .cse26 .cse8 .cse9 .cse10 .cse21 .cse17 .cse5 .cse22 .cse2 .cse6 .cse3 .cse23 .cse27) (or .cse4 .cse32 .cse9 .cse10 .cse11 .cse30 .cse17 .cse29 .cse35 .cse21 .cse34 .cse36 (not (= 1 ~E_1~0)) .cse5 .cse22 .cse19 .cse33) (or .cse4 .cse20 .cse12 .cse8 .cse13 .cse9 .cse17 .cse10 .cse21 .cse11 .cse5 .cse22 .cse2 .cse3 .cse7 .cse14 .cse23 .cse19 .cse24) (let ((.cse40 (+ ~local~0 3))) (or .cse25 .cse4 .cse1 .cse8 .cse17 .cse9 .cse16 .cse10 (< .cse40 ~token~0) .cse0 .cse18 .cse31 .cse5 .cse2 .cse6 .cse14 .cse39 (< ~token~0 .cse40)))))) [2018-11-18 16:18:05,097 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 232 250) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 245) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 245) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L428 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 232 250) the Hoare annotation is: true [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 232 250) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 415 462) the Hoare annotation is: (let ((.cse16 (= |old(~T1_E~0)| ~T1_E~0))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~T3_E~0)| 0)) (.cse5 (< ~t3_st~0 2)) (.cse6 (not (= 1 ~t3_pc~0))) (.cse7 (= |old(~T2_E~0)| 0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse17 (not (= 0 ~m_st~0))) (.cse10 (not (= ~m_i~0 1))) (.cse15 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) .cse16)) (.cse11 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 ~m_pc~0))) (.cse13 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 (not (= 2 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~M_E~0 2) (= ~T2_E~0 2) .cse16 (= ~E_3~0 2) (= ~E_1~0 2) (= ~E_M~0 2) (= ~T3_E~0 2) (= ~E_2~0 2)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) .cse10 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 ~t3_st~0))) (not (= 2 |old(~M_E~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse17 (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_2~0)|)) (not (= 0 ~local~0)) (not (= 0 ~t2_pc~0)) (not (= 0 ~t3_pc~0)) (not (= 0 ~m_pc~0)) (not (= 2 |old(~E_M~0)|)) (not (= ~t1_st~0 0)))) (let ((.cse18 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse18 ~token~0) .cse8 .cse9 .cse17 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14 (< ~token~0 .cse18)))))) [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L434-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L449-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,099 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 415 462) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 415 462) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L425 ceAbstractionStarter]: For program point L419-1(lines 418 461) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 194 212) no Hoare annotation was computed. [2018-11-18 16:18:05,100 INFO L421 ceAbstractionStarter]: At program point L209(lines 197 211) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse42 (+ ~local~0 1)) (.cse29 (= ~t1_pc~0 1)) (.cse28 (= 0 ~m_st~0))) (let ((.cse5 (not .cse28)) (.cse7 (not (= 2 ~E_2~0))) (.cse4 (not (= ~t1_pc~0 0))) (.cse2 (not (= 2 ~E_3~0))) (.cse10 (not (= 0 ~m_pc~0))) (.cse9 (not (= 0 ~t3_pc~0))) (.cse11 (not (= 2 ~E_M~0))) (.cse8 (not (= 0 ~t2_pc~0))) (.cse15 (< ~local~0 ~token~0)) (.cse17 (< ~token~0 ~local~0)) (.cse3 (not (= 0 ~t3_st~0))) (.cse36 (< 0 ~t3_pc~0)) (.cse31 (< 0 ~t2_pc~0)) (.cse12 (not (= ~t1_st~0 0))) (.cse6 (not (= 0 ~t2_st~0))) (.cse26 (= 0 ~E_1~0)) (.cse33 (= 0 ~E_3~0)) (.cse23 (< ~t1_st~0 2)) (.cse27 (< ~E_2~0 2)) (.cse32 (< ~E_1~0 2)) (.cse13 (= ~T1_E~0 0)) (.cse14 (< ~t2_st~0 2)) (.cse34 (not (= 2 ~m_st~0))) (.cse16 (not .cse29)) (.cse18 (= ~T3_E~0 0)) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse19 (< ~t3_st~0 2)) (.cse20 (not (= 1 ~t3_pc~0))) (.cse21 (= ~T2_E~0 0)) (.cse22 (not (= 1 ~t2_pc~0))) (.cse39 (< ~token~0 .cse42)) (.cse1 (not (= ~m_i~0 1))) (.cse24 (< ~E_3~0 2)) (.cse35 (not .cse30)) (.cse25 (< ~E_M~0 2)) (.cse40 (< .cse42 ~token~0)) (.cse38 (= 0 ~E_2~0))) (and (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse0 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse1 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse2 .cse3) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse4 .cse5 .cse6 .cse7 (not (= 0 ~local~0)) .cse8 .cse9 .cse10 .cse11 .cse12)) (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse1 .cse24 .cse25 .cse26 .cse27 .cse28 .cse0) (or .cse13 .cse14 .cse18 .cse29 .cse19 .cse20 .cse21 .cse0 .cse12 .cse22 .cse1 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30) (or .cse13 .cse31 .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse1 .cse6 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30) (or .cse32 .cse13 .cse33 .cse34 .cse16 .cse18 .cse21 .cse3 .cse22 .cse23 .cse1 .cse35 .cse25 .cse0 .cse27 .cse36) (or .cse13 .cse31 .cse15 .cse16 .cse17 .cse18 .cse21 .cse3 .cse23 .cse1 .cse6 .cse24 .cse25 .cse26 .cse27 .cse36 .cse28 .cse0 .cse30) (let ((.cse37 (+ ~local~0 3))) (or .cse0 .cse32 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 (< .cse37 ~token~0) .cse22 .cse23 .cse5 .cse1 .cse24 .cse35 .cse25 .cse27 (< ~token~0 .cse37))) (or .cse13 .cse14 .cse18 .cse29 .cse21 .cse3 .cse12 .cse22 .cse0 .cse1 .cse24 .cse25 .cse26 .cse27 .cse36 .cse28 .cse30) (or .cse32 .cse13 .cse14 .cse34 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse0 .cse23 .cse1 .cse24 .cse35 .cse25 .cse27) (or .cse13 .cse7 .cse18 (= is_master_triggered_~__retres1~0 0) .cse21 .cse12 .cse4 .cse2 .cse10 .cse3 .cse9 .cse11 (not (= 1 ~E_1~0)) .cse1 .cse6 .cse28 .cse8) (or .cse32 .cse13 .cse31 .cse34 .cse16 .cse18 .cse21 .cse3 .cse1 .cse6 .cse24 .cse35 .cse25 .cse0 .cse36 .cse38) (or .cse32 .cse13 .cse31 .cse0 .cse34 .cse16 .cse18 .cse19 .cse20 .cse21 .cse1 .cse6 .cse24 .cse35 .cse25 .cse38) (or .cse32 .cse13 .cse14 .cse34 .cse16 .cse18 .cse21 .cse3 .cse22 .cse39 .cse1 .cse24 .cse35 .cse25 .cse36 .cse40 .cse38 .cse0) (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse3 .cse0 .cse22 .cse23 .cse1 .cse24 .cse25 .cse26 .cse27 .cse36 .cse28 .cse30) (or .cse0 .cse13 .cse31 .cse18 .cse29 .cse19 .cse20 .cse21 .cse12 .cse1 .cse6 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30) (let ((.cse41 (+ ~local~0 2))) (or .cse32 .cse13 .cse33 .cse34 (< .cse41 ~token~0) .cse16 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse1 .cse35 .cse25 .cse27 (< ~token~0 .cse41))) (or .cse32 .cse13 .cse14 .cse34 .cse16 .cse18 .cse0 .cse19 .cse20 .cse21 .cse22 .cse39 .cse1 .cse24 .cse35 .cse25 .cse40 .cse38)))) [2018-11-18 16:18:05,101 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 194 212) no Hoare annotation was computed. [2018-11-18 16:18:05,101 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 204) no Hoare annotation was computed. [2018-11-18 16:18:05,101 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 207) no Hoare annotation was computed. [2018-11-18 16:18:05,101 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 194 212) the Hoare annotation is: true [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L198-2(lines 198 207) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 574 621) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L603-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L608-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,103 INFO L425 ceAbstractionStarter]: For program point L598-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 574 621) the Hoare annotation is: (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~T3_E~0)| 0)) (.cse5 (< ~t3_st~0 2)) (.cse6 (not (= 1 ~t3_pc~0))) (.cse7 (= |old(~T2_E~0)| 0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse10 (not (= ~m_i~0 1))) (.cse15 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) (= |old(~T1_E~0)| ~T1_E~0))) (.cse11 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 ~m_pc~0))) (.cse13 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 (not (= 2 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse16 ~token~0) .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse15 .cse11 .cse12 .cse13 .cse14 (< ~token~0 .cse16))))) [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 577 620) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 574 621) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 549) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 511 553) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 541) no Hoare annotation was computed. [2018-11-18 16:18:05,104 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-18 16:18:05,105 INFO L421 ceAbstractionStarter]: At program point L537-2(lines 537 541) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse60 (+ ~local~0 1)) (.cse42 (= 0 ~t3_st~0)) (.cse47 (= ~t1_pc~0 1)) (.cse28 (= 0 |old(~m_st~0)|)) (.cse37 (= ~m_st~0 2)) (.cse61 (+ ~local~0 3)) (.cse21 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse20 (= 0 ~m_st~0)) (.cse22 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= activate_threads_~tmp___1~0 0))) (let ((.cse32 (and .cse21 .cse18 .cse20 .cse22 .cse23)) (.cse31 (< .cse61 ~token~0)) (.cse33 (< ~token~0 .cse61)) (.cse17 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse25 (<= 1 activate_threads_~tmp___0~0)) (.cse26 (= 0 ~t1_st~0)) (.cse39 (< 0 ~t2_pc~0)) (.cse27 (= 0 ~E_1~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse44 (= 0 ~E_3~0)) (.cse7 (< |old(~t3_st~0)| 2)) (.cse8 (not (= 1 ~t3_pc~0))) (.cse11 (< |old(~t1_st~0)| 2)) (.cse16 (< ~E_2~0 2)) (.cse3 (and .cse21 .cse18 .cse37 .cse22 .cse23)) (.cse49 (= activate_threads_~tmp___0~0 0)) (.cse29 (= activate_threads_~tmp~1 0)) (.cse52 (= ~t1_st~0 0)) (.cse53 (= ~t2_st~0 0)) (.cse54 (not (= 2 ~E_3~0))) (.cse51 (not (= ~t1_pc~0 0))) (.cse46 (not .cse28)) (.cse40 (not (= 0 |old(~t2_st~0)|))) (.cse50 (not (= 2 ~E_2~0))) (.cse58 (not (= 0 ~t2_pc~0))) (.cse56 (not (= 0 ~t3_pc~0))) (.cse55 (not (= 0 ~m_pc~0))) (.cse57 (not (= 2 ~E_M~0))) (.cse48 (not (= |old(~t1_st~0)| 0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse5 (not .cse47)) (.cse6 (= ~T3_E~0 0)) (.cse9 (= ~T2_E~0 0)) (.cse41 (not (= 0 |old(~t3_st~0)|))) (.cse38 (= 0 ~t2_st~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse45 (and .cse18 .cse37 .cse42 .cse22 .cse23)) (.cse34 (< ~token~0 .cse60)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (< ~E_3~0 2)) (.cse14 (not .cse30)) (.cse15 (< ~E_M~0 2)) (.cse43 (< 0 ~t3_pc~0)) (.cse35 (< .cse60 ~token~0)) (.cse36 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse17 (and .cse18 (or .cse19 .cse20) .cse21 .cse22 .cse23) .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse18 .cse25 .cse21 (or (and .cse19 .cse26) (and .cse26 .cse20)) .cse23) .cse11 .cse12 .cse13 .cse15 .cse27 .cse16 .cse28) (or .cse1 .cse2 .cse17 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (and .cse19 .cse29) .cse27 .cse16 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse3 (= 0 ~E_M~0) .cse32 .cse33) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse34 .cse12 .cse13 .cse14 .cse15 .cse35 .cse36 .cse3 (and .cse21 .cse37 .cse38 .cse22)) (or .cse0 .cse1 .cse39 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse40 .cse13 .cse14 .cse15 .cse36 (and .cse21 .cse37 .cse38 .cse22 .cse23)) (or .cse1 .cse39 .cse17 .cse5 .cse24 .cse6 .cse9 .cse41 .cse11 (and .cse19 .cse42 .cse38 .cse29 .cse22 .cse23) (and .cse19 .cse26 .cse42 .cse38 .cse29 .cse25 .cse23) .cse12 .cse40 .cse13 .cse15 .cse27 .cse16 .cse43 .cse28 .cse30) (or .cse0 .cse1 .cse44 .cse4 .cse5 .cse6 .cse9 .cse41 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse45 .cse43) (or .cse0 .cse32 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse10 .cse11 .cse46 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33) (or .cse1 .cse2 .cse17 .cse5 .cse24 .cse6 (and .cse19 .cse18 .cse42 .cse29 .cse22 .cse23) .cse9 .cse41 .cse10 .cse11 (and .cse19 .cse18 .cse26 .cse42 .cse29 .cse25 .cse23) .cse12 .cse13 .cse15 .cse27 .cse16 .cse43 .cse28 .cse30) (or .cse1 .cse2 .cse6 .cse47 .cse9 .cse41 .cse48 .cse10 .cse12 .cse13 .cse15 .cse27 .cse16 .cse43 .cse28 (and .cse49 .cse19 .cse18 .cse26 .cse42 .cse29 .cse23) .cse30) (or .cse1 .cse39 (and .cse21 .cse19 .cse38 .cse29 .cse22 .cse23) .cse17 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse40 .cse13 .cse15 .cse27 (and .cse21 .cse19 .cse26 .cse38 .cse29 .cse25 .cse23) .cse16 .cse28 .cse30) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 (= ~t3_st~0 2) .cse10 .cse11 .cse12 .cse13 .cse15 (or (not (= 2 |old(~t3_st~0)|)) .cse14 .cse4) .cse16) (or .cse1 .cse50 .cse6 .cse9 .cse48 .cse51 (and .cse49 .cse19 .cse42 .cse29 .cse52 .cse53 .cse23) .cse54 .cse55 .cse41 .cse56 .cse57 (not (= 1 ~E_1~0)) .cse12 .cse40 .cse28 .cse58) (or .cse0 .cse1 (and .cse37 .cse42 .cse38 .cse22 .cse23) .cse39 .cse4 .cse5 .cse6 .cse9 .cse41 .cse12 .cse40 .cse13 .cse14 .cse15 .cse43 .cse36) (or .cse1 (and .cse21 .cse49 .cse19 .cse18 .cse26 .cse29 .cse23) .cse2 .cse6 .cse47 .cse7 .cse8 .cse9 .cse48 .cse10 .cse12 .cse13 .cse15 .cse27 .cse16 .cse28 .cse30) (or .cse1 .cse39 .cse6 .cse47 .cse7 .cse8 .cse9 .cse48 .cse12 .cse40 .cse13 .cse15 .cse27 .cse16 .cse28 .cse30 (and .cse21 .cse49 .cse19 .cse29 .cse52 .cse53 .cse23)) (let ((.cse59 (+ ~local~0 2))) (or .cse0 .cse1 .cse44 .cse4 (< .cse59 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse3 (< ~token~0 .cse59))) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and .cse49 .cse29 .cse52 (= ~m_st~0 0) (= ~t3_st~0 0) .cse53 .cse23) (not (= 1 ~t3_i~0)) .cse12 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse54 .cse41) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse51 .cse46 .cse40 .cse50 (not (= 0 ~local~0)) .cse58 .cse56 .cse55 .cse57 .cse48)) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse9 .cse41 (and .cse37 .cse42 .cse38 .cse22) .cse10 .cse45 .cse34 .cse12 .cse13 .cse14 .cse15 .cse43 .cse35 .cse36)))) [2018-11-18 16:18:05,108 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2018-11-18 16:18:05,108 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-18 16:18:05,109 INFO L421 ceAbstractionStarter]: At program point L529-2(lines 529 533) the Hoare annotation is: (let ((.cse18 (= ~t1_pc~0 1)) (.cse29 (= 1 ~m_pc~0)) (.cse46 (= 0 ~t3_st~0)) (.cse28 (= 0 |old(~m_st~0)|)) (.cse59 (+ ~local~0 3)) (.cse58 (= 0 ~m_st~0)) (.cse60 (+ ~local~0 1)) (.cse20 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse23 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse56 (= ~m_st~0 2)) (.cse51 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse41 (not (= 2 ~E_2~0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse36 (not (= 2 ~E_3~0))) (.cse44 (not (= 0 ~m_pc~0))) (.cse43 (not (= 0 ~t3_pc~0))) (.cse45 (not (= 2 ~E_M~0))) (.cse42 (not (= 0 ~t2_pc~0))) (.cse9 (and .cse20 .cse23 .cse56 .cse51)) (.cse11 (< ~token~0 .cse60)) (.cse16 (< .cse60 ~token~0)) (.cse30 (and .cse20 .cse23 .cse58 .cse51)) (.cse31 (< .cse59 ~token~0)) (.cse39 (not .cse28)) (.cse33 (< ~token~0 .cse59)) (.cse54 (= 0 ~E_3~0)) (.cse57 (and .cse23 .cse56 .cse46 .cse51)) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse21 (= activate_threads_~tmp___0~0 0)) (.cse25 (= activate_threads_~tmp~1 0)) (.cse34 (= ~t1_st~0 0)) (.cse35 (= ~t2_st~0 0)) (.cse0 (< ~E_1~0 2)) (.cse52 (< 0 ~t2_pc~0)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse37 (not (= 0 |old(~t3_st~0)|))) (.cse53 (= 0 ~t2_st~0)) (.cse40 (not (= 0 |old(~t2_st~0)|))) (.cse14 (not .cse29)) (.cse47 (< 0 ~t3_pc~0)) (.cse17 (= 0 ~E_2~0)) (.cse50 (<= 1 activate_threads_~tmp___0~0)) (.cse24 (= 0 ~t1_st~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse48 (< ~local~0 ~token~0)) (.cse4 (not .cse18)) (.cse49 (< ~token~0 ~local~0)) (.cse5 (= ~T3_E~0 0)) (.cse6 (< |old(~t3_st~0)| 2)) (.cse7 (not (= 1 ~t3_pc~0))) (.cse8 (= ~T2_E~0 0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse32 (< |old(~t1_st~0)| 2)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (< ~E_3~0 2)) (.cse15 (< ~E_M~0 2)) (.cse26 (= 0 ~E_1~0)) (.cse27 (< ~E_2~0 2)) (.cse22 (= ~m_st~0 |old(~m_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse8 .cse19 .cse10 .cse12 .cse13 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse15 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse30 .cse31 .cse10 .cse32 .cse12 .cse13 .cse14 .cse27 (= 0 ~E_M~0) .cse9 .cse33) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse21 .cse25 .cse34 (= ~m_st~0 0) (= ~t3_st~0 0) .cse35) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse12 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse36 .cse37) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse38 .cse39 .cse40 .cse41 (not (= 0 ~local~0)) .cse42 .cse43 .cse44 .cse45 .cse19)) (or .cse1 .cse2 .cse5 .cse18 (and .cse21 .cse22 .cse23 .cse24 .cse46 .cse25) .cse8 .cse37 .cse19 .cse10 .cse12 .cse13 .cse15 .cse26 .cse27 .cse47 .cse28 .cse29) (or .cse1 .cse2 .cse48 .cse4 .cse49 .cse5 .cse8 .cse37 (and .cse22 .cse23 .cse24 .cse46 .cse25 .cse50) .cse10 .cse32 .cse12 .cse13 .cse15 .cse26 (and .cse22 .cse23 .cse46 .cse25 .cse51) .cse27 .cse47 .cse28 .cse29) (or .cse1 .cse52 .cse48 .cse4 .cse49 .cse5 (and .cse20 .cse22 .cse53 .cse25 .cse51) .cse6 .cse7 (and .cse20 .cse22 .cse24 .cse53 .cse25 .cse50) .cse8 .cse32 .cse12 .cse40 .cse13 .cse15 .cse26 .cse27 .cse28 .cse29) (or (and .cse22 .cse25) .cse1 .cse2 .cse48 .cse4 .cse49 .cse5 .cse6 .cse7 .cse8 .cse10 .cse32 .cse12 .cse13 .cse15 .cse26 .cse27 .cse28 .cse29) (or .cse1 .cse41 (and .cse21 .cse22 .cse46 .cse25 .cse34 .cse35) .cse5 .cse8 .cse19 .cse38 .cse36 .cse44 .cse37 .cse43 .cse45 (not (= 1 ~E_1~0)) .cse12 .cse40 .cse28 .cse42) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse32 .cse12 .cse13 .cse14 .cse15 .cse27) (let ((.cse55 (+ ~local~0 2))) (or .cse0 .cse1 .cse54 .cse3 (< .cse55 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse32 .cse9 .cse12 .cse14 .cse15 .cse27 (< ~token~0 .cse55))) (or .cse0 (and .cse20 .cse56 .cse53 .cse51) .cse1 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse40 .cse13 .cse14 .cse15 .cse17) (or .cse1 .cse52 .cse48 .cse4 .cse49 .cse5 .cse8 (and .cse22 .cse46 .cse53 .cse25 .cse51) .cse37 .cse32 .cse12 .cse40 .cse13 (and .cse22 .cse24 .cse46 .cse53 .cse25 .cse50) .cse15 .cse26 .cse27 .cse47 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse57 .cse4 .cse5 .cse8 .cse37 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse47 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 (= ~t3_st~0 2) .cse10 .cse32 .cse12 .cse13 .cse15 (or (not (= 2 |old(~t3_st~0)|)) .cse14 .cse3) .cse27) (or .cse0 .cse1 .cse2 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse31 .cse10 .cse32 .cse39 .cse12 .cse13 .cse14 .cse15 .cse27 .cse33) (or .cse0 .cse1 .cse54 .cse3 .cse4 .cse5 .cse8 .cse37 .cse10 .cse32 .cse12 .cse14 .cse15 .cse27 .cse47 .cse57) (or .cse1 .cse52 .cse5 .cse18 .cse6 .cse7 .cse8 .cse19 (and .cse20 .cse21 .cse22 .cse25 .cse34 .cse35) .cse12 .cse40 .cse13 .cse15 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse52 .cse3 .cse4 .cse5 .cse8 .cse37 .cse12 (and .cse56 .cse46 .cse53 .cse51) .cse40 .cse13 .cse14 .cse15 .cse47 .cse17) (or (and .cse23 .cse50 .cse20 (or (and .cse22 .cse24) (and .cse24 .cse58))) .cse1 .cse2 .cse48 .cse4 .cse49 .cse5 .cse6 .cse7 .cse8 .cse10 .cse32 .cse12 .cse13 .cse15 .cse26 .cse27 .cse28 (and .cse23 (or .cse22 .cse58) .cse20 .cse51))))) [2018-11-18 16:18:05,113 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 525) no Hoare annotation was computed. [2018-11-18 16:18:05,115 INFO L421 ceAbstractionStarter]: At program point L519(line 519) the Hoare annotation is: (let ((.cse39 (= 1 ~m_pc~0)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse54 (+ ~local~0 3)) (.cse38 (= ~t1_pc~0 1)) (.cse55 (+ ~local~0 1)) (.cse30 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse31 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse40 (= ~m_st~0 2)) (.cse15 (= 0 ~t3_st~0)) (.cse32 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse44 (= 0 ~t1_st~0)) (.cse45 (and .cse31 .cse40 .cse15 .cse32)) (.cse48 (= 0 ~E_3~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~t2_st~0 0)) (.cse6 (not (= 2 ~E_3~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse1 (not (= 2 ~E_2~0))) (.cse18 (not (= 0 ~t2_pc~0))) (.cse9 (not (= 0 ~t3_pc~0))) (.cse7 (not (= 0 ~m_pc~0))) (.cse10 (not (= 2 ~E_M~0))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse8 (not (= 0 |old(~t3_st~0)|))) (.cse42 (< 0 ~t3_pc~0)) (.cse37 (< 0 ~t2_pc~0)) (.cse33 (< ~local~0 ~token~0)) (.cse34 (< ~token~0 ~local~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= 0 ~t2_st~0)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse36 (= 0 ~E_1~0)) (.cse28 (not (= 2 |old(~m_st~0)|))) (.cse51 (and .cse30 .cse31 .cse40 .cse32)) (.cse46 (< ~token~0 .cse55)) (.cse47 (< .cse55 ~token~0)) (.cse43 (= 0 ~E_2~0)) (.cse19 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse21 (not .cse38)) (.cse2 (= ~T3_E~0 0)) (.cse35 (< |old(~t3_st~0)| 2)) (.cse22 (not (= 1 ~t3_pc~0))) (.cse3 (= ~T2_E~0 0)) (.cse49 (< .cse54 ~token~0)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse24 (< |old(~t1_st~0)| 2)) (.cse53 (not .cse13)) (.cse11 (not (= ~m_i~0 1))) (.cse25 (< ~E_3~0 2)) (.cse27 (not .cse39)) (.cse26 (< ~E_M~0 2)) (.cse29 (< ~E_2~0 2)) (.cse50 (< ~token~0 .cse54))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 1 ~E_1~0)) .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse0 .cse20 .cse21 .cse2 .cse22 .cse3 .cse23 .cse24 (= ~t3_st~0 2) .cse11 .cse25 .cse26 (or (not (= 2 |old(~t3_st~0)|)) .cse27 .cse28) .cse29) (or (and .cse30 .cse14 .cse31 .cse32) .cse0 .cse20 .cse33 .cse21 .cse34 .cse2 .cse35 .cse22 .cse3 .cse23 .cse24 .cse11 .cse25 .cse26 .cse36 .cse29 .cse13) (or .cse0 .cse37 .cse2 .cse38 .cse35 .cse22 .cse3 .cse4 (and .cse30 .cse14 .cse16 .cse17) .cse11 .cse12 .cse25 .cse26 .cse36 .cse29 .cse13 .cse39) (or .cse19 .cse0 .cse37 .cse28 .cse21 .cse2 .cse3 .cse8 (and .cse40 .cse15 .cse41 .cse32) .cse11 .cse12 .cse25 .cse27 .cse26 .cse42 .cse43) (or .cse0 .cse20 .cse2 .cse38 .cse35 .cse22 .cse3 .cse4 .cse23 .cse11 .cse25 .cse26 .cse36 .cse29 .cse13 (and .cse30 .cse14 .cse31 .cse44) .cse39) (or .cse0 .cse37 .cse33 .cse21 .cse34 .cse2 .cse3 .cse8 (and .cse14 .cse15 .cse41 .cse32) .cse24 .cse11 .cse12 .cse25 .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse3 .cse45 .cse8 .cse23 .cse46 .cse11 .cse25 .cse27 .cse26 .cse42 .cse47 .cse43) (or .cse0 .cse20 .cse2 .cse38 .cse3 .cse8 .cse4 .cse23 .cse11 .cse25 (and .cse14 .cse31 .cse44 .cse15) .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse19 .cse0 .cse48 .cse28 .cse21 .cse2 .cse3 .cse8 .cse23 .cse24 .cse11 .cse27 .cse26 .cse29 .cse45 .cse42) (or .cse19 .cse0 .cse37 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 (and .cse30 .cse40 .cse41 .cse32) .cse11 .cse12 .cse25 .cse27 .cse26 .cse43) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse22 .cse3 .cse49 .cse23 .cse24 .cse11 .cse25 .cse27 .cse29 (= 0 ~E_M~0) .cse50 .cse51) (let ((.cse52 (+ ~local~0 2))) (or .cse19 .cse0 .cse48 .cse28 (< .cse52 ~token~0) .cse21 .cse2 .cse35 .cse22 .cse3 .cse23 .cse24 .cse11 .cse51 .cse27 .cse26 .cse29 (< ~token~0 .cse52))) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse16 (= ~m_st~0 0) (= ~t3_st~0 0) .cse17) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse11 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse6 .cse8) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse5 .cse53 .cse12 .cse1 (not (= 0 ~local~0)) .cse18 .cse9 .cse7 .cse10 .cse4)) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 .cse51 .cse23 .cse24 .cse11 .cse25 .cse27 .cse26 .cse29) (or .cse0 .cse20 .cse33 .cse21 .cse34 .cse2 .cse3 .cse8 .cse23 .cse24 (and .cse14 .cse31 .cse15 .cse32) .cse11 .cse25 .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse0 .cse37 .cse33 .cse21 .cse34 .cse2 .cse35 .cse22 .cse3 .cse24 .cse11 (and .cse30 .cse14 .cse41 .cse32) .cse12 .cse25 .cse26 .cse36 .cse29 .cse13 .cse39) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 .cse23 .cse51 .cse46 .cse11 .cse25 .cse27 .cse26 .cse47 .cse43) (or .cse19 .cse0 .cse20 .cse21 .cse2 .cse35 .cse22 .cse3 .cse49 .cse23 .cse24 .cse53 .cse11 (and .cse30 .cse31 (= 0 ~m_st~0) .cse32) .cse25 .cse27 .cse26 .cse29 .cse50)))) [2018-11-18 16:18:05,116 INFO L421 ceAbstractionStarter]: At program point L521-2(lines 521 525) the Hoare annotation is: (let ((.cse48 (= ~t1_pc~0 1)) (.cse36 (= 1 ~m_pc~0)) (.cse28 (= 0 ~t3_st~0)) (.cse22 (= ~m_st~0 2)) (.cse57 (+ ~local~0 1)) (.cse35 (= 0 |old(~m_st~0)|)) (.cse21 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse49 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse56 (= 0 ~m_st~0)) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse58 (+ ~local~0 3))) (let ((.cse9 (< .cse58 ~token~0)) (.cse15 (and .cse21 .cse49 .cse56 .cse24)) (.cse17 (< ~token~0 .cse58)) (.cse37 (not .cse35)) (.cse42 (not (= 2 ~E_2~0))) (.cse41 (not (= ~t1_pc~0 0))) (.cse40 (not (= 2 ~E_3~0))) (.cse45 (not (= 0 ~m_pc~0))) (.cse44 (not (= 0 ~t3_pc~0))) (.cse46 (not (= 2 ~E_M~0))) (.cse43 (not (= 0 ~t2_pc~0))) (.cse38 (= ~t1_st~0 0)) (.cse39 (= ~t2_st~0 0)) (.cse20 (< 0 ~t2_pc~0)) (.cse23 (= 0 ~t2_st~0)) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse51 (< ~token~0 .cse57)) (.cse52 (< .cse57 ~token~0)) (.cse26 (= 0 ~E_2~0)) (.cse50 (= 0 ~t1_st~0)) (.cse47 (not (= |old(~t1_st~0)| 0))) (.cse8 (and .cse21 .cse49 .cse22 .cse24)) (.cse0 (< ~E_1~0 2)) (.cse54 (= 0 ~E_3~0)) (.cse53 (and .cse49 .cse22 .cse28 .cse24)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse32 (not (= 0 |old(~t3_st~0)|))) (.cse14 (not .cse36)) (.cse34 (< 0 ~t3_pc~0)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse30 (< ~local~0 ~token~0)) (.cse4 (not .cse48)) (.cse31 (< ~token~0 ~local~0)) (.cse5 (= ~T3_E~0 0)) (.cse18 (< |old(~t3_st~0)| 2)) (.cse6 (not (= 1 ~t3_pc~0))) (.cse7 (= ~T2_E~0 0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (< ~E_3~0 2)) (.cse19 (< ~E_M~0 2)) (.cse33 (= 0 ~E_1~0)) (.cse27 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= activate_threads_~tmp~1 0)) (.cse16 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 0 ~E_M~0) .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse8 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 (= ~t3_st~0 2) .cse12 .cse13 .cse19 (or (not (= 2 |old(~t3_st~0)|)) .cse14 .cse3) .cse16) (or .cse0 .cse1 .cse20 (and .cse21 .cse22 .cse23 .cse24) .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse12 .cse25 .cse13 .cse14 .cse19 .cse26) (or (and .cse27 .cse28 .cse29 .cse23 .cse24) .cse1 .cse20 .cse30 .cse4 .cse31 .cse5 .cse7 .cse32 .cse11 .cse12 .cse25 .cse13 .cse19 .cse33 .cse16 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13 .cse14 .cse19 .cse16 .cse15 .cse17) (or (and .cse29 .cse38 (= ~m_st~0 0) (= ~t3_st~0 0) .cse39) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse12 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse40 .cse32) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse41 .cse37 .cse25 .cse42 (not (= 0 ~local~0)) .cse43 .cse44 .cse45 .cse46 .cse47)) (or .cse1 .cse42 .cse5 .cse7 .cse47 (and .cse27 .cse28 .cse29 .cse38 .cse39) .cse41 .cse40 .cse45 .cse32 .cse44 .cse46 (not (= 1 ~E_1~0)) .cse12 .cse25 .cse35 .cse43) (or .cse1 .cse20 .cse30 .cse4 .cse31 .cse5 .cse18 .cse6 .cse7 (and .cse21 .cse27 .cse29 .cse23 .cse24) .cse11 .cse12 .cse25 .cse13 .cse19 .cse33 .cse16 .cse35 .cse36) (or .cse1 .cse20 (and .cse21 .cse27 .cse29 .cse38 .cse39) .cse5 .cse48 .cse18 .cse6 .cse7 .cse47 .cse12 .cse25 .cse13 .cse19 .cse33 .cse16 .cse35 .cse36) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 (and .cse22 .cse28 .cse23 .cse24) .cse7 .cse32 .cse12 .cse25 .cse13 .cse14 .cse19 .cse34 .cse26) (or .cse1 .cse2 (and .cse27 .cse49 .cse50 .cse28 .cse29) .cse5 .cse48 .cse7 .cse32 .cse47 .cse10 .cse12 .cse13 .cse19 .cse33 .cse16 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse10 .cse51 .cse12 .cse13 .cse14 .cse19 .cse52 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse53 .cse5 .cse7 .cse32 .cse10 .cse51 .cse12 .cse13 .cse14 .cse19 .cse34 .cse52 .cse26) (or .cse1 .cse2 (and .cse21 .cse27 .cse49 .cse50 .cse29) .cse5 .cse48 .cse18 .cse6 .cse7 .cse47 .cse10 .cse12 .cse13 .cse19 .cse33 .cse16 .cse35 .cse36) (or .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse7 (and .cse27 .cse49 .cse28 .cse29 .cse24) .cse32 .cse10 .cse11 .cse12 .cse13 .cse19 .cse33 .cse16 .cse34 .cse35 .cse36) (let ((.cse55 (+ ~local~0 2))) (or .cse0 .cse1 .cse54 .cse3 (< .cse55 ~token~0) .cse4 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse12 .cse8 .cse14 .cse19 .cse16 (< ~token~0 .cse55))) (or (and .cse49 (or .cse27 .cse56) .cse21 .cse24) .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse19 .cse33 .cse16 .cse35) (or .cse0 .cse1 .cse54 .cse53 .cse3 .cse4 .cse5 .cse7 .cse32 .cse10 .cse11 .cse12 .cse14 .cse19 .cse16 .cse34) (or .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse18 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse19 .cse33 (and .cse27 .cse29) .cse16 .cse35 .cse36)))) [2018-11-18 16:18:05,121 INFO L425 ceAbstractionStarter]: For program point L519-1(line 519) no Hoare annotation was computed. [2018-11-18 16:18:05,121 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 511 553) the Hoare annotation is: (let ((.cse39 (= 1 ~m_pc~0)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse54 (+ ~local~0 3)) (.cse38 (= ~t1_pc~0 1)) (.cse55 (+ ~local~0 1)) (.cse30 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse31 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse40 (= ~m_st~0 2)) (.cse15 (= 0 ~t3_st~0)) (.cse32 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse44 (= 0 ~t1_st~0)) (.cse45 (and .cse31 .cse40 .cse15 .cse32)) (.cse48 (= 0 ~E_3~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~t2_st~0 0)) (.cse6 (not (= 2 ~E_3~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse1 (not (= 2 ~E_2~0))) (.cse18 (not (= 0 ~t2_pc~0))) (.cse9 (not (= 0 ~t3_pc~0))) (.cse7 (not (= 0 ~m_pc~0))) (.cse10 (not (= 2 ~E_M~0))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse8 (not (= 0 |old(~t3_st~0)|))) (.cse42 (< 0 ~t3_pc~0)) (.cse37 (< 0 ~t2_pc~0)) (.cse33 (< ~local~0 ~token~0)) (.cse34 (< ~token~0 ~local~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= 0 ~t2_st~0)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse36 (= 0 ~E_1~0)) (.cse28 (not (= 2 |old(~m_st~0)|))) (.cse51 (and .cse30 .cse31 .cse40 .cse32)) (.cse46 (< ~token~0 .cse55)) (.cse47 (< .cse55 ~token~0)) (.cse43 (= 0 ~E_2~0)) (.cse19 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse21 (not .cse38)) (.cse2 (= ~T3_E~0 0)) (.cse35 (< |old(~t3_st~0)| 2)) (.cse22 (not (= 1 ~t3_pc~0))) (.cse3 (= ~T2_E~0 0)) (.cse49 (< .cse54 ~token~0)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse24 (< |old(~t1_st~0)| 2)) (.cse53 (not .cse13)) (.cse11 (not (= ~m_i~0 1))) (.cse25 (< ~E_3~0 2)) (.cse27 (not .cse39)) (.cse26 (< ~E_M~0 2)) (.cse29 (< ~E_2~0 2)) (.cse50 (< ~token~0 .cse54))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 1 ~E_1~0)) .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse0 .cse20 .cse21 .cse2 .cse22 .cse3 .cse23 .cse24 (= ~t3_st~0 2) .cse11 .cse25 .cse26 (or (not (= 2 |old(~t3_st~0)|)) .cse27 .cse28) .cse29) (or (and .cse30 .cse14 .cse31 .cse32) .cse0 .cse20 .cse33 .cse21 .cse34 .cse2 .cse35 .cse22 .cse3 .cse23 .cse24 .cse11 .cse25 .cse26 .cse36 .cse29 .cse13) (or .cse0 .cse37 .cse2 .cse38 .cse35 .cse22 .cse3 .cse4 (and .cse30 .cse14 .cse16 .cse17) .cse11 .cse12 .cse25 .cse26 .cse36 .cse29 .cse13 .cse39) (or .cse19 .cse0 .cse37 .cse28 .cse21 .cse2 .cse3 .cse8 (and .cse40 .cse15 .cse41 .cse32) .cse11 .cse12 .cse25 .cse27 .cse26 .cse42 .cse43) (or .cse0 .cse20 .cse2 .cse38 .cse35 .cse22 .cse3 .cse4 .cse23 .cse11 .cse25 .cse26 .cse36 .cse29 .cse13 (and .cse30 .cse14 .cse31 .cse44) .cse39) (or .cse0 .cse37 .cse33 .cse21 .cse34 .cse2 .cse3 .cse8 (and .cse14 .cse15 .cse41 .cse32) .cse24 .cse11 .cse12 .cse25 .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse3 .cse45 .cse8 .cse23 .cse46 .cse11 .cse25 .cse27 .cse26 .cse42 .cse47 .cse43) (or .cse0 .cse20 .cse2 .cse38 .cse3 .cse8 .cse4 .cse23 .cse11 .cse25 (and .cse14 .cse31 .cse44 .cse15) .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse19 .cse0 .cse48 .cse28 .cse21 .cse2 .cse3 .cse8 .cse23 .cse24 .cse11 .cse27 .cse26 .cse29 .cse45 .cse42) (or .cse19 .cse0 .cse37 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 (and .cse30 .cse40 .cse41 .cse32) .cse11 .cse12 .cse25 .cse27 .cse26 .cse43) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse22 .cse3 .cse49 .cse23 .cse24 .cse11 .cse25 .cse27 .cse29 (= 0 ~E_M~0) .cse50 .cse51) (let ((.cse52 (+ ~local~0 2))) (or .cse19 .cse0 .cse48 .cse28 (< .cse52 ~token~0) .cse21 .cse2 .cse35 .cse22 .cse3 .cse23 .cse24 .cse11 .cse51 .cse27 .cse26 .cse29 (< ~token~0 .cse52))) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse16 (= ~m_st~0 0) (= ~t3_st~0 0) .cse17) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse11 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse6 .cse8) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse5 .cse53 .cse12 .cse1 (not (= 0 ~local~0)) .cse18 .cse9 .cse7 .cse10 .cse4)) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 .cse51 .cse23 .cse24 .cse11 .cse25 .cse27 .cse26 .cse29) (or .cse0 .cse20 .cse33 .cse21 .cse34 .cse2 .cse3 .cse8 .cse23 .cse24 (and .cse14 .cse31 .cse15 .cse32) .cse11 .cse25 .cse26 .cse36 .cse29 .cse42 .cse13 .cse39) (or .cse0 .cse37 .cse33 .cse21 .cse34 .cse2 .cse35 .cse22 .cse3 .cse24 .cse11 (and .cse30 .cse14 .cse41 .cse32) .cse12 .cse25 .cse26 .cse36 .cse29 .cse13 .cse39) (or .cse19 .cse0 .cse20 .cse28 .cse21 .cse2 .cse35 .cse22 .cse3 .cse23 .cse51 .cse46 .cse11 .cse25 .cse27 .cse26 .cse47 .cse43) (or .cse19 .cse0 .cse20 .cse21 .cse2 .cse35 .cse22 .cse3 .cse49 .cse23 .cse24 .cse53 .cse11 (and .cse30 .cse31 (= 0 ~m_st~0) .cse32) .cse25 .cse27 .cse26 .cse29 .cse50)))) [2018-11-18 16:18:05,122 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 511 553) no Hoare annotation was computed. [2018-11-18 16:18:05,123 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 554 564) no Hoare annotation was computed. [2018-11-18 16:18:05,124 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 554 564) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0)) (.cse45 (+ ~local~0 1)) (.cse12 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse28 (= ~t1_pc~0 1)) (.cse13 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~m_st~0 2)) (.cse9 (= 0 ~t3_st~0)) (.cse14 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse10 (= ~t1_st~0 0)) (.cse11 (= ~t2_st~0 0)) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse37 (= 0 ~t1_st~0)) (.cse38 (and .cse13 .cse32 .cse9 .cse14)) (.cse41 (= 0 ~E_3~0)) (.cse4 (not (= 0 |old(~t3_st~0)|))) (.cse35 (< 0 ~t3_pc~0)) (.cse27 (< 0 ~t2_pc~0)) (.cse16 (< ~local~0 ~token~0)) (.cse18 (< ~token~0 ~local~0)) (.cse22 (< |old(~t1_st~0)| 2)) (.cse8 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse6 (not (= 0 |old(~t2_st~0)|))) (.cse25 (= 0 ~E_1~0)) (.cse26 (< ~E_2~0 2)) (.cse7 (= 0 |old(~m_st~0)|)) (.cse30 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse15 (< |old(~t2_st~0)| 2)) (.cse31 (not (= 2 |old(~m_st~0)|))) (.cse17 (not .cse28)) (.cse1 (= ~T3_E~0 0)) (.cse19 (< |old(~t3_st~0)| 2)) (.cse20 (not (= 1 ~t3_pc~0))) (.cse2 (= ~T2_E~0 0)) (.cse21 (not (= 1 ~t2_pc~0))) (.cse43 (and .cse12 .cse13 .cse32 .cse14)) (.cse39 (< ~token~0 .cse45)) (.cse5 (not (= ~m_i~0 1))) (.cse23 (< ~E_3~0 2)) (.cse34 (not .cse29)) (.cse24 (< ~E_M~0 2)) (.cse40 (< .cse45 ~token~0)) (.cse36 (= 0 ~E_2~0))) (and (or .cse0 (not (= 2 ~E_2~0)) .cse1 .cse2 .cse3 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 0 ~m_pc~0)) .cse4 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~E_1~0)) .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) (not (= 0 ~t2_pc~0))) (or (and .cse12 .cse8 .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse1 .cse19 .cse20 .cse2 .cse21 .cse22 .cse5 .cse23 .cse24 .cse25 .cse26 .cse7) (or .cse0 .cse27 .cse1 .cse28 .cse19 .cse20 .cse2 .cse3 (and .cse12 .cse8 .cse10 .cse11) .cse5 .cse6 .cse23 .cse24 .cse25 .cse26 .cse7 .cse29) (or .cse30 .cse0 .cse27 .cse31 .cse17 .cse1 .cse2 .cse4 (and .cse32 .cse9 .cse33 .cse14) .cse5 .cse6 .cse23 .cse34 .cse24 .cse35 .cse36) (or .cse0 .cse15 .cse1 .cse28 .cse19 .cse20 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse25 .cse26 .cse7 (and .cse12 .cse8 .cse13 .cse37) .cse29) (or .cse0 .cse27 .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 (and .cse8 .cse9 .cse33 .cse14) .cse22 .cse5 .cse6 .cse23 .cse24 .cse25 .cse26 .cse35 .cse7 .cse29) (or .cse30 .cse0 .cse15 .cse31 .cse17 .cse1 .cse2 .cse38 .cse4 .cse21 .cse39 .cse5 .cse23 .cse34 .cse24 .cse35 .cse40 .cse36) (or .cse0 .cse15 .cse1 .cse28 .cse2 .cse4 .cse3 .cse21 .cse5 .cse23 (and .cse8 .cse13 .cse37 .cse9) .cse24 .cse25 .cse26 .cse35 .cse7 .cse29) (or .cse30 .cse0 .cse41 .cse31 .cse17 .cse1 .cse2 .cse4 .cse21 .cse22 .cse5 .cse34 .cse24 .cse26 .cse38 .cse35) (or .cse30 .cse0 .cse27 .cse31 .cse17 .cse1 .cse19 .cse20 .cse2 (and .cse12 .cse32 .cse33 .cse14) .cse5 .cse6 .cse23 .cse34 .cse24 .cse36) (let ((.cse42 (+ ~local~0 3))) (or .cse30 .cse0 .cse15 .cse31 .cse17 .cse1 .cse20 .cse2 (< .cse42 ~token~0) .cse21 .cse22 .cse5 .cse23 .cse34 .cse26 (= 0 ~E_M~0) (< ~token~0 .cse42) .cse43)) (let ((.cse44 (+ ~local~0 2))) (or .cse30 .cse0 .cse41 .cse31 (< .cse44 ~token~0) .cse17 .cse1 .cse19 .cse20 .cse2 .cse21 .cse22 .cse5 .cse43 .cse34 .cse24 .cse26 (< ~token~0 .cse44))) (or .cse0 .cse15 .cse16 .cse17 .cse18 .cse1 .cse2 .cse4 .cse21 .cse22 (and .cse8 .cse13 .cse9 .cse14) .cse5 .cse23 .cse24 .cse25 .cse26 .cse35 .cse7 .cse29) (or .cse0 .cse27 .cse16 .cse17 .cse18 .cse1 .cse19 .cse20 .cse2 .cse22 .cse5 (and .cse12 .cse8 .cse33 .cse14) .cse6 .cse23 .cse24 .cse25 .cse26 .cse7 .cse29) (or .cse30 .cse0 .cse15 .cse31 .cse17 .cse1 .cse19 .cse20 .cse2 .cse21 .cse43 .cse39 .cse5 .cse23 .cse34 .cse24 .cse40 .cse36)))) [2018-11-18 16:18:05,124 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 554 564) no Hoare annotation was computed. [2018-11-18 16:18:05,125 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 328) no Hoare annotation was computed. [2018-11-18 16:18:05,125 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 306 335) no Hoare annotation was computed. [2018-11-18 16:18:05,125 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 329) no Hoare annotation was computed. [2018-11-18 16:18:05,125 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 330) no Hoare annotation was computed. [2018-11-18 16:18:05,126 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 306 335) the Hoare annotation is: true [2018-11-18 16:18:05,126 INFO L421 ceAbstractionStarter]: At program point L332(lines 309 334) the Hoare annotation is: (let ((.cse35 (= 1 ~m_pc~0))) (let ((.cse37 (= 0 ~m_st~0)) (.cse19 (not .cse35)) (.cse16 (not (= 2 ~m_st~0)))) (let ((.cse34 (or .cse19 .cse16)) (.cse26 (not (= ~token~0 0))) (.cse21 (not .cse37)) (.cse27 (not (= 0 ~local~0))) (.cse25 (not (= 0 ~m_pc~0))) (.cse38 (= ~t1_pc~0 1)) (.cse43 (+ ~local~0 1))) (let ((.cse18 (< ~token~0 .cse43)) (.cse20 (< .cse43 ~token~0)) (.cse39 (not (= 2 ~E_3~0))) (.cse41 (not (= 2 ~E_M~0))) (.cse28 (not (= 2 ~E_1~0))) (.cse40 (not (= ~t1_pc~0 0))) (.cse22 (not (= 2 ~E_2~0))) (.cse24 (not (= 0 ~t3_pc~0))) (.cse23 (not (= 0 ~t2_pc~0))) (.cse31 (< 0 ~t3_pc~0)) (.cse30 (< ~t2_st~0 2)) (.cse9 (not .cse38)) (.cse29 (not (= 0 ~t3_st~0))) (.cse17 (not (= 1 ~t2_pc~0))) (.cse4 (< ~t1_st~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< 0 ~t2_pc~0)) (.cse32 (< ~local~0 ~token~0)) (.cse2 (= ~T3_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse36 (not (= ~t1_st~0 0))) (.cse5 (< ~E_M~0 2)) (.cse6 (< ~E_1~0 2)) (.cse7 (and .cse34 (or .cse26 .cse21 .cse27 .cse25))) (.cse33 (< ~token~0 ~local~0)) (.cse11 (< ~t3_st~0 2)) (.cse10 (not (= 1 ~t3_pc~0))) (.cse8 (= exists_runnable_thread_~__retres1~4 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (not (= 0 ~t2_st~0))) (.cse14 (< ~E_3~0 2)) (.cse15 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse6 .cse0 .cse16 .cse9 .cse2 .cse11 .cse10 .cse3 .cse17 .cse4 .cse18 .cse12 .cse13 .cse14 .cse19 .cse8 .cse5 .cse15 .cse20) (or .cse0 .cse2 .cse8 .cse3 .cse5 (or .cse21 (not (= ~t1_st~0 2)) .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse27 .cse28 .cse9) .cse29 .cse12 .cse13 .cse14) (or (or .cse6 .cse0 .cse30 .cse9 .cse2 .cse3 .cse29 .cse17 .cse26 .cse4 .cse21 .cse12 .cse14 .cse5 .cse15 .cse31 .cse25) .cse8 .cse32 .cse33) (or .cse6 .cse0 .cse30 .cse8 .cse9 .cse2 .cse3 .cse29 .cse17 .cse4 .cse12 .cse14 .cse5 .cse34 .cse15 .cse31) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse17 .cse12 .cse14 .cse15 .cse35) (or .cse0 .cse32 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse30 .cse33 .cse8 .cse29 .cse17 .cse12 .cse14 .cse15 .cse31 .cse37) (or .cse0 .cse2 .cse3 .cse8 .cse36 .cse5 .cse6 .cse7 .cse30 .cse38 .cse10 .cse11 .cse17 .cse12 .cse14 .cse15) (or .cse6 .cse0 .cse8 .cse16 .cse9 .cse2 .cse3 .cse29 .cse17 .cse4 .cse18 .cse12 .cse13 .cse14 .cse19 .cse5 .cse15 .cse31 .cse20) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) .cse8 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse12 .cse28 (not (= 1 ~t2_i~0)) (or .cse39 .cse29) (not (= 2 ~M_E~0)) (or .cse26 .cse40 .cse21 .cse13 .cse22 .cse27 .cse23 .cse24 .cse25 .cse41 .cse36)) (or .cse0 .cse8 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse30 .cse38 .cse29 .cse17 .cse12 .cse14 .cse15 .cse31) (or .cse0 .cse32 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse30 .cse33 .cse11 .cse10 .cse8 .cse17 .cse12 .cse14 .cse15 .cse37) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse9 .cse33 .cse29 .cse12 .cse13 .cse14 .cse8 .cse15 .cse31 .cse37) (or .cse0 .cse8 .cse2 .cse3 .cse39 .cse41 .cse12 .cse28 (or .cse40 .cse13 .cse19 .cse22 .cse16 .cse24 .cse29 .cse36) .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse38 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse8) (or .cse6 .cse0 .cse1 .cse16 .cse8 .cse9 .cse2 .cse3 .cse29 .cse4 .cse12 .cse13 .cse14 .cse19 .cse5 .cse15 .cse31) (let ((.cse42 (+ ~local~0 2))) (or .cse6 .cse0 .cse30 .cse16 (< .cse42 ~token~0) .cse9 .cse2 .cse10 .cse3 .cse29 .cse17 .cse4 .cse12 .cse8 .cse14 .cse19 .cse5 .cse15 (< ~token~0 .cse42))) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse36 .cse5 .cse6 .cse7 .cse33 .cse11 .cse10 .cse8 .cse12 .cse13 .cse14 .cse15 .cse37)))))) [2018-11-18 16:18:05,129 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 327) no Hoare annotation was computed. [2018-11-18 16:18:05,129 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 306 335) no Hoare annotation was computed. [2018-11-18 16:18:05,129 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,137 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 463 510) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 463 510) the Hoare annotation is: (let ((.cse16 (= |old(~T1_E~0)| ~T1_E~0))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~T3_E~0)| 0)) (.cse5 (< ~t3_st~0 2)) (.cse6 (not (= 1 ~t3_pc~0))) (.cse7 (= |old(~T2_E~0)| 0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse17 (not (= 0 ~m_st~0))) (.cse10 (not (= ~m_i~0 1))) (.cse15 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~E_3~0)| ~E_3~0) .cse16)) (.cse11 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 ~m_pc~0))) (.cse13 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 (not (= 2 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~M_E~0 2) (= ~T2_E~0 2) .cse16 (= ~E_3~0 2) (= ~E_1~0 2) (= ~E_M~0 2) (= ~T3_E~0 2) (= ~E_2~0 2)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) .cse10 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 ~t3_st~0))) (not (= 2 |old(~M_E~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse17 (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_2~0)|)) (not (= 0 ~local~0)) (not (= 0 ~t2_pc~0)) (not (= 0 ~t3_pc~0)) (not (= 0 ~m_pc~0)) (not (= 2 |old(~E_M~0)|)) (not (= ~t1_st~0 0)))) (let ((.cse18 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse18 ~token~0) .cse8 .cse9 .cse17 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14 (< ~token~0 .cse18)))))) [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L467-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L482-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L497-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 463 510) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 466 509) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 213 231) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 226) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 213 231) the Hoare annotation is: true [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point L217-2(lines 217 226) no Hoare annotation was computed. [2018-11-18 16:18:05,138 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 213 231) no Hoare annotation was computed. [2018-11-18 16:18:05,139 INFO L421 ceAbstractionStarter]: At program point L228(lines 216 230) the Hoare annotation is: (let ((.cse38 (= 1 ~m_pc~0)) (.cse39 (= ~t1_pc~0 1)) (.cse36 (= 0 ~m_st~0)) (.cse44 (+ ~local~0 1))) (let ((.cse11 (< ~token~0 .cse44)) (.cse16 (< .cse44 ~token~0)) (.cse23 (not (= 2 ~E_2~0))) (.cse20 (not (= ~t1_pc~0 0))) (.cse18 (not (= 2 ~E_3~0))) (.cse26 (not (= 0 ~m_pc~0))) (.cse25 (not (= 0 ~t3_pc~0))) (.cse27 (not (= 2 ~E_M~0))) (.cse24 (not (= 0 ~t2_pc~0))) (.cse19 (not (= 0 ~t3_st~0))) (.cse40 (< 0 ~t3_pc~0)) (.cse17 (= 0 ~E_2~0)) (.cse33 (< ~local~0 ~token~0)) (.cse34 (< ~token~0 ~local~0)) (.cse37 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse2 (< ~t2_st~0 2)) (.cse21 (not .cse36)) (.cse31 (= 0 ~E_M~0)) (.cse32 (< 0 ~t2_pc~0)) (.cse28 (not (= ~t1_st~0 0))) (.cse22 (not (= 0 ~t2_st~0))) (.cse13 (< ~E_3~0 2)) (.cse35 (= 0 ~E_1~0)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse41 (= 0 ~E_3~0)) (.cse4 (not (= 2 ~m_st~0))) (.cse5 (not .cse39)) (.cse6 (= ~T3_E~0 0)) (.cse7 (< ~t3_st~0 2)) (.cse8 (not (= 1 ~t3_pc~0))) (.cse9 (= ~T2_E~0 0)) (.cse3 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse29 (< ~t1_st~0 2)) (.cse12 (not (= ~m_i~0 1))) (.cse14 (not .cse38)) (.cse15 (< ~E_M~0 2)) (.cse30 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (= is_transmit1_triggered_~__retres1~1 0) (not (= 1 ~t3_i~0)) .cse12 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse18 .cse19) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse20 .cse21 .cse22 .cse23 (not (= 0 ~local~0)) .cse24 .cse25 .cse26 .cse27 .cse28)) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse29 .cse12 .cse3 .cse13 .cse14 .cse30 .cse31) (or .cse1 .cse32 .cse33 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse29 .cse12 .cse22 .cse13 .cse15 .cse35 .cse30 .cse36 .cse3 .cse37 .cse38) (or .cse1 .cse2 .cse6 .cse39 .cse9 .cse19 .cse28 .cse10 .cse3 .cse12 .cse13 .cse15 .cse35 .cse30 .cse40 .cse36 .cse38) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse40 .cse16 .cse17 .cse3) (or .cse3 .cse0 .cse1 .cse41 .cse4 .cse5 .cse6 .cse9 .cse19 .cse10 .cse29 .cse12 .cse14 .cse15 .cse30 .cse40) (or .cse0 .cse1 .cse32 .cse4 .cse5 .cse6 .cse9 .cse19 .cse12 .cse22 .cse13 .cse14 .cse15 .cse40 .cse17 .cse3) (or .cse1 .cse32 .cse33 .cse5 .cse34 .cse6 .cse9 .cse19 .cse29 .cse12 .cse22 .cse13 .cse15 .cse35 .cse30 .cse3 .cse40 .cse36 .cse37 .cse38) (or .cse1 .cse23 .cse6 .cse9 .cse28 .cse20 .cse18 .cse26 .cse19 .cse25 .cse27 (not (= 1 ~E_1~0)) .cse12 .cse22 .cse36 .cse24 .cse3) (or .cse1 .cse2 .cse3 .cse33 .cse5 .cse34 .cse6 .cse9 .cse19 .cse37 .cse10 .cse29 .cse12 .cse13 .cse15 .cse35 .cse30 .cse40 .cse36 .cse38) (or .cse1 .cse2 .cse33 .cse3 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse37 .cse10 .cse29 .cse12 .cse13 .cse15 .cse35 .cse30 .cse36) (or .cse0 .cse1 .cse32 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse22 .cse13 .cse14 .cse15 .cse17) (or .cse1 .cse3 .cse2 .cse6 .cse39 .cse7 .cse8 .cse9 .cse28 .cse10 .cse12 .cse13 .cse15 .cse35 .cse30 .cse36 .cse38) (or .cse2 .cse33 .cse34 .cse7 .cse8 (or .cse1 .cse12 .cse14 .cse35 .cse5 .cse6 .cse9) .cse10 .cse29 .cse13 .cse15 .cse30 .cse37 .cse3) (let ((.cse42 (+ ~local~0 3))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 (< .cse42 ~token~0) .cse10 .cse29 .cse21 .cse12 .cse13 .cse14 .cse30 .cse31 (< ~token~0 .cse42))) (or .cse1 .cse32 .cse6 .cse39 .cse7 .cse8 .cse9 .cse28 .cse3 .cse12 .cse22 .cse13 .cse15 .cse35 .cse30 .cse36 .cse38) (let ((.cse43 (+ ~local~0 2))) (or .cse0 .cse1 .cse41 .cse4 (< .cse43 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse3 .cse10 .cse29 .cse12 .cse14 .cse15 .cse30 (< ~token~0 .cse43)))))) [2018-11-18 16:18:05,140 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 16:18:05,140 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 278 305) no Hoare annotation was computed. [2018-11-18 16:18:05,150 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 16:18:05,151 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 278 305) the Hoare annotation is: (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and (= ~t1_st~0 0) (= ~m_st~0 0) (= ~t3_st~0 0) (= ~t2_st~0 0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or (not (= 2 ~E_3~0)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 ~E_2~0)) (not (= 0 ~local~0)) (not (= 0 ~t2_pc~0)) (not (= 0 ~t3_pc~0)) (not (= 0 ~m_pc~0)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,151 INFO L425 ceAbstractionStarter]: For program point L297-1(lines 278 305) no Hoare annotation was computed. [2018-11-18 16:18:05,151 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 281 304) no Hoare annotation was computed. [2018-11-18 16:18:05,151 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 42 85) no Hoare annotation was computed. [2018-11-18 16:18:05,151 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-18 16:18:05,151 INFO L421 ceAbstractionStarter]: At program point L50(lines 45 84) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse23 (not .cse5)) (.cse4 (= ~T3_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse10 (not (= |old(~token~0)| 0))) (.cse11 (not (= ~m_i~0 1))) (.cse16 (= 0 |old(~m_st~0)|))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse27 (or .cse1 (= 0 ~E_3~0) .cse3 .cse23 .cse4 .cse8 .cse10 .cse11 (= 0 |old(~E_1~0)|) .cse16))) (let ((.cse26 (or .cse0 .cse12 .cse27)) (.cse2 (< 0 ~t2_pc~0)) (.cse6 (< |old(~t3_st~0)| 2)) (.cse7 (not (= 1 ~t3_pc~0))) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse18 (< |old(~t2_st~0)| 2)) (.cse19 (not (= 0 |old(~t3_st~0)|))) (.cse20 (not (= 1 ~t2_pc~0))) (.cse25 (< |old(~t1_st~0)| 2)) (.cse13 (< ~E_3~0 2)) (.cse14 (< ~E_M~0 2)) (.cse15 (< ~E_2~0 2)) (.cse21 (< 0 ~t3_pc~0)) (.cse17 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse8 .cse19 .cse9 .cse20 .cse10 .cse11 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17) (let ((.cse24 (+ |old(~local~0)| 3))) (or .cse0 (let ((.cse22 (+ ~local~0 3))) (and (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse22) (and (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 |old(~m_st~0)|) (= 1 ~m_pc~0)) (<= .cse22 ~token~0) (<= |old(~t3_st~0)| ~t3_st~0) (<= |old(~t1_st~0)| ~t1_st~0))) .cse18 (or .cse1 .cse11 (not (= 1 |old(~m_pc~0)|)) .cse23 .cse4 .cse16 .cse8) .cse6 .cse7 (< .cse24 |old(~token~0)|) .cse20 .cse25 .cse13 .cse14 .cse15 (< |old(~token~0)| .cse24))) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse3) .cse9 .cse10 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse17 (not (= ~T2_E~0 2)) .cse19 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse11 .cse12 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse26 .cse2 .cse6 .cse7 .cse25 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse18 .cse6 .cse7 .cse20 .cse25 .cse13 .cse27 .cse14 .cse15 .cse17) (or .cse26 .cse2 .cse19 .cse25 .cse13 .cse14 .cse15 .cse21 .cse17) (or .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse20 .cse25 .cse13 .cse27 .cse14 .cse15 .cse21 .cse17)))))) [2018-11-18 16:18:05,152 INFO L421 ceAbstractionStarter]: At program point L79(lines 42 85) the Hoare annotation is: (let ((.cse44 (= ~m_i~0 1)) (.cse23 (= ~t1_pc~0 1))) (let ((.cse21 (not (= 0 |old(~local~0)|))) (.cse39 (not .cse23)) (.cse27 (not (= |old(~token~0)| 0))) (.cse28 (not .cse44)) (.cse30 (= 0 |old(~m_st~0)|)) (.cse19 (= ~T1_E~0 0)) (.cse22 (= ~T3_E~0 0)) (.cse24 (= ~T2_E~0 0))) (let ((.cse7 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (= 1 ~t3_pc~0)) (.cse42 (not .cse24)) (.cse11 (<= ~token~0 ~local~0)) (.cse2 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse3 (<= 2 ~E_1~0)) (.cse29 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse12 (= 0 ~t1_st~0)) (.cse4 (= ~m_st~0 2)) (.cse45 (<= 2 ~t2_st~0)) (.cse46 (not .cse22)) (.cse47 (not .cse19)) (.cse6 (= 1 ~m_pc~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse18 (< |old(~E_1~0)| 2)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse34 (or .cse19 (= 0 ~E_3~0) .cse21 .cse39 .cse22 .cse24 .cse27 .cse28 (= 0 |old(~E_1~0)|) .cse30))) (let ((.cse0 (or .cse18 .cse37 .cse34)) (.cse5 (= 0 ~t2_st~0)) (.cse1 (< 0 ~t2_pc~0)) (.cse35 (= ~t1_st~0 0)) (.cse36 (= ~t2_st~0 0)) (.cse31 (= 0 ~t3_st~0)) (.cse32 (not (= 0 |old(~t3_st~0)|))) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse33 (< 0 ~t3_pc~0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse38 (and .cse42 .cse23 .cse44 .cse11 .cse2 .cse3 .cse29 .cse12 .cse4 .cse45 .cse46 .cse47 .cse6 .cse13)) (.cse8 (< |old(~t3_st~0)| 2)) (.cse9 (not .cse43)) (.cse26 (not (= 1 ~t2_pc~0))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse14 (< ~E_3~0 2)) (.cse15 (< ~E_M~0 2)) (.cse16 (< ~E_2~0 2)) (.cse41 (and (<= 2 ~E_3~0) .cse42 (= ~t2_pc~0 1) .cse43 .cse23 .cse44 (<= 2 ~t1_st~0) (<= 2 ~E_M~0) (<= 2 ~E_2~0) .cse2 .cse3 (<= 2 ~t3_st~0) .cse29 .cse4 .cse45 .cse46 .cse47 .cse6 .cse7)) (.cse17 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 (and .cse11 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse14 .cse15 .cse16 (and .cse2 .cse3 .cse29 .cse4 .cse12 .cse6) .cse30 .cse17) (or .cse0 .cse1 (and .cse3 .cse4 .cse31 .cse5 .cse6 .cse7) .cse32 .cse10 (and .cse11 .cse3 .cse12 .cse4 .cse31 .cse5 .cse6 .cse13) .cse14 .cse15 .cse16 .cse33 .cse17) (or .cse18 .cse20 (and .cse3 .cse29 .cse4 .cse31 .cse6 .cse7) .cse32 .cse26 .cse10 (and .cse11 .cse3 .cse29 .cse12 .cse4 .cse31 .cse6 .cse13) .cse14 .cse34 .cse15 .cse16 .cse33 .cse17) (or .cse18 .cse19 .cse1 .cse21 (and .cse2 .cse3 .cse4 .cse35 .cse36 .cse6) .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse27 .cse28 .cse37 .cse14 .cse15 .cse16 .cse30 .cse17) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse21) .cse25 .cse27 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse17 (and (= ~E_1~0 2) .cse4 (= ~t3_st~0 0) .cse35 .cse36 .cse6) (not (= ~T2_E~0 2)) .cse32 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse28 .cse37 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse30 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (let ((.cse40 (+ |old(~local~0)| 3))) (or .cse18 .cse20 .cse38 (or .cse19 .cse28 (not (= 1 |old(~m_pc~0)|)) .cse39 .cse22 .cse30 .cse24) .cse8 .cse9 (< .cse40 |old(~token~0)|) .cse26 .cse10 .cse14 .cse15 .cse16 .cse41 (< |old(~token~0)| .cse40))) (or .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse3 .cse29 .cse4 .cse12 .cse31 .cse6) .cse24 .cse32 .cse25 .cse26 .cse27 .cse28 .cse14 .cse15 .cse16 .cse33 .cse30 .cse17) (or .cse18 .cse20 .cse38 .cse8 .cse9 .cse26 .cse10 .cse14 .cse34 .cse15 .cse16 .cse41 .cse17)))))) [2018-11-18 16:18:05,154 INFO L421 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse21 (not .cse5)) (.cse4 (= ~T3_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse10 (not (= |old(~token~0)| 0))) (.cse11 (not (= ~m_i~0 1))) (.cse16 (= 0 |old(~m_st~0)|))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse26 (or .cse1 (= 0 ~E_3~0) .cse3 .cse21 .cse4 .cse8 .cse10 .cse11 (= 0 |old(~E_1~0)|) .cse16))) (let ((.cse25 (or .cse0 .cse12 .cse26)) (.cse2 (< 0 ~t2_pc~0)) (.cse6 (< |old(~t3_st~0)| 2)) (.cse7 (not (= 1 ~t3_pc~0))) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse20 (< |old(~t2_st~0)| 2)) (.cse23 (not (= 0 |old(~t3_st~0)|))) (.cse18 (not (= 1 ~t2_pc~0))) (.cse19 (< |old(~t1_st~0)| 2)) (.cse13 (< ~E_3~0 2)) (.cse14 (< ~E_M~0 2)) (.cse15 (< ~E_2~0 2)) (.cse24 (< 0 ~t3_pc~0)) (.cse17 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse22 (+ |old(~local~0)| 3))) (or .cse18 .cse0 .cse19 .cse20 .cse13 .cse14 (or .cse1 .cse11 (not (= 1 |old(~m_pc~0)|)) .cse21 .cse4 .cse16 .cse8) .cse15 .cse6 .cse7 (< |old(~token~0)| .cse22) (< .cse22 |old(~token~0)|))) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse8 .cse23 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse3) .cse9 .cse10 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse17 (not (= ~T2_E~0 2)) .cse23 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse11 .cse12 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse25 .cse2 .cse6 .cse7 .cse19 .cse13 .cse14 .cse15 .cse17) (or .cse0 .cse20 .cse6 .cse7 .cse18 .cse19 .cse13 .cse26 .cse14 .cse15 .cse17) (or .cse25 .cse2 .cse23 .cse19 .cse13 .cse14 .cse15 .cse24 .cse17) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse20 .cse23 .cse18 .cse19 .cse13 .cse26 .cse14 .cse15 .cse24 .cse17)))))) [2018-11-18 16:18:05,164 INFO L421 ceAbstractionStarter]: At program point L71(lines 45 84) the Hoare annotation is: (let ((.cse51 (= ~m_i~0 1)) (.cse38 (= ~t1_pc~0 1)) (.cse28 (= ~T1_E~0 0)) (.cse31 (= ~T3_E~0 0)) (.cse33 (= ~T2_E~0 0))) (let ((.cse20 (= |old(~E_1~0)| ~E_1~0)) (.cse46 (not .cse33)) (.cse47 (not (= ~m_pc~0 1))) (.cse48 (not .cse31)) (.cse49 (not .cse28)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (not (= 0 |old(~local~0)|))) (.cse30 (not .cse38)) (.cse40 (not (= |old(~token~0)| 0))) (.cse29 (not .cse51)) (.cse32 (= 0 |old(~m_st~0)|))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse44 (not (= 0 |old(~t2_st~0)|))) (.cse6 (or .cse28 (= 0 ~E_3~0) .cse37 .cse30 .cse31 .cse33 .cse40 .cse29 (= 0 |old(~E_1~0)|) .cse32)) (.cse50 (<= 2 ~E_1~0)) (.cse45 (and (and .cse20 .cse46 .cse38 .cse51 (not (= ~E_M~0 0)) .cse47 .cse48 .cse49 (not (= ~E_3~0 0)) (not (= ~E_1~0 0)) (not (= ~E_2~0 0))) .cse21 (not (= ~m_st~0 0))))) (let ((.cse12 (and .cse50 .cse45)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse10 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse41 (and (and .cse21 (and .cse30 .cse20 .cse46 .cse47 .cse48 .cse49)) (= 0 ~t1_st~0) .cse50)) (.cse16 (= 0 ~t3_st~0)) (.cse2 (not (= 0 |old(~t3_st~0)|))) (.cse3 (not (= 1 ~t2_pc~0))) (.cse9 (< 0 ~t3_pc~0)) (.cse22 (= ~m_pc~0 0)) (.cse42 (= ~t1_st~0 0)) (.cse43 (= ~t2_st~0 0)) (.cse24 (= ~token~0 0)) (.cse25 (= ~local~0 0)) (.cse39 (not (= |old(~t1_st~0)| 0))) (.cse18 (or .cse0 .cse44 .cse6)) (.cse19 (< 0 ~t2_pc~0)) (.cse34 (< |old(~t3_st~0)| 2)) (.cse35 (not (= 1 ~t3_pc~0))) (.cse4 (< |old(~t1_st~0)| 2)) (.cse11 (= ~token~0 |old(~token~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse23 (= 0 ~t2_st~0)) (.cse27 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse14 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse5 (< ~E_3~0 2)) (.cse7 (< ~E_M~0 2)) (.cse8 (< ~E_2~0 2)) (.cse17 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17) (or .cse18 .cse19 (and (and .cse20 .cse21) .cse22 .cse16 .cse23 .cse24 .cse25 .cse14) .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17) (let ((.cse36 (+ |old(~local~0)| 3))) (or .cse0 (let ((.cse26 (+ ~local~0 3))) (and .cse10 .cse11 (<= ~token~0 .cse26) (and .cse20 .cse21 (= 1 ~m_pc~0)) (<= .cse26 ~token~0) .cse27 .cse14)) .cse1 (or .cse28 .cse29 (not (= 1 |old(~m_pc~0)|)) .cse30 .cse31 .cse32 .cse33) .cse34 .cse35 (< .cse36 |old(~token~0)|) .cse3 .cse4 .cse5 .cse7 .cse8 (< |old(~token~0)| .cse36))) (or .cse0 .cse28 .cse1 .cse37 .cse31 .cse38 .cse34 .cse35 .cse33 .cse39 .cse3 .cse40 (and .cse10 (and .cse27 .cse41)) .cse29 .cse5 .cse7 .cse8 .cse32 .cse17) (or .cse0 .cse1 .cse34 .cse35 (and (and .cse12 .cse27) .cse10 .cse11 .cse13 .cse14 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse37) .cse39 .cse40 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse17 (and .cse21 .cse42 .cse22 (= ~E_1~0 2) (= ~t3_st~0 0) .cse43 .cse24 .cse25) (not (= ~T2_E~0 2)) .cse2 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse29 .cse44 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse32 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse28 .cse1 (and .cse10 .cse41 .cse16) .cse37 .cse31 .cse38 .cse33 .cse2 .cse39 .cse3 .cse40 .cse29 .cse5 .cse7 .cse8 .cse9 .cse32 .cse17) (or .cse0 .cse28 .cse19 .cse37 .cse31 .cse38 .cse34 .cse35 .cse33 (and (and .cse22 (and .cse20 .cse21 .cse42 .cse43)) .cse24 .cse25 .cse27) .cse39 .cse40 .cse29 .cse44 .cse5 .cse7 .cse8 .cse32 .cse17) (or .cse18 .cse19 .cse34 .cse35 .cse4 (and .cse11 .cse13 (and (and .cse45 .cse23) .cse27) .cse14 .cse15) .cse5 .cse7 .cse8 .cse17)))))) [2018-11-18 16:18:05,166 INFO L421 ceAbstractionStarter]: At program point L63(line 63) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1))) (let ((.cse22 (= ~T1_E~0 0)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse38 (not .cse25)) (.cse24 (= ~T3_E~0 0)) (.cse26 (= ~T2_E~0 0)) (.cse29 (not (= |old(~token~0)| 0))) (.cse30 (not (= ~m_i~0 1))) (.cse31 (= 0 |old(~m_st~0)|))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse37 (not (= 0 |old(~t2_st~0)|))) (.cse7 (or .cse22 (= 0 ~E_3~0) .cse23 .cse38 .cse24 .cse26 .cse29 .cse30 (= 0 |old(~E_1~0)|) .cse31))) (let ((.cse19 (or .cse0 .cse37 .cse7)) (.cse21 (= 0 ~t2_st~0)) (.cse20 (< 0 ~t2_pc~0)) (.cse35 (= ~t1_st~0 0)) (.cse36 (= ~t2_st~0 0)) (.cse12 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse2 (< |old(~t3_st~0)| 2)) (.cse3 (not (= 1 ~t3_pc~0))) (.cse28 (= 0 ~t1_st~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse33 (= 0 ~t3_st~0)) (.cse15 (not (= ~E_1~0 0))) (.cse16 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse32 (not (= 0 |old(~t3_st~0)|))) (.cse4 (not (= 1 ~t2_pc~0))) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (< ~E_3~0 2)) (.cse8 (< ~E_M~0 2)) (.cse9 (< ~E_2~0 2)) (.cse34 (< 0 ~t3_pc~0)) (.cse18 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse20 (and .cse10 .cse11 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17) .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse18) (or .cse0 .cse22 .cse1 .cse23 .cse24 .cse25 .cse2 .cse3 .cse26 .cse27 (and .cse10 .cse12 .cse13 .cse14 .cse28 .cse15) .cse4 .cse29 .cse30 .cse6 .cse8 .cse9 .cse31 .cse18) (or .cse19 .cse20 .cse32 .cse5 .cse6 .cse8 .cse9 (and .cse10 .cse11 .cse13 .cse33 .cse21 .cse15 .cse16 .cse17) .cse34 .cse18) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse23) .cse27 .cse29 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse18 (and (= ~m_pc~0 0) (= ~E_1~0 1) .cse13 .cse33 .cse35 .cse36) (not (= ~T2_E~0 2)) .cse32 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse30 .cse37 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse31 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse22 .cse20 .cse23 .cse24 .cse25 .cse2 .cse3 .cse26 .cse27 (and .cse10 .cse12 .cse13 .cse35 .cse36 .cse15) .cse29 .cse30 .cse37 .cse6 .cse8 .cse9 .cse31 .cse18) (let ((.cse39 (+ |old(~local~0)| 3))) (or .cse0 .cse1 (and .cse11 .cse12 .cse13 .cse14 (= 1 ~m_pc~0) .cse15 .cse16 .cse17) (or .cse22 .cse30 (not (= 1 |old(~m_pc~0)|)) .cse38 .cse24 .cse31 .cse26) .cse2 .cse3 (< .cse39 |old(~token~0)|) .cse4 .cse5 .cse6 .cse8 .cse9 (< |old(~token~0)| .cse39))) (or .cse0 .cse22 .cse1 (and .cse10 .cse13 .cse14 .cse28 .cse33 .cse15) .cse23 .cse24 .cse25 .cse26 .cse32 .cse27 .cse4 .cse29 .cse30 .cse6 .cse8 .cse9 .cse34 .cse31 .cse18) (or (and .cse10 .cse11 .cse13 .cse14 .cse33 .cse15 .cse16 .cse17) .cse0 .cse1 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse18)))))) [2018-11-18 16:18:05,169 INFO L425 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2018-11-18 16:18:05,169 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 78) no Hoare annotation was computed. [2018-11-18 16:18:05,170 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 53) no Hoare annotation was computed. [2018-11-18 16:18:05,170 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 42 85) the Hoare annotation is: (let ((.cse39 (= ~t1_pc~0 1))) (let ((.cse26 (= ~T1_E~0 0)) (.cse35 (not (= 0 |old(~local~0)|))) (.cse28 (not .cse39)) (.cse29 (= ~T3_E~0 0)) (.cse31 (= ~T2_E~0 0)) (.cse37 (not (= |old(~token~0)| 0))) (.cse27 (not (= ~m_i~0 1))) (.cse30 (= 0 |old(~m_st~0)|))) (let ((.cse17 (< |old(~E_1~0)| 2)) (.cse38 (not (= 0 |old(~t2_st~0)|))) (.cse22 (or .cse26 (= 0 ~E_3~0) .cse35 .cse28 .cse29 .cse31 .cse37 .cse27 (= 0 |old(~E_1~0)|) .cse30))) (let ((.cse5 (= 0 ~t3_st~0)) (.cse10 (not (= 0 |old(~t3_st~0)|))) (.cse15 (< 0 ~t3_pc~0)) (.cse24 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse40 (= 0 ~t1_st~0)) (.cse18 (< |old(~t2_st~0)| 2)) (.cse21 (not (= 1 ~t2_pc~0))) (.cse0 (or .cse17 .cse38 .cse22)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse6 (= 0 ~t2_st~0)) (.cse9 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (< 0 ~t2_pc~0)) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (= ~m_pc~0 0)) (.cse23 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (= ~t1_st~0 0)) (.cse34 (= ~t2_st~0 0)) (.cse7 (= ~token~0 0)) (.cse8 (= ~local~0 0)) (.cse19 (< |old(~t3_st~0)| 2)) (.cse20 (not (= 1 ~t3_pc~0))) (.cse36 (not (= |old(~t1_st~0)| 0))) (.cse12 (< ~E_3~0 2)) (.cse13 (< ~E_M~0 2)) (.cse14 (< ~E_2~0 2)) (.cse16 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12 .cse22 .cse13 (and .cse2 .cse3 .cse23 .cse24 .cse4 .cse7 .cse8 .cse9) .cse14 .cse16) (let ((.cse32 (+ |old(~local~0)| 3))) (or .cse17 (let ((.cse25 (+ ~local~0 3))) (and .cse24 (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse25) (and .cse2 .cse4 (= 1 ~m_pc~0)) (<= .cse25 ~token~0) .cse23 .cse9)) .cse18 (or .cse26 .cse27 (not (= 1 |old(~m_pc~0)|)) .cse28 .cse29 .cse30 .cse31) .cse19 .cse20 (< .cse32 |old(~token~0)|) .cse21 .cse11 .cse12 .cse13 .cse14 (< |old(~token~0)| .cse32))) (or (and .cse4 .cse33 .cse3 (= ~E_1~0 2) (= ~t3_st~0 0) .cse34 .cse7 .cse8) (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (or (not (= 2 ~E_2~0)) .cse35) .cse36 .cse37 (not (= ~t1_pc~0 0)) (not (= 2 ~E_3~0)) (not (= 1 ~t1_i~0)) .cse16 (not (= ~T2_E~0 2)) .cse10 (not (= 0 ~t3_pc~0)) (not (= 2 ~E_M~0)) (not (= 1 ~t3_i~0)) .cse27 .cse38 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse30 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse17 .cse18 (and .cse2 .cse3 .cse24 .cse4 .cse5 .cse7 .cse8 .cse9) .cse10 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse26 .cse18 .cse35 .cse29 .cse39 .cse31 (and .cse2 .cse3 .cse4 .cse24 .cse40 .cse5 .cse7 .cse8) .cse10 .cse36 .cse21 .cse37 .cse27 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16) (or .cse17 (and .cse2 .cse3 .cse23 .cse4 .cse24 .cse40 .cse7 .cse8) .cse26 .cse18 .cse35 .cse29 .cse39 .cse19 .cse20 .cse31 .cse36 .cse21 .cse37 .cse27 .cse12 .cse13 .cse14 .cse30 .cse16) (or .cse0 .cse1 .cse19 .cse20 .cse11 .cse12 .cse13 .cse14 (and .cse2 .cse3 .cse23 .cse4 .cse6 .cse7 .cse8 .cse9) .cse16) (or .cse17 .cse26 .cse1 .cse35 (and .cse2 .cse3 .cse23 .cse4 .cse33 .cse34 .cse7 .cse8) .cse29 .cse39 .cse19 .cse20 .cse31 .cse36 .cse37 .cse27 .cse38 .cse12 .cse13 .cse14 .cse30 .cse16)))))) [2018-11-18 16:18:05,171 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 565 573) no Hoare annotation was computed. [2018-11-18 16:18:05,171 INFO L428 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 565 573) the Hoare annotation is: true [2018-11-18 16:18:05,171 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 565 573) no Hoare annotation was computed. [2018-11-18 16:18:05,171 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:18:05,171 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T3_E~0)| ~T3_E~0) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 |old(~m_st~0)|) (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~E_2~0)| ~E_2~0) (<= |old(~t3_st~0)| ~t3_st~0) (= |old(~E_3~0)| ~E_3~0) (<= |old(~t1_st~0)| ~t1_st~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-18 16:18:05,172 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:18:05,173 INFO L425 ceAbstractionStarter]: For program point L345(line 345) no Hoare annotation was computed. [2018-11-18 16:18:05,173 INFO L425 ceAbstractionStarter]: For program point L366(lines 342 408) no Hoare annotation was computed. [2018-11-18 16:18:05,173 INFO L421 ceAbstractionStarter]: At program point L358(line 358) the Hoare annotation is: (let ((.cse31 (= ~T3_E~0 0)) (.cse28 (= ~T1_E~0 0)) (.cse34 (= ~T2_E~0 0)) (.cse42 (= ~m_i~0 1))) (let ((.cse6 (<= 2 ~t2_st~0)) (.cse14 (<= 2 ~t3_st~0)) (.cse25 (= ~t1_pc~0 1)) (.cse26 (and (and (and (not .cse31) (not .cse28) (not .cse34) .cse42 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse4 (not (= ~m_st~0 0))) (.cse1 (= ~t2_pc~0 1)) (.cse15 (= 1 ~t3_pc~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0))) (let ((.cse22 (let ((.cse43 (+ ~local~0 3))) (and (<= .cse43 ~token~0) (and .cse6 (<= 2 ~E_M~0) (<= 2 ~E_3~0) .cse14 (and (= 1 ~m_pc~0) .cse25 .cse26 .cse4) .cse1 .cse15 (<= 2 ~E_2~0) .cse16 .cse11) (<= ~token~0 .cse43)))) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse27 (< |old(~E_1~0)| 2)) (.cse29 (< |old(~t2_st~0)| 2)) (.cse30 (not (= |old(~t1_pc~0)| 1))) (.cse32 (< |old(~t3_st~0)| 2)) (.cse33 (not (= 1 |old(~t3_pc~0)|))) (.cse36 (not (= 1 |old(~t2_pc~0)|))) (.cse37 (< |old(~t1_st~0)| 2)) (.cse21 (not .cse42)) (.cse38 (< |old(~E_3~0)| 2)) (.cse39 (not (= 1 |old(~m_pc~0)|))) (.cse40 (< |old(~E_M~0)| 2)) (.cse41 (< |old(~E_2~0)| 2))) (and (let ((.cse17 (and .cse25 .cse26 .cse4 (not (= ~m_pc~0 1))))) (let ((.cse0 (not .cse25)) (.cse3 (= 0 ~t1_st~0)) (.cse5 (= 0 ~t3_st~0)) (.cse8 (<= ~t3_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse20 (= ~t2_st~0 0)) (.cse23 (and .cse17 .cse11 (= 0 ~t2_st~0))) (.cse2 (= ~m_pc~0 0)) (.cse18 (<= ~t2_pc~0 0)) (.cse7 (<= |old(~E_3~0)| ~E_3~0)) (.cse9 (= ~token~0 0)) (.cse10 (= ~local~0 0)) (.cse12 (<= |old(~E_M~0)| ~E_M~0)) (.cse13 (<= |old(~E_2~0)| ~E_2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse15 .cse2 .cse16 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= ~T1_E~0 2)) (and .cse0 .cse14 .cse15 .cse2 .cse18 .cse4 .cse7 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) .cse21 (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) .cse22 (and .cse23 .cse2 .cse16 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (not (= 0 |old(~local~0)|)) (not (= ~T3_E~0 2)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse24 (and .cse1 .cse2 .cse16 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~E_3~0 2) .cse2 (= ~t3_pc~0 0) .cse4 (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_pc~0 0) .cse19 .cse20 .cse9 .cse10 (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse23 .cse14 .cse15 .cse2 .cse16 .cse18 .cse7 .cse9 .cse10 .cse12 .cse13)))) (let ((.cse35 (+ |old(~local~0)| 3))) (or .cse27 .cse22 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (< .cse35 |old(~token~0)|) .cse36 .cse37 .cse24 .cse21 .cse38 .cse39 .cse40 .cse41 (< |old(~token~0)| .cse35))) (or .cse27 .cse28 .cse29 (not (= 2 |old(~m_st~0)|)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse21 .cse38 .cse39 .cse40 .cse41))))) [2018-11-18 16:18:05,174 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2018-11-18 16:18:05,174 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 336 414) no Hoare annotation was computed. [2018-11-18 16:18:05,174 INFO L425 ceAbstractionStarter]: For program point L342-1(lines 342 408) no Hoare annotation was computed. [2018-11-18 16:18:05,175 INFO L421 ceAbstractionStarter]: At program point L400(line 400) the Hoare annotation is: (let ((.cse38 (= ~T3_E~0 0)) (.cse35 (= ~T1_E~0 0)) (.cse41 (= ~T2_E~0 0)) (.cse49 (= ~m_i~0 1))) (let ((.cse3 (<= 2 ~t2_st~0)) (.cse21 (<= 2 ~E_3~0)) (.cse0 (= ~t2_pc~0 1)) (.cse26 (<= 2 ~E_2~0)) (.cse20 (= 1 ~m_pc~0)) (.cse1 (= ~t1_pc~0 1)) (.cse32 (and (and (and (not .cse38) (not .cse35) (not .cse41) .cse49 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse16 (= ~m_st~0 2)) (.cse6 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~t1_st~0))) (let ((.cse31 (not (= 0 |old(~m_st~0)|))) (.cse10 (let ((.cse50 (+ ~local~0 2))) (and .cse3 (and (<= 2 ~E_M~0) (and .cse21 .cse0 .cse26 (and (= 1 ~t3_pc~0) .cse20 .cse1 .cse32 .cse16 .cse6))) .cse2 (<= .cse50 ~token~0) (<= ~token~0 .cse50)))) (.cse34 (< |old(~E_1~0)| 2)) (.cse36 (< |old(~t2_st~0)| 2)) (.cse37 (not (= |old(~t1_pc~0)| 1))) (.cse39 (< |old(~t3_st~0)| 2)) (.cse40 (not (= 1 |old(~t3_pc~0)|))) (.cse43 (not (= 1 |old(~t2_pc~0)|))) (.cse44 (< |old(~t1_st~0)| 2)) (.cse13 (not .cse49)) (.cse45 (< |old(~E_3~0)| 2)) (.cse46 (not (= 1 |old(~m_pc~0)|))) (.cse47 (< |old(~E_M~0)| 2)) (.cse48 (< |old(~E_2~0)| 2))) (and (let ((.cse5 (<= ~t3_pc~0 0)) (.cse15 (= 0 ~t2_st~0))) (let ((.cse4 (<= |old(~E_3~0)| ~E_3~0)) (.cse17 (= ~t3_pc~0 0)) (.cse22 (= ~E_M~0 2)) (.cse18 (= ~t2_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse23 (= ~t2_st~0 0)) (.cse24 (= ~E_2~0 2)) (.cse25 (= ~t1_pc~0 0)) (.cse7 (let ((.cse33 (= eval_~tmp~0 1))) (or (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse33) (and (= ~m_pc~0 1) .cse16 .cse33)))) (.cse27 (and .cse5 .cse20 .cse1 .cse32 .cse16 .cse6 .cse15)) (.cse14 (<= ~t2_pc~0 0)) (.cse29 (<= ~token~0 ~local~0)) (.cse30 (<= ~local~0 ~token~0)) (.cse11 (not .cse1)) (.cse12 (= 0 ~t1_st~0)) (.cse9 (<= |old(~E_2~0)| ~E_2~0)) (.cse8 (<= |old(~E_M~0)| ~E_M~0))) (or (not (= ~T1_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (and .cse11 .cse0 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse13 (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse6) .cse21 .cse22 .cse23 .cse24 .cse25) (and (= ~E_3~0 2) .cse17 (= ~E_1~0 2) .cse22 .cse18 .cse19 .cse23 .cse24 .cse25 .cse7) (not (= 0 |old(~local~0)|)) (and .cse21 .cse26 .cse2 .cse27 .cse14 .cse8) (not (= ~T3_E~0 2)) (let ((.cse28 (+ ~local~0 1))) (and (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse2 .cse8 (and .cse21 .cse0 .cse26 .cse27))) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 1 ~t1_i~0)) (and (and .cse21 (and .cse26 (and .cse5 .cse20 .cse1 .cse16 .cse12 .cse6 .cse15))) .cse29 .cse14 .cse8 .cse30) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse3 .cse21 .cse0 .cse26 (and .cse5 .cse20 .cse1 .cse16 .cse6) .cse2 .cse8) .cse31 (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse3 (and .cse21 .cse0 (and .cse26 (and .cse5 .cse20 .cse16 .cse12 .cse6))) .cse29 .cse8 .cse30) (and .cse3 (and .cse21 .cse0 (and .cse11 .cse5 .cse20 .cse16 .cse12 .cse6) .cse9) .cse8)))) (let ((.cse42 (+ |old(~local~0)| 3))) (or .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (< .cse42 |old(~token~0)|) .cse43 .cse44 .cse31 .cse13 .cse45 .cse10 .cse46 .cse47 .cse48 (< |old(~token~0)| .cse42))) (or .cse34 .cse35 .cse36 (not (= 2 |old(~m_st~0)|)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse13 .cse45 .cse46 .cse47 .cse48))))) [2018-11-18 16:18:05,177 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-11-18 16:18:05,177 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 336 414) the Hoare annotation is: (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse4 (= ~T3_E~0 0)) (.cse15 (< |old(~t3_st~0)| 2)) (.cse5 (not (= 1 |old(~t3_pc~0)|))) (.cse6 (= ~T2_E~0 0)) (.cse7 (not (= 1 |old(~t2_pc~0)|))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse10 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse19 (= ~t2_pc~0 1)) (.cse20 (= 1 ~t3_pc~0)) (.cse21 (= ~t1_pc~0 1)) (.cse23 (<= |old(~t3_st~0)| ~t3_st~0)) (.cse24 (= |old(~E_M~0)| ~E_M~0)) (.cse25 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= |old(~E_3~0)| ~E_3~0)) (.cse28 (= 1 ~m_pc~0)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (not (= ~m_i~0 1))) (.cse17 (not (= 0 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t3_st~0 2) .cse9 .cse10 .cse11 (or (not (= 2 |old(~t3_st~0)|)) .cse12 .cse13) .cse14) (let ((.cse16 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 (< .cse16 |old(~token~0)|) .cse7 .cse8 .cse17 .cse9 (let ((.cse22 (+ ~local~0 3))) (and .cse18 .cse19 .cse20 .cse21 (<= .cse22 ~token~0) .cse23 .cse24 .cse25 (= ~token~0 |old(~token~0)|) (<= ~token~0 .cse22) .cse26 .cse27 (= 0 ~m_st~0) .cse28 .cse29)) .cse10 .cse12 .cse11 .cse14 (< |old(~token~0)| .cse16))) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse14 (and .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 (= ~m_st~0 2) .cse26 .cse27 .cse28 .cse29)) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse9 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse17 (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,178 INFO L425 ceAbstractionStarter]: For program point L380(lines 342 408) no Hoare annotation was computed. [2018-11-18 16:18:05,179 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2018-11-18 16:18:05,179 INFO L425 ceAbstractionStarter]: For program point L347-1(lines 342 408) no Hoare annotation was computed. [2018-11-18 16:18:05,179 INFO L421 ceAbstractionStarter]: At program point L409(lines 336 414) the Hoare annotation is: (let ((.cse2 (= ~T3_E~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse26 (= ~m_i~0 1))) (let ((.cse23 (= ~m_st~0 2)) (.cse27 (<= 2 ~E_3~0)) (.cse28 (<= 2 ~t3_st~0)) (.cse20 (= ~t2_pc~0 1)) (.cse21 (= 1 ~t3_pc~0)) (.cse22 (= ~t1_pc~0 1)) (.cse29 (and (and (not .cse2) (not .cse0) (not .cse3) .cse26) (not (= ~E_3~0 0)))) (.cse30 (<= 2 ~t1_st~0)) (.cse31 (<= 2 ~t2_st~0)) (.cse32 (<= 2 ~E_M~0)) (.cse33 (<= 2 ~E_2~0)) (.cse24 (= 1 ~m_pc~0)) (.cse25 (<= 2 ~E_1~0))) (let ((.cse1 (let ((.cse34 (+ ~local~0 3))) (and .cse27 .cse28 .cse20 .cse21 (<= ~token~0 .cse34) .cse22 .cse29 .cse30 .cse31 .cse32 (<= .cse34 ~token~0) .cse33 (= 0 ~m_st~0) .cse24 .cse25))) (.cse9 (and .cse27 .cse28 .cse20 .cse21 .cse22 .cse29 .cse30 .cse23 .cse31 .cse32 .cse33 .cse24 .cse25)) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse7 (< |old(~E_1~0)| 2)) (.cse8 (< |old(~t2_st~0)| 2)) (.cse19 (not (= 2 |old(~m_st~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 1))) (.cse11 (< |old(~t3_st~0)| 2)) (.cse12 (not (= 1 |old(~t3_pc~0)|))) (.cse13 (not (= 1 |old(~t2_pc~0)|))) (.cse5 (< |old(~t1_st~0)| 2)) (.cse15 (not .cse26)) (.cse16 (< |old(~E_3~0)| 2)) (.cse17 (not (= 1 |old(~m_pc~0)|))) (.cse6 (< |old(~E_M~0)| 2)) (.cse18 (< |old(~E_2~0)| 2))) (and (let ((.cse4 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 (< .cse4 |old(~token~0)|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse4))) (or .cse7 .cse0 .cse8 .cse10 .cse2 .cse12 .cse3 .cse13 .cse5 (= ~t3_st~0 2) .cse15 .cse16 .cse6 (or (not (= 2 |old(~t3_st~0)|)) .cse17 .cse19) .cse18) (or (not (= ~T1_E~0 2)) .cse15 (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~local~0)|)) .cse1 (not (= ~T3_E~0 2)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse9 (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) .cse14 (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0))) (or .cse7 .cse0 (and (<= |old(~t2_st~0)| ~t2_st~0) .cse20 .cse21 .cse22 .cse23 (<= |old(~E_3~0)| ~E_3~0) .cse24 (<= |old(~t3_st~0)| ~t3_st~0) .cse25 (<= |old(~E_M~0)| ~E_M~0) (<= |old(~t1_st~0)| ~t1_st~0) (<= |old(~E_2~0)| ~E_2~0)) .cse8 .cse19 .cse10 .cse2 .cse11 .cse12 .cse3 .cse13 .cse5 .cse15 .cse16 .cse17 .cse6 .cse18))))) [2018-11-18 16:18:05,181 INFO L421 ceAbstractionStarter]: At program point L343(line 343) the Hoare annotation is: (let ((.cse4 (= ~T3_E~0 0)) (.cse1 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse64 (= ~m_i~0 1))) (let ((.cse49 (= 0 ~t2_st~0)) (.cse67 (+ ~local~0 1)) (.cse41 (= 1 ~t3_pc~0)) (.cse48 (= 1 ~m_pc~0)) (.cse30 (= ~t1_pc~0 1)) (.cse62 (and (and (and (not .cse4) (not .cse1) (not .cse6) .cse64 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse47 (= ~m_st~0 2)) (.cse43 (<= 2 ~E_1~0))) (let ((.cse26 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse43)) (.cse34 (= 0 ~t3_st~0)) (.cse56 (<= ~token~0 ~local~0)) (.cse19 (<= 2 ~t2_st~0)) (.cse42 (= 0 ~t1_st~0)) (.cse57 (<= ~local~0 ~token~0)) (.cse51 (<= ~token~0 .cse67)) (.cse53 (<= .cse67 ~token~0)) (.cse20 (<= 2 ~E_M~0)) (.cse61 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse43 .cse49)) (.cse21 (<= 2 ~E_3~0)) (.cse22 (<= 2 ~t3_st~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~E_2~0)) (.cse25 (<= 2 ~t1_st~0))) (let ((.cse17 (and .cse51 .cse53 (and .cse20 (and .cse61 .cse21 .cse22 .cse23 .cse24) .cse25))) (.cse18 (and .cse56 (and .cse19 .cse20 (and (and .cse24 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse42 .cse43)) .cse21 .cse22 .cse23)) .cse57)) (.cse29 (let ((.cse66 (+ ~local~0 2))) (and .cse19 (and .cse20 .cse21 .cse23 .cse24 .cse26 .cse34) .cse25 (<= .cse66 ~token~0) (<= ~token~0 .cse66)))) (.cse15 (let ((.cse65 (+ ~local~0 3))) (and .cse21 .cse22 .cse23 .cse41 (<= ~token~0 .cse65) .cse30 .cse62 .cse25 .cse19 .cse20 (<= .cse65 ~token~0) .cse24 (= 0 ~m_st~0) .cse48 .cse43))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse36 (<= |old(~E_3~0)| ~E_3~0)) (.cse33 (<= |old(~E_M~0)| ~E_M~0)) (.cse44 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse27 (< |old(~t3_st~0)| 2)) (.cse5 (not (= 1 |old(~t3_pc~0)|))) (.cse7 (not (= 1 |old(~t2_pc~0)|))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse9 (not .cse64)) (.cse10 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 (= ~t3_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= 2 |old(~t3_st~0)|)) .cse12 .cse13) .cse14) (let ((.cse16 (+ |old(~local~0)| 3))) (or .cse1 .cse15 .cse4 .cse6 (< .cse16 |old(~token~0)|) .cse8 .cse11 .cse17 .cse0 .cse2 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse3 .cse27 .cse5 .cse7 .cse28 .cse9 .cse10 .cse12 .cse14 .cse29 (< |old(~token~0)| .cse16))) (let ((.cse55 (<= ~t3_pc~0 0)) (.cse58 (= ~m_st~0 0)) (.cse59 (= ~m_pc~0 0)) (.cse60 (= ~local~0 0))) (let ((.cse37 (= ~t2_st~0 0)) (.cse39 (let ((.cse63 (= eval_~tmp~0 1))) (or (and .cse58 .cse59 (= ~token~0 0) .cse60 .cse63) (and (= ~m_pc~0 1) .cse47 .cse63)))) (.cse45 (= ~E_M~0 2)) (.cse46 (= ~E_3~0 2)) (.cse32 (= ~E_1~0 2)) (.cse31 (= ~t3_pc~0 0)) (.cse35 (= ~t2_pc~0 0)) (.cse38 (= ~E_2~0 2)) (.cse50 (= ~t1_pc~0 0)) (.cse40 (not .cse30)) (.cse54 (<= ~t2_pc~0 0)) (.cse52 (and .cse55 .cse48 .cse30 .cse62 .cse47 .cse43 .cse49))) (or (and .cse30 .cse31 .cse32 .cse33 (= ~t1_st~0 2) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse40 .cse22 .cse23 .cse41 .cse42 .cse19 .cse36 .cse43 .cse39 .cse33 .cse44) (not (= ~T1_E~0 2)) (and (and .cse35 .cse45 (and .cse32 .cse46 (and .cse47 .cse31) .cse48 .cse42 .cse49) .cse38 .cse50) .cse34) (and .cse51 (and .cse21 (and .cse23 .cse24 .cse52)) .cse53 .cse25 .cse33 .cse34) (and .cse40 .cse41 .cse54 .cse43 .cse33 .cse22 .cse36 (= ~t1_st~0 0) .cse37 .cse39 .cse44) (and .cse40 .cse23 .cse42 .cse34 .cse19 .cse36 .cse55 .cse43 .cse39 .cse33 .cse44) .cse17 (and .cse22 .cse41 .cse30 .cse25 .cse54 .cse49 .cse36 .cse43 .cse39 .cse33 .cse44) .cse18 (and .cse19 (and .cse21 (and .cse23 (and .cse40 .cse55 .cse48 .cse47 .cse42 .cse43) .cse44)) .cse33 .cse34) (and .cse22 .cse23 .cse41 .cse30 .cse25 .cse19 .cse36 .cse43 .cse39 .cse33 .cse44) (and .cse19 (and (and .cse40 .cse41 .cse48 .cse47 .cse42 .cse43) .cse21 .cse22 .cse23 .cse44) .cse33) (and .cse23 .cse30 .cse25 .cse34 .cse19 .cse36 .cse55 .cse39 .cse43 .cse33 .cse44) .cse9 .cse29 (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and (and .cse21 (and .cse24 (and .cse55 .cse48 .cse30 .cse47 .cse42 .cse43 .cse49))) .cse56 .cse54 .cse33 .cse57 .cse34) (and (and (and .cse45 (and .cse42 (and .cse46 .cse58) .cse49 (and .cse32 .cse59 .cse31))) .cse35 .cse60 .cse38 .cse50) .cse56 .cse57 .cse34) (and .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse33) (not (= 0 |old(~local~0)|)) .cse15 (not (= ~T3_E~0 2)) (not (= |old(~t1_pc~0)| 0)) (and (and .cse21 .cse22 (and (and .cse41 .cse48 .cse47 .cse42 .cse43 .cse49) .cse24)) .cse56 .cse54 .cse33 .cse57) (not (= 2 |old(~E_3~0)|)) (and (and .cse61 .cse21 .cse22 .cse44) .cse25 .cse54 .cse33) (not (= 1 ~t1_i~0)) (and .cse19 (and .cse21 (and .cse23 (and .cse24 (and .cse55 .cse48 .cse47 .cse42 .cse43)))) .cse56 .cse33 .cse57 .cse34) (and (and .cse21 .cse22 (and .cse40 .cse41 .cse48 .cse47 .cse42 .cse43 .cse49) .cse44) .cse54 .cse33) (not (= ~T2_E~0 2)) (and .cse19 .cse21 .cse25 (and .cse23 .cse24 (and .cse55 .cse48 .cse30 .cse47 .cse43)) .cse33 .cse34) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse25 .cse54 (and .cse21 (and .cse52 .cse44)) .cse33 .cse34) .cse28 (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0))))) (or .cse0 (and (<= |old(~t2_st~0)| ~t2_st~0) .cse23 .cse36 (<= |old(~t3_st~0)| ~t3_st~0) (and (= ~m_st~0 |old(~m_st~0)|) .cse41 .cse48 .cse30 .cse43) .cse33 (<= |old(~t1_st~0)| ~t1_st~0) .cse44) .cse1 .cse2 .cse13 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse14)))))) [2018-11-18 16:18:05,187 INFO L421 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse36 (= 1 ~m_pc~0)) (.cse51 (= ~t1_pc~0 1)) (.cse5 (= ~T3_E~0 0)) (.cse2 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse52 (= ~m_i~0 1))) (let ((.cse21 (<= 2 ~t2_st~0)) (.cse32 (<= 2 ~E_3~0)) (.cse28 (<= 2 ~t3_st~0)) (.cse19 (= ~t2_pc~0 1)) (.cse33 (and .cse36 .cse51 (and (and (and (not .cse5) (not .cse2) (not .cse8) .cse52 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0))))) (.cse29 (= 1 ~t3_pc~0)) (.cse34 (= ~m_st~0 2)) (.cse24 (<= 2 ~E_1~0)) (.cse35 (<= 2 ~E_2~0)) (.cse37 (<= ~token~0 ~local~0)) (.cse38 (<= ~local~0 ~token~0))) (let ((.cse1 (and (and .cse21 (<= 2 ~E_M~0) (and .cse32 .cse28 .cse19 (and (and .cse33 .cse29 .cse34 .cse24) .cse35))) .cse37 .cse38)) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (< |old(~t3_st~0)| 2)) (.cse7 (not (= 1 |old(~t3_pc~0)|))) (.cse10 (not (= 1 |old(~t2_pc~0)|))) (.cse11 (< |old(~t1_st~0)| 2)) (.cse13 (not .cse52)) (.cse14 (< |old(~E_3~0)| 2)) (.cse15 (not (= 1 |old(~m_pc~0)|))) (.cse16 (< |old(~E_M~0)| 2)) (.cse17 (< |old(~E_2~0)| 2))) (and (let ((.cse9 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 |old(~token~0)|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse9))) (let ((.cse49 (= ~m_pc~0 1)) (.cse45 (= ~m_st~0 0)) (.cse47 (= ~m_pc~0 0))) (let ((.cse30 (<= ~t2_pc~0 0)) (.cse23 (<= ~t3_pc~0 0)) (.cse18 (not .cse51)) (.cse22 (<= |old(~E_3~0)| ~E_3~0)) (.cse26 (<= |old(~E_M~0)| ~E_M~0)) (.cse27 (<= |old(~E_2~0)| ~E_2~0)) (.cse42 (= ~E_3~0 2)) (.cse40 (= ~E_1~0 2)) (.cse46 (let ((.cse50 (= ~t3_pc~0 0))) (or (and .cse49 .cse34 .cse50) (and .cse45 .cse47 .cse50)))) (.cse39 (= ~E_M~0 2)) (.cse20 (= 0 ~t3_st~0)) (.cse31 (= 0 ~t2_st~0)) (.cse41 (= ~t2_pc~0 0)) (.cse43 (= ~E_2~0 2)) (.cse44 (= ~t1_pc~0 0)) (.cse25 (let ((.cse48 (= eval_~tmp~0 1))) (or (and .cse45 .cse47 (= ~token~0 0) (= ~local~0 0) .cse48) (and .cse49 .cse34 .cse48))))) (or .cse1 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (not (= ~T1_E~0 2)) (and .cse18 .cse28 .cse29 .cse30 .cse31 .cse22 .cse24 .cse25 .cse26 .cse27) (and (and .cse32 (and (and .cse33 .cse23 .cse34 .cse24 .cse31) .cse35)) .cse30 .cse26 .cse20) .cse13 (and (and .cse32 .cse28 (and .cse29 .cse36 .cse34 .cse24 .cse31) .cse27) .cse30 .cse26) (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse21 (and .cse32 (and (and .cse18 .cse23 .cse36 .cse34 .cse24) .cse19 .cse27)) .cse26 .cse20) (and .cse21 (and (and .cse19 (and .cse35 (and .cse33 .cse23 .cse34 .cse24))) .cse32) .cse37 .cse26 .cse38 .cse20) (and .cse21 .cse26 (and .cse32 .cse28 .cse19 (and .cse18 .cse29 .cse36 .cse34 .cse24) .cse27)) (not (= 0 |old(~local~0)|)) (not (= ~T3_E~0 2)) (and .cse18 .cse28 .cse19 .cse29 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 1 ~t1_i~0)) (and .cse39 (and .cse40 (and .cse41 .cse42 (= ~t2_st~0 0) .cse43 .cse44 (= ~t3_st~0 0)) (not .cse45) .cse46)) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) .cse12 (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and .cse42 .cse40 .cse46 .cse39 .cse20 .cse31 .cse41 .cse43 .cse44 .cse25)))) (or .cse0 .cse2 .cse3 (not (= 2 |old(~m_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2018-11-18 16:18:05,190 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 404) no Hoare annotation was computed. [2018-11-18 16:18:05,190 INFO L425 ceAbstractionStarter]: For program point L352(lines 342 408) no Hoare annotation was computed. [2018-11-18 16:18:05,190 INFO L425 ceAbstractionStarter]: For program point L369(lines 369 376) no Hoare annotation was computed. [2018-11-18 16:18:05,191 INFO L421 ceAbstractionStarter]: At program point L394(lines 342 408) the Hoare annotation is: (let ((.cse4 (= ~T3_E~0 0)) (.cse1 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse64 (= ~m_i~0 1))) (let ((.cse49 (= 0 ~t2_st~0)) (.cse67 (+ ~local~0 1)) (.cse41 (= 1 ~t3_pc~0)) (.cse48 (= 1 ~m_pc~0)) (.cse30 (= ~t1_pc~0 1)) (.cse62 (and (and (and (not .cse4) (not .cse1) (not .cse6) .cse64 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse47 (= ~m_st~0 2)) (.cse43 (<= 2 ~E_1~0))) (let ((.cse26 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse43)) (.cse34 (= 0 ~t3_st~0)) (.cse56 (<= ~token~0 ~local~0)) (.cse19 (<= 2 ~t2_st~0)) (.cse42 (= 0 ~t1_st~0)) (.cse57 (<= ~local~0 ~token~0)) (.cse51 (<= ~token~0 .cse67)) (.cse53 (<= .cse67 ~token~0)) (.cse20 (<= 2 ~E_M~0)) (.cse61 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse43 .cse49)) (.cse21 (<= 2 ~E_3~0)) (.cse22 (<= 2 ~t3_st~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (<= 2 ~E_2~0)) (.cse25 (<= 2 ~t1_st~0))) (let ((.cse17 (and .cse51 .cse53 (and .cse20 (and .cse61 .cse21 .cse22 .cse23 .cse24) .cse25))) (.cse18 (and .cse56 (and .cse19 .cse20 (and (and .cse24 (and .cse41 .cse48 .cse30 .cse62 .cse47 .cse42 .cse43)) .cse21 .cse22 .cse23)) .cse57)) (.cse29 (let ((.cse66 (+ ~local~0 2))) (and .cse19 (and .cse20 .cse21 .cse23 .cse24 .cse26 .cse34) .cse25 (<= .cse66 ~token~0) (<= ~token~0 .cse66)))) (.cse15 (let ((.cse65 (+ ~local~0 3))) (and .cse21 .cse22 .cse23 .cse41 (<= ~token~0 .cse65) .cse30 .cse62 .cse25 .cse19 .cse20 (<= .cse65 ~token~0) .cse24 (= 0 ~m_st~0) .cse48 .cse43))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse36 (<= |old(~E_3~0)| ~E_3~0)) (.cse33 (<= |old(~E_M~0)| ~E_M~0)) (.cse44 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse27 (< |old(~t3_st~0)| 2)) (.cse5 (not (= 1 |old(~t3_pc~0)|))) (.cse7 (not (= 1 |old(~t2_pc~0)|))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse9 (not .cse64)) (.cse10 (< |old(~E_3~0)| 2)) (.cse12 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_M~0)| 2)) (.cse14 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 (= ~t3_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= 2 |old(~t3_st~0)|)) .cse12 .cse13) .cse14) (let ((.cse16 (+ |old(~local~0)| 3))) (or .cse1 .cse15 .cse4 .cse6 (< .cse16 |old(~token~0)|) .cse8 .cse11 .cse17 .cse0 .cse2 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse3 .cse27 .cse5 .cse7 .cse28 .cse9 .cse10 .cse12 .cse14 .cse29 (< |old(~token~0)| .cse16))) (let ((.cse55 (<= ~t3_pc~0 0)) (.cse58 (= ~m_st~0 0)) (.cse59 (= ~m_pc~0 0)) (.cse60 (= ~local~0 0))) (let ((.cse37 (= ~t2_st~0 0)) (.cse39 (let ((.cse63 (= eval_~tmp~0 1))) (or (and .cse58 .cse59 (= ~token~0 0) .cse60 .cse63) (and (= ~m_pc~0 1) .cse47 .cse63)))) (.cse45 (= ~E_M~0 2)) (.cse46 (= ~E_3~0 2)) (.cse32 (= ~E_1~0 2)) (.cse31 (= ~t3_pc~0 0)) (.cse35 (= ~t2_pc~0 0)) (.cse38 (= ~E_2~0 2)) (.cse50 (= ~t1_pc~0 0)) (.cse40 (not .cse30)) (.cse54 (<= ~t2_pc~0 0)) (.cse52 (and .cse55 .cse48 .cse30 .cse62 .cse47 .cse43 .cse49))) (or (and .cse30 .cse31 .cse32 .cse33 (= ~t1_st~0 2) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse40 .cse22 .cse23 .cse41 .cse42 .cse19 .cse36 .cse43 .cse39 .cse33 .cse44) (not (= ~T1_E~0 2)) (and (and .cse35 .cse45 (and .cse32 .cse46 (and .cse47 .cse31) .cse48 .cse42 .cse49) .cse38 .cse50) .cse34) (and .cse51 (and .cse21 (and .cse23 .cse24 .cse52)) .cse53 .cse25 .cse33 .cse34) (and .cse40 .cse41 .cse54 .cse43 .cse33 .cse22 .cse36 (= ~t1_st~0 0) .cse37 .cse39 .cse44) (and .cse40 .cse23 .cse42 .cse34 .cse19 .cse36 .cse55 .cse43 .cse39 .cse33 .cse44) .cse17 (and .cse22 .cse41 .cse30 .cse25 .cse54 .cse49 .cse36 .cse43 .cse39 .cse33 .cse44) .cse18 (and .cse19 (and .cse21 (and .cse23 (and .cse40 .cse55 .cse48 .cse47 .cse42 .cse43) .cse44)) .cse33 .cse34) (and .cse22 .cse23 .cse41 .cse30 .cse25 .cse19 .cse36 .cse43 .cse39 .cse33 .cse44) (and .cse19 (and (and .cse40 .cse41 .cse48 .cse47 .cse42 .cse43) .cse21 .cse22 .cse23 .cse44) .cse33) (and .cse23 .cse30 .cse25 .cse34 .cse19 .cse36 .cse55 .cse39 .cse43 .cse33 .cse44) .cse9 .cse29 (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and (and .cse21 (and .cse24 (and .cse55 .cse48 .cse30 .cse47 .cse42 .cse43 .cse49))) .cse56 .cse54 .cse33 .cse57 .cse34) (and (and (and .cse45 (and .cse42 (and .cse46 .cse58) .cse49 (and .cse32 .cse59 .cse31))) .cse35 .cse60 .cse38 .cse50) .cse56 .cse57 .cse34) (and .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse33) (not (= 0 |old(~local~0)|)) .cse15 (not (= ~T3_E~0 2)) (not (= |old(~t1_pc~0)| 0)) (and (and .cse21 .cse22 (and (and .cse41 .cse48 .cse47 .cse42 .cse43 .cse49) .cse24)) .cse56 .cse54 .cse33 .cse57) (not (= 2 |old(~E_3~0)|)) (and (and .cse61 .cse21 .cse22 .cse44) .cse25 .cse54 .cse33) (not (= 1 ~t1_i~0)) (and .cse19 (and .cse21 (and .cse23 (and .cse24 (and .cse55 .cse48 .cse47 .cse42 .cse43)))) .cse56 .cse33 .cse57 .cse34) (and (and .cse21 .cse22 (and .cse40 .cse41 .cse48 .cse47 .cse42 .cse43 .cse49) .cse44) .cse54 .cse33) (not (= ~T2_E~0 2)) (and .cse19 .cse21 .cse25 (and .cse23 .cse24 (and .cse55 .cse48 .cse30 .cse47 .cse43)) .cse33 .cse34) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse25 .cse54 (and .cse21 (and .cse52 .cse44)) .cse33 .cse34) .cse28 (not (= 1 ~t3_i~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0))))) (or .cse0 (and (<= |old(~t2_st~0)| ~t2_st~0) .cse23 .cse36 (<= |old(~t3_st~0)| ~t3_st~0) (and (= ~m_st~0 |old(~m_st~0)|) .cse41 .cse48 .cse30 .cse43) .cse33 (<= |old(~t1_st~0)| ~t1_st~0) .cse44) .cse1 .cse2 .cse13 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse14)))))) [2018-11-18 16:18:05,204 INFO L421 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse5 (= ~T3_E~0 0)) (.cse2 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse50 (= ~m_i~0 1))) (let ((.cse19 (= 1 ~t3_pc~0)) (.cse20 (= 1 ~m_pc~0)) (.cse29 (= ~t1_pc~0 1)) (.cse49 (and (and (and (not .cse5) (not .cse2) (not .cse8) .cse50 (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_3~0 0)))) (.cse21 (= ~m_st~0 2)) (.cse23 (<= 2 ~E_1~0))) (let ((.cse30 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~E_3~0)) (.cse25 (<= 2 ~t3_st~0)) (.cse39 (= ~t2_pc~0 1)) (.cse38 (<= 2 ~E_2~0)) (.cse47 (and .cse19 .cse20 .cse29 .cse49 .cse21 .cse23))) (let ((.cse1 (let ((.cse51 (+ ~local~0 1))) (and (and (<= 2 ~E_M~0) .cse30 (and .cse24 .cse25 .cse39 .cse38 .cse47)) (<= ~token~0 .cse51) (<= .cse51 ~token~0)))) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (< |old(~t3_st~0)| 2)) (.cse7 (not (= 1 |old(~t3_pc~0)|))) (.cse10 (not (= 1 |old(~t2_pc~0)|))) (.cse11 (< |old(~t1_st~0)| 2)) (.cse13 (not .cse50)) (.cse14 (< |old(~E_3~0)| 2)) (.cse15 (not (= 1 |old(~m_pc~0)|))) (.cse16 (< |old(~E_M~0)| 2)) (.cse17 (< |old(~E_2~0)| 2))) (and (let ((.cse9 (+ |old(~local~0)| 3))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse9 |old(~token~0)|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse9))) (let ((.cse42 (= ~m_pc~0 1)) (.cse35 (<= ~t3_pc~0 0))) (let ((.cse36 (<= ~token~0 ~local~0)) (.cse37 (<= ~local~0 ~token~0)) (.cse33 (and .cse35 .cse20 .cse29 .cse49 .cse21 .cse23)) (.cse40 (= ~E_3~0 2)) (.cse44 (= ~E_M~0 2)) (.cse34 (= 0 ~t3_st~0)) (.cse46 (= ~t1_pc~0 0)) (.cse43 (= ~t2_pc~0 0)) (.cse45 (= ~E_2~0 2)) (.cse41 (= ~t3_pc~0 0)) (.cse18 (not .cse29)) (.cse22 (= 0 ~t1_st~0)) (.cse27 (<= ~t2_pc~0 0)) (.cse31 (<= |old(~E_3~0)| ~E_3~0)) (.cse32 (let ((.cse48 (= eval_~tmp~0 1))) (or (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse48) (and .cse42 .cse21 .cse48)))) (.cse28 (<= |old(~E_M~0)| ~E_M~0)) (.cse26 (<= |old(~E_2~0)| ~E_2~0))) (or (not (= ~T1_E~0 2)) (and (and (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26) .cse27 .cse28) (and .cse25 .cse19 .cse29 .cse30 .cse27 .cse31 .cse23 .cse32 .cse28 .cse26) (and (and (and .cse33 .cse26) .cse24) .cse30 .cse27 .cse28 .cse34) .cse13 (and (and .cse24 (and (and .cse35 .cse20 .cse29 .cse21 .cse22 .cse23) .cse26)) .cse36 .cse27 .cse28 .cse37 .cse34) (and .cse36 (and (and .cse38 (and .cse19 .cse20 .cse21 .cse22 .cse23)) .cse24 .cse25) .cse27 .cse28 .cse37) (and (and .cse24 (and .cse39 .cse38 .cse33)) .cse30 .cse28 .cse34) (not (= 2 ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~local~0)|)) (not (= ~T3_E~0 2)) (not (= |old(~t1_pc~0)| 0)) (not (= 2 |old(~E_3~0)|)) (not (= 1 ~t1_i~0)) .cse1 (and (and (and .cse40 .cse21 .cse41 .cse22 .cse23) (and .cse42 .cse43 .cse44 .cse45 .cse46)) .cse34) (not (= ~T2_E~0 2)) (not (= 0 |old(~t3_st~0)|)) (not (= 2 |old(~E_M~0)|)) (and .cse40 .cse41 (= ~E_1~0 2) .cse44 .cse34 .cse43 (= ~t1_st~0 0) .cse45 .cse46 .cse32) .cse12 (and .cse31 .cse23 .cse32 .cse28 (and .cse43 .cse29 .cse45 .cse41 (= ~t1_st~0 2) (= ~t3_st~0 0))) (not (= 1 ~t3_i~0)) (and (and .cse24 .cse25 .cse47 .cse26) .cse30 .cse27 .cse28) (not (= 2 |old(~E_1~0)|)) (and .cse18 .cse25 .cse19 .cse22 .cse27 .cse31 .cse23 .cse32 .cse28 .cse26) (not (= 1 ~t2_i~0))))) (or .cse0 .cse2 .cse3 (not (= 2 |old(~m_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17)))))) [2018-11-18 16:18:05,210 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2018-11-18 16:18:05,210 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredEXIT(lines 251 269) no Hoare annotation was computed. [2018-11-18 16:18:05,210 INFO L425 ceAbstractionStarter]: For program point L255(lines 255 264) no Hoare annotation was computed. [2018-11-18 16:18:05,212 INFO L428 ceAbstractionStarter]: At program point is_transmit3_triggeredENTRY(lines 251 269) the Hoare annotation is: true [2018-11-18 16:18:05,212 INFO L425 ceAbstractionStarter]: For program point L255-2(lines 255 264) no Hoare annotation was computed. [2018-11-18 16:18:05,212 INFO L425 ceAbstractionStarter]: For program point is_transmit3_triggeredFINAL(lines 251 269) no Hoare annotation was computed. [2018-11-18 16:18:05,213 INFO L421 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse41 (= ~t1_pc~0 1)) (.cse20 (= 1 ~m_pc~0)) (.cse17 (= 0 ~m_st~0)) (.cse42 (+ ~local~0 1))) (let ((.cse25 (= 0 ~E_M~0)) (.cse30 (< ~token~0 .cse42)) (.cse31 (< .cse42 ~token~0)) (.cse27 (not .cse17)) (.cse21 (< ~E_1~0 2)) (.cse22 (not (= 2 ~m_st~0))) (.cse32 (= 0 ~E_2~0)) (.cse40 (= is_transmit3_triggered_~__retres1~3 0)) (.cse35 (not (= 2 ~E_2~0))) (.cse34 (not (= ~t1_pc~0 0))) (.cse33 (not (= 2 ~E_3~0))) (.cse38 (not (= 0 ~m_pc~0))) (.cse37 (not (= 0 ~t3_pc~0))) (.cse39 (not (= 2 ~E_M~0))) (.cse36 (not (= 0 ~t2_pc~0))) (.cse18 (< 0 ~t2_pc~0)) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse19 (not (= 0 ~t2_st~0))) (.cse28 (not (= 0 ~t3_st~0))) (.cse9 (not (= ~t1_st~0 0))) (.cse29 (< 0 ~t3_pc~0)) (.cse11 (not (= 1 ~t2_pc~0))) (.cse23 (< ~t1_st~0 2)) (.cse1 (< ~t2_st~0 2)) (.cse13 (< ~E_3~0 2)) (.cse14 (< ~E_M~0 2)) (.cse10 (= 0 is_transmit3_triggered_~__retres1~3)) (.cse16 (< ~E_2~0 2)) (.cse6 (< ~t3_st~0 2)) (.cse7 (not (= 1 ~t3_pc~0))) (.cse0 (= ~T1_E~0 0)) (.cse12 (not (= ~m_i~0 1))) (.cse24 (not .cse20)) (.cse15 (= 0 ~E_1~0)) (.cse3 (not .cse41)) (.cse5 (= ~T3_E~0 0)) (.cse8 (= ~T2_E~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (or .cse21 .cse0 .cse1 .cse22 .cse3 .cse5 .cse7 .cse8 .cse11 .cse23 .cse12 .cse10 .cse13 .cse24 .cse16 .cse25) (let ((.cse26 (+ ~local~0 3))) (or .cse21 .cse0 .cse1 .cse3 .cse5 .cse10 .cse7 .cse8 (< .cse26 ~token~0) .cse11 .cse23 .cse27 .cse12 .cse13 .cse24 .cse16 .cse25 (< ~token~0 .cse26))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse23 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse10 .cse3 .cse5 .cse8 .cse28 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse20) (or .cse21 .cse0 .cse10 .cse22 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse30 .cse12 .cse19 .cse13 .cse24 .cse14 .cse31 .cse32) (or .cse21 .cse0 .cse22 .cse3 .cse5 .cse8 .cse28 .cse10 .cse11 .cse30 .cse12 .cse19 .cse13 .cse24 .cse14 .cse29 .cse31 .cse32) (or .cse0 .cse18 .cse3 .cse5 .cse8 .cse28 .cse23 .cse12 .cse19 .cse13 .cse14 .cse10 .cse15 .cse16 .cse29 .cse17 .cse20) (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 1 ~t3_i~0)) .cse12 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (or .cse33 .cse28) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) .cse34 .cse27 .cse19 .cse35 (not (= 0 ~local~0)) .cse36 .cse37 .cse38 .cse39 .cse9) .cse40) (or .cse0 .cse18 .cse5 .cse41 .cse6 .cse7 .cse8 .cse9 .cse40 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (or .cse11 .cse1 .cse13 .cse14 (or .cse0 .cse12 .cse24 .cse15 .cse3 .cse5 .cse8 .cse9) .cse2 .cse10 .cse4 .cse16 .cse6 .cse7) (or .cse0 .cse1 .cse5 .cse41 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (or .cse23 .cse14 (or .cse21 .cse0 (= 0 ~E_3~0) .cse22 .cse3 .cse5 .cse8 .cse11 .cse12 .cse24 .cse16 .cse29) .cse28 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse10 .cse20) (or .cse21 .cse0 .cse1 .cse22 .cse3 .cse5 .cse8 .cse28 .cse11 .cse12 .cse10 .cse13 .cse24 .cse14 .cse29 .cse32) (or .cse21 .cse0 .cse18 .cse22 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse19 .cse13 .cse24 .cse14 .cse32) (or .cse21 .cse0 .cse1 .cse22 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse10 .cse24 .cse14 .cse32) (or .cse21 .cse0 .cse18 .cse10 .cse22 .cse3 .cse5 .cse8 .cse28 .cse12 .cse19 .cse13 .cse24 .cse14 .cse29 .cse32) (or .cse0 .cse40 .cse35 .cse5 .cse8 .cse9 .cse34 .cse33 .cse38 .cse28 .cse37 .cse39 (not (= 1 ~E_1~0)) .cse12 .cse19 .cse17 .cse36) (or .cse0 .cse18 .cse10 .cse3 .cse5 .cse6 .cse7 .cse8 .cse23 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (or .cse0 .cse10 .cse18 .cse2 .cse3 .cse4 .cse5 .cse8 .cse28 .cse9 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse20) (or .cse10 .cse0 .cse1 .cse5 .cse41 .cse8 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse20) (or .cse11 .cse23 .cse1 .cse13 .cse14 .cse10 .cse16 .cse6 .cse7 (or .cse0 .cse12 .cse24 .cse15 .cse3 .cse5 .cse8))))) [2018-11-18 16:18:05,213 INFO L425 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-11-18 16:18:05,215 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 704) no Hoare annotation was computed. [2018-11-18 16:18:05,215 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 653 711) no Hoare annotation was computed. [2018-11-18 16:18:05,216 INFO L425 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-11-18 16:18:05,216 INFO L421 ceAbstractionStarter]: At program point L663(line 663) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,216 INFO L421 ceAbstractionStarter]: At program point L661(line 661) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,216 INFO L421 ceAbstractionStarter]: At program point L661-1(line 661) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,216 INFO L421 ceAbstractionStarter]: At program point L690(line 690) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,219 INFO L421 ceAbstractionStarter]: At program point L690-1(line 690) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,220 INFO L421 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,223 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,224 INFO L421 ceAbstractionStarter]: At program point L680-1(line 680) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,226 INFO L421 ceAbstractionStarter]: At program point L676(line 676) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,226 INFO L425 ceAbstractionStarter]: For program point L676-1(line 676) no Hoare annotation was computed. [2018-11-18 16:18:05,226 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 653 711) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,226 INFO L421 ceAbstractionStarter]: At program point L672(line 672) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse2 (<= 2 ~t2_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse7 (<= 2 ~E_1~0)) (.cse1 (= 0 ~m_st~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (= ~t1_pc~0 1)) (.cse8 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse9 (<= |old(~E_2~0)| ~E_2~0)) (.cse10 (<= 2 ~E_3~0)) (.cse11 (<= 2 ~t3_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and (= ~E_3~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) .cse1 (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (and .cse2 (and .cse3 (and (and .cse4 .cse5 .cse6 (= ~m_st~0 2) .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13) (not (= 2 |old(~E_1~0)|)) (let ((.cse14 (+ ~local~0 3))) (and .cse2 .cse3 (<= .cse14 ~token~0) (and (and .cse4 .cse7 (and .cse1 .cse5 .cse6 .cse8) .cse9) .cse10 .cse11 .cse12) (<= ~token~0 .cse14) .cse13)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,229 INFO L425 ceAbstractionStarter]: For program point L672-1(line 672) no Hoare annotation was computed. [2018-11-18 16:18:05,229 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 705) no Hoare annotation was computed. [2018-11-18 16:18:05,229 INFO L421 ceAbstractionStarter]: At program point L668-2(lines 665 705) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse2 (<= 2 ~t2_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~t3_pc~0)) (.cse7 (<= 2 ~E_1~0)) (.cse1 (= 0 ~m_st~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (= ~t1_pc~0 1)) (.cse8 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse9 (<= |old(~E_2~0)| ~E_2~0)) (.cse10 (<= 2 ~E_3~0)) (.cse11 (<= 2 ~t3_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and (= ~E_3~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) .cse1 (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (and .cse2 (and .cse3 (and (and .cse4 .cse5 .cse6 (= ~m_st~0 2) .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13) (not (= 2 |old(~E_1~0)|)) (let ((.cse14 (+ ~local~0 3))) (and .cse2 .cse3 (<= .cse14 ~token~0) (and (and .cse4 .cse7 (and .cse1 .cse5 .cse6 .cse8) .cse9) .cse10 .cse11 .cse12) (<= ~token~0 .cse14) .cse13)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,230 INFO L421 ceAbstractionStarter]: At program point L664(line 664) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,232 INFO L421 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~t3_pc~0 0) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_3~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t3_st~0 0) (= ~t2_st~0 0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 1 ~t3_i~0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 16:18:05,233 INFO L421 ceAbstractionStarter]: At program point L691(line 691) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,233 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 696) no Hoare annotation was computed. [2018-11-18 16:18:05,233 INFO L421 ceAbstractionStarter]: At program point L687-1(lines 687 696) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,237 INFO L425 ceAbstractionStarter]: For program point L685(line 685) no Hoare annotation was computed. [2018-11-18 16:18:05,237 INFO L421 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (let ((.cse0 (= ~m_i~0 1))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (= 1 ~t3_pc~0)) (.cse6 (<= 2 ~E_1~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (and (and (and (not (= ~T3_E~0 0)) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) .cse0) (not (= ~E_M~0 0))) (not (= ~E_1~0 0)))) (.cse8 (<= |old(~E_2~0)| ~E_2~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (<= 2 ~t3_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~t1_st~0))) (or (not (= |old(~T3_E~0)| 2)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 1 ~t3_i~0)) (not .cse0) (and .cse1 (and .cse2 (and (and .cse3 .cse4 .cse5 (= ~m_st~0 2) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11)) .cse12) (not (= 2 |old(~E_1~0)|)) (let ((.cse13 (+ ~local~0 3))) (and .cse1 .cse2 (<= .cse13 ~token~0) (and (and .cse3 .cse6 (and (= 0 ~m_st~0) .cse4 .cse5 .cse7) .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse13) .cse12)) (not (= 1 ~t2_i~0)) (or (not (= 2 |old(~E_3~0)|)) (not (= 0 |old(~t3_st~0)|))) (not (= 2 |old(~M_E~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_2~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~t3_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 16:18:05,237 INFO L428 ceAbstractionStarter]: At program point L706(lines 653 711) the Hoare annotation is: true [2018-11-18 16:18:05,237 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 270 277) no Hoare annotation was computed. [2018-11-18 16:18:05,237 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 270 277) the Hoare annotation is: true [2018-11-18 16:18:05,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:18:05,237 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~E_3~0 2) (= ~T1_E~0 2) (= ~E_M~0 2) (= ~m_pc~0 0) (= ~t3_pc~0 0) (= ~t3_st~0 0) (= ~M_E~0 2) (= ~E_1~0 2) (= ~t2_pc~0 0) (not (= ~m_i~0 1)) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= 0 ~m_st~0) (= ~T3_E~0 2) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) [2018-11-18 16:18:05,237 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:18:05,238 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:18:05,239 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 622 633) no Hoare annotation was computed. [2018-11-18 16:18:05,239 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 622 633) no Hoare annotation was computed. [2018-11-18 16:18:05,239 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 622 633) the Hoare annotation is: (or (not (= ~T3_E~0 2)) (not (= ~T1_E~0 2)) (= |old(~m_i~0)| 1) (not (= ~T2_E~0 2)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (or (not (= 2 ~E_3~0)) (not (= 0 ~t3_st~0))) (not (= 2 ~M_E~0)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 ~m_st~0)) (not (= 0 ~t2_st~0)) (not (= 2 ~E_2~0)) (not (= 0 ~local~0)) (not (= 0 ~t2_pc~0)) (not (= 0 ~t3_pc~0)) (not (= 0 ~m_pc~0)) (not (= 2 ~E_M~0)) (not (= ~t1_st~0 0)))) [2018-11-18 16:18:05,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:18:05 BoogieIcfgContainer [2018-11-18 16:18:05,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:18:05,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:18:05,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:18:05,332 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:18:05,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:07" (3/4) ... [2018-11-18 16:18:05,339 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit3 [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 16:18:05,344 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:18:05,345 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 16:18:05,346 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit3_triggered [2018-11-18 16:18:05,346 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 16:18:05,346 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 16:18:05,346 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 16:18:05,357 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-18 16:18:05,358 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 16:18:05,382 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(T3_E) == 2) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(1 == t3_i)) || !(m_i == 1)) || (((((((((((((((((E_3 == 2 && m_pc == 0) && t3_pc == 0) && E_1 == 2) && T1_E == 2) && E_M == 2) && t3_st == 0) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && 0 == m_st) && T3_E == 2) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((2 <= t2_st && 2 <= E_M && ((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 2 <= E_1) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_1 == 0)) && \old(E_2) <= E_2) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= t1_st)) || !(2 == \old(E_1))) || (((((2 <= t2_st && 2 <= E_M) && local + 3 <= token) && (((((1 == t3_pc && 2 <= E_1) && ((0 == m_st && 1 == m_pc) && t1_pc == 1) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_1 == 0)) && \old(E_2) <= E_2) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && token <= local + 3) && 2 <= t1_st)) || !(1 == t2_i)) || !(2 == \old(E_3)) || !(0 == \old(t3_st))) || !(2 == \old(M_E))) || (((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) [2018-11-18 16:18:05,382 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || t3_st == 2) || !(\old(t1_pc) == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || \old(E_M) < 2) || (!(2 == \old(t3_st)) || !(1 == \old(m_pc))) || !(2 == \old(m_st))) || \old(E_2) < 2) && ((((((((((((((((((((((T1_E == 0 || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || T3_E == 0) || T2_E == 0) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || \old(E_M) < 2) || ((token <= local + 1 && local + 1 <= token) && (2 <= E_M && (((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st)) || \old(E_1) < 2) || \old(t2_st) < 2) || ((token <= local && (2 <= t2_st && 2 <= E_M) && (((2 <= E_2 && (((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && local <= token)) || (((((((2 <= t2_st && 2 <= E_M) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1)) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || ((((2 <= t2_st && ((((2 <= E_M && 2 <= E_3) && t2_pc == 1) && 2 <= E_2) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t3_st) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && t3_pc == 0) && E_1 == 2) && \old(E_M) <= E_M) && t1_st == 2) && 0 == t3_st) && t2_pc == 0) && \old(E_3) <= E_3) && t2_st == 0) && E_2 == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || !(T1_E == 2)) || (((((t2_pc == 0 && E_M == 2) && ((((E_1 == 2 && E_3 == 2) && m_st == 2 && t3_pc == 0) && 1 == m_pc) && 0 == t1_st) && 0 == t2_st) && E_2 == 2) && t1_pc == 0) && 0 == t3_st)) || (((((token <= local + 1 && 2 <= E_3 && (t2_pc == 1 && 2 <= E_2) && (((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && local + 1 <= token) && 2 <= t1_st) && \old(E_M) <= E_M) && 0 == t3_st)) || ((((((((((!(t1_pc == 1) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && \old(E_M) <= E_M) && 2 <= t3_st) && \old(E_3) <= E_3) && t1_st == 0) && t2_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((((((!(t1_pc == 1) && t2_pc == 1) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && t3_pc <= 0) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((token <= local + 1 && local + 1 <= token) && (2 <= E_M && (((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((2 <= t3_st && 1 == t3_pc) && t1_pc == 1) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((token <= local && (2 <= t2_st && 2 <= E_M) && (((2 <= E_2 && (((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && local <= token)) || (((2 <= t2_st && 2 <= E_3 && (t2_pc == 1 && ((((!(t1_pc == 1) && t3_pc <= 0) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && \old(E_2) <= E_2) && \old(E_M) <= E_M) && 0 == t3_st)) || ((((((((((2 <= t3_st && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && 2 <= t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((2 <= t2_st && ((((((((!(t1_pc == 1) && 1 == t3_pc) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && \old(E_2) <= E_2) && \old(E_M) <= E_M)) || ((((((((((t2_pc == 1 && t1_pc == 1) && 2 <= t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || !(m_i == 1)) || ((((2 <= t2_st && ((((2 <= E_M && 2 <= E_3) && t2_pc == 1) && 2 <= E_2) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t3_st) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(2 == M_E)) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || ((((((2 <= E_3 && 2 <= E_2 && (((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && token <= local) && t2_pc <= 0) && \old(E_M) <= E_M) && local <= token) && 0 == t3_st)) || ((((((((E_M == 2 && ((0 == t1_st && E_3 == 2 && m_st == 0) && 0 == t2_st) && (E_1 == 2 && m_pc == 0) && t3_pc == 0) && t2_pc == 0) && local == 0) && E_2 == 2) && t1_pc == 0) && token <= local) && local <= token) && 0 == t3_st)) || (((((((2 <= t2_st && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && \old(E_M) <= E_M)) || !(0 == \old(local))) || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || !(T3_E == 2)) || !(\old(t1_pc) == 0)) || ((((((2 <= E_3 && 2 <= t3_st) && (((((1 == t3_pc && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && 2 <= E_2) && token <= local) && t2_pc <= 0) && \old(E_M) <= E_M) && local <= token)) || !(2 == \old(E_3))) || ((((((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && \old(E_2) <= E_2) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) <= E_M)) || !(1 == t1_i)) || (((((2 <= t2_st && 2 <= E_3 && t2_pc == 1 && 2 <= E_2 && (((t3_pc <= 0 && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && token <= local) && \old(E_M) <= E_M) && local <= token) && 0 == t3_st)) || (((((2 <= E_3 && 2 <= t3_st) && (((((!(t1_pc == 1) && 1 == t3_pc) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && \old(E_2) <= E_2) && t2_pc <= 0) && \old(E_M) <= E_M)) || !(T2_E == 2)) || (((((2 <= t2_st && 2 <= E_3) && 2 <= t1_st) && (t2_pc == 1 && 2 <= E_2) && (((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 2 <= E_1) && \old(E_M) <= E_M) && 0 == t3_st)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || ((((2 <= t1_st && t2_pc <= 0) && 2 <= E_3 && ((((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && \old(E_2) <= E_2) && \old(E_M) <= E_M) && 0 == t3_st)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i))) && ((((((((((((((((\old(E_1) < 2 || (((((((\old(t2_st) <= t2_st && t2_pc == 1) && \old(E_3) <= E_3) && \old(t3_st) <= t3_st) && (((m_st == \old(m_st) && 1 == t3_pc) && 1 == m_pc) && t1_pc == 1) && 2 <= E_1) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_M) < 2) || \old(E_2) < 2) [2018-11-18 16:18:05,383 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E == 0 || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || T3_E == 0) || T2_E == 0) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || \old(E_M) < 2) || \old(E_1) < 2) || \old(t2_st) < 2) || ((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && m_st == 2) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1)) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(token) < \old(local) + 3) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || t3_st == 2) || !(m_i == 1)) || \old(E_3) < 2) || \old(E_M) < 2) || (!(2 == \old(t3_st)) || !(1 == \old(m_pc))) || !(2 == \old(m_st))) || \old(E_2) < 2)) && (((((((((((((((((!(T1_E == 2) || !(m_i == 1)) || !(2 == M_E)) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(0 == \old(local))) || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || !(T3_E == 2)) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && m_st == 2) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((\old(t2_st) <= t2_st && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_st == 2) && \old(E_3) <= E_3) && 1 == m_pc) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_M) < 2) || \old(E_2) < 2) [2018-11-18 16:18:05,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || ((((((\old(t2_st) <= t2_st && token == \old(token)) && 2 <= E_1 && (((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && token <= local) && \old(t1_st) <= t1_st) && local <= token) && 0 == t3_st)) || !(0 == \old(m_pc))) && (((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((((\old(E_1) == E_1 && m_st == \old(m_st)) && m_pc == 0) && 0 == t3_st) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || ((((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local + 3) && (\old(E_1) == E_1 && m_st == \old(m_st)) && 1 == m_pc) && local + 3 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || \old(token) < \old(local) + 3)) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || (\old(t2_st) <= t2_st && \old(t3_st) <= t3_st && ((m_st == \old(m_st) && ((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && 0 == t1_st) && 2 <= E_1)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || (((((((2 <= E_1 && (((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && token <= local) && \old(t1_st) <= t1_st) && local <= token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || (((((((m_st == \old(m_st) && t1_st == 0) && m_pc == 0) && E_1 == 2) && t3_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((\old(t2_st) <= t2_st && ((m_st == \old(m_st) && ((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && 0 == t1_st) && 2 <= E_1) && 0 == t3_st)) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || ((((m_pc == 0 && ((\old(E_1) == E_1 && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && \old(t3_st) <= t3_st)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || ((((token == \old(token) && token <= local) && (((((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc))) [2018-11-18 16:18:05,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || (((((((token <= local && \old(t3_st) <= t3_st) && 2 <= E_1) && 0 == t1_st) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st) && 1 == m_pc)) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((2 <= E_1 && m_st == 2) && 0 == t3_st) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || (((((((token <= local && 2 <= E_1) && 0 == t1_st) && m_st == 2) && 0 == t3_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((2 <= E_1 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 0 == t3_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || (((((E_1 == 2 && m_st == 2) && t3_st == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((((((((((!(T2_E == 0) && t1_pc == 1) && m_i == 1) && token <= local) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= E_2) && \old(t3_st) <= t3_st) && 2 <= E_1) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st)) || \old(token) < \old(local) + 3)) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || (((((2 <= E_1 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st) && 0 == t3_st) && 1 == m_pc)) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((((((((((!(T2_E == 0) && t1_pc == 1) && m_i == 1) && token <= local) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || \old(t3_st) < 2) || !(1 == t3_pc)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= E_2) && \old(t3_st) <= t3_st) && 2 <= E_1) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) [2018-11-18 16:18:05,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || ((((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local + 3) && (\old(E_1) == E_1 && m_st == \old(m_st)) && 1 == m_pc) && local + 3 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc))) [2018-11-18 16:18:05,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || ((((((m_st == 0 && token == 0) && 0 == t3_st) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) && (((((((((((((m_st == 2 && 0 == t3_st) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st) || T1_E == 0) || T3_E == 0) || T2_E == 0) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(2 == E_1)) || (((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((0 == t2_st && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)))) && (((((((((((((((((((0 == t2_st && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(E_2) <= E_2) || E_1 < 2) || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || \old(E_2) < 2) || ((m_pc == 1 && m_st == 2) && t3_st == 0) || ((m_pc == 1 && t3_st == 2) && m_st == 2))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2) || ((((\old(t2_st) <= t2_st && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && ((1 == t3_pc && m_st == 2) && 2 <= E_1) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(E_2) <= E_2))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || (((\old(t2_st) <= t2_st && ((((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 2 <= E_2) && \old(t1_st) <= t1_st) && 0 == t3_st)) || ((((((2 <= E_2 && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && token <= \old(token) + 1) && local + 1 <= token) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || ((((\old(t2_st) <= t2_st && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && ((1 == t3_pc && m_st == 2) && 2 <= E_1) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0))) || ((((((0 == t2_st && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)))) && ((((0 < t2_pc || E_M < 2) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || ((((2 <= E_2 && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((T1_E == 0 || ((((((\old(t2_st) <= t2_st && ((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && 0 == t3_st) && token <= local) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((((((((((((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && 0 == t2_st) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2) || T1_E == 0) || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || ((((\old(t2_st) <= t2_st && 0 == t3_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 < t3_pc)) && ((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((\old(t2_st) <= t2_st && ((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((E_1 < 2 || T1_E == 0) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || ((E_2 == 2 && t1_pc == 0) && (((m_pc == 1 && m_st == 2) && t3_st == 0) || ((m_pc == 1 && t3_st == 2) && m_st == 2)))) || !(0 == \old(t2_st))) || E_3 < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) [2018-11-18 16:18:05,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t3_st == 0 || t3_st == 2) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || (((((((t1_pc == 1 && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t3_st) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st)) || \old(token) < local) || !(0 == \old(t3_st)))) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2)) && ((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && ((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || (((((t1_pc == 1 && m_st == 2) && t1_st == 2) && 0 == t3_st) && t2_st == 0) && E_2 == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(2 == E_1)) || (((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || t3_st == 0 || t3_st == 2) || E_3 < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2) || 0 < t3_pc) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && \old(E_2) <= E_2))) && ((((((((((((((T1_E == 0 || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && 0 == t3_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && (((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || ((((((t1_pc == 1 && t1_st == 2) && 0 == t3_st) && t2_st == 0) && 0 == m_st) && token == 0) && E_2 == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || (((((((t1_pc == 1 && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || E_M < 2) || local < \old(token)) || \old(token) < local) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2))) && ((((0 < t2_pc || E_M < 2) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && m_st == 2) && 0 == t3_st) && 0 == t2_st)) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || !(0 == \old(t3_st))) [2018-11-18 16:18:05,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) && (((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || (((((\old(t2_st) <= t2_st && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token)) || E_M < 2) || local < \old(token)) || \old(token) < local)) && ((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(T2_E == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || (((((\old(t2_st) <= t2_st && 0 == t3_st) && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && token <= local) && \old(t1_st) <= t1_st) && local <= token)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || !(0 == \old(t3_st)))) && (((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || ((((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && 0 == t2_st) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st))) && (((((((0 == t3_st && 0 == t2_st) && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && \old(t1_st) <= t1_st) || 0 < t2_pc) || E_M < 2) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || !(0 == \old(t3_st)))) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2) [2018-11-18 16:18:05,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((((\old(t2_st) <= t2_st && t1_st == 2) && t3_st == 0) && \old(E_3) <= E_3) && t2_pc == 0) && 0 == m_st) && token == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) && ((((((\old(t1_st) < 2 || ((((((2 <= E_3 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((2 <= E_3 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || local + 1 < \old(token))) && (((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(2 == \old(E_3))) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_1 < 2) || !(0 == \old(t3_st))) || !(m_i == 1)) || (((((E_3 == 2 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && t2_pc == 0) && t1_st == 0)) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || (((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st)) || E_M < 2) || E_2 < 2)) && (((((((((((((((((E_1 < 2 || ((((((\old(t2_st) <= t2_st && t2_pc <= 0) && 0 == t3_st) && \old(E_3) <= E_3) && token <= local) && local <= token) && m_st == \old(m_st) && 0 == t1_st)) || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || ((((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && \old(E_3) <= E_3)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || ((((((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && m_st == 2) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && \old(E_3) <= E_3) && \old(t2_st) <= t2_st) && t2_pc <= 0) && \old(t1_st) <= t1_st) && 0 == t3_st)) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || t3_st == 2) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || ((((\old(E_3) <= E_3 && \old(t2_st) <= t2_st) && \old(t3_st) <= t3_st) && t2_pc <= 0) && m_st == \old(m_st) && 0 == t1_st))) && (((((((((((E_1 < 2 || T1_E == 0) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (t3_st == 2 && t2_pc == 0)) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(m_i == 1)) || \old(E_3) < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st)))))) && ((((((((((((((T1_E == 0 || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && \old(E_3) <= E_3) && 0 == m_st && 0 == t1_st) && token == 0) && \old(t3_st) <= t3_st)) || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2)) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || ((((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || E_2 < 2)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || E_M < 2) || (((((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && m_st == 2) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && 2 <= E_3) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || ((((((E_3 == 2 && m_st == 0) && \old(t2_st) <= t2_st) && 0 == t3_st) && t2_pc == 0) && t1_st == 0) && token == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || (t2_pc == 0 && t1_st == 2)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) || !(2 == E_1)) || 0 == \old(m_st)) [2018-11-18 16:18:05,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || (((((t2_pc == 1 && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((T1_E == 0 || T3_E == 0) || (t1_st == 2 && t2_st == 2)) || T2_E == 0) || E_M < 2) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) || !(2 == E_1)) || 0 == \old(m_st))) && (((((((((((E_1 < 2 || T1_E == 0) || (t3_st == 2 && m_st == 2)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(m_i == 1)) || \old(E_3) < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st)))))) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || (((((((2 <= E_3 && t2_pc == 1) && token <= local + 2) && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || local + 1 < \old(token)) || (((((2 <= E_3 && t2_pc == 1) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || (((((t2_pc == 1 && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st))) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || ((((((t2_pc == 1 && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || ((((((t2_pc == 1 && token == \old(token)) && m_st == 2) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || E_M < 2) || !(0 == \old(t3_st))) || (((((2 <= E_3 && t2_pc == 1) && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) <= t1_st))) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((((t2_pc == 1 && t1_st == 2) && 0 == t3_st) && t2_st == 2) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_2 < 2) || (t3_st == 2 && m_st == 2))) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || E_2 < 2)) && (((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(2 == \old(E_3))) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_1 < 2) || (((((E_3 == 2 && t2_pc == 1) && m_st == 2) && 0 == t3_st) && t2_st == 2) && t1_st == 0)) || !(0 == \old(t3_st))) || !(m_i == 1)) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || (((((t2_pc == 1 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st)) [2018-11-18 16:18:05,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(2 == \old(E_3))) || !(1 == m_pc) || !(2 == \old(m_st))) || E_1 < 2) || !(0 == \old(t3_st))) || !(m_i == 1))) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || (((((t2_pc == 1 && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_3) == E_3) && 0 == t3_st) && \old(t1_st) <= t1_st)) || E_M < 2) || !(0 == \old(t3_st)))) && (((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || local + 1 < \old(token)) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st))) && ((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || ((((!(\old(t1_st) == 2) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(m_i == 1)) || \old(E_3) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) [2018-11-18 16:18:05,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((E_1 < 2 || (((((0 == t1_st && 0 == t2_st) && m_st == 2) && token <= local) && \old(E_M) <= E_M) && local <= token)) || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && 0 == t2_st) && t3_pc <= 0) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || !(m_i == 1)) || E_3 < 2) || (((\old(t2_st) <= t2_st && m_st == 2) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((\old(t1_st) < 2 || ((((((1 == t3_pc && 2 <= E_M) && \old(t2_st) <= t2_st) && token <= local + 3) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || local + 2 < \old(token)) || (((2 <= E_M && m_st == 2) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((E_M == 2 && t3_pc == 0) && m_st == 2) && t1_st == 0) && t2_st == 0)) || !(0 == t2_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || ((\old(E_M) <= E_M && \old(t1_st) <= t1_st) && (((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && 2 <= E_1) && 0 == t2_st)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token)) || (((token == \old(token) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && (((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && 2 <= E_1) && 0 == t2_st))) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || !(2 == \old(t2_st))) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || \old(E_M) < 2) || ((t3_pc == 0 && t2_st == 2) && \old(t3_st) <= t3_st)) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(0 == \old(t3_pc))) || !(1 == t2_pc)) || !(m_i == 1)) || 0 == \old(m_st))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((\old(t2_st) <= t2_st && 0 == t1_st && (((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && token <= local) && \old(E_M) <= E_M) && local <= token)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((0 == m_st && t3_pc == 0) && \old(t3_st) <= t3_st) && E_M == 2) && t1_st == 0) && t2_st == 0) && token == 0)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && \old(t2_st) <= t2_st) && 0 == t1_st) && t3_pc <= 0) && 0 == m_st) && token == 0)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || ((\old(t2_st) <= t2_st && 0 == t1_st && m_st == \old(m_st)) && \old(E_M) <= E_M)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && \old(t2_st) <= t2_st) && t3_pc <= 0) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 1 == m_pc) [2018-11-18 16:18:05,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && 0 == t2_st)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || (((((E_M == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && t3_st == 2) && t3_pc == 1)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(0 == t2_pc))) && (((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st)) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && t1_st == 0) && t2_st == 0) && 0 == m_st) && token == 0)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((\old(t1_st) < 2 || \old(t2_st) < 2) || (((((((1 == t3_pc && 2 <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && token <= local + 3) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || (((((1 == t3_pc && 2 <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || local + 2 < \old(token)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && 0 == t1_st) && 0 == m_st) && token == 0)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || !(2 == \old(t2_st))) || T2_E == 0) || !(\old(t1_st) == 0)) || (t2_st == 2 && t3_st == 2)) || !(t1_pc == 0)) || !(2 == E_3)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(0 == \old(t3_pc))) || !(1 == t2_pc)) || !(m_i == 1)) || 0 == \old(m_st))) && (((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 0 == t1_st)) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) [2018-11-18 16:18:05,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc))) && ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && ((((((((((((1 == t3_pc && \old(t3_st) <= t3_st) && \old(E_M) == E_M) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || local + 2 < \old(token)) || \old(token) < local + 2)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token))) && ((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(0 == t2_pc))) && ((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) [2018-11-18 16:18:05,452 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70f3e98e-a4f7-40db-abf6-0386c5b76175/bin-2019/utaipan/witness.graphml [2018-11-18 16:18:05,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:18:05,453 INFO L168 Benchmark]: Toolchain (without parser) took 298267.29 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 959.2 MB in the beginning and 905.7 MB in the end (delta: 53.6 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,454 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:18:05,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 940.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,454 INFO L168 Benchmark]: Boogie Preprocessor took 31.49 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. [2018-11-18 16:18:05,454 INFO L168 Benchmark]: RCFGBuilder took 430.42 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,455 INFO L168 Benchmark]: TraceAbstraction took 297392.59 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 905.7 MB in the end (delta: 184.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,455 INFO L168 Benchmark]: Witness Printer took 121.30 ms. Allocated memory is still 4.5 GB. Free memory was 905.7 MB in the beginning and 905.7 MB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2018-11-18 16:18:05,460 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 940.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.49 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 430.42 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 297392.59 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 905.7 MB in the end (delta: 184.5 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 121.30 ms. Allocated memory is still 4.5 GB. Free memory was 905.7 MB in the beginning and 905.7 MB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. 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: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)) || !(2 == \old(E_3))) || !(1 == m_pc) || !(2 == \old(m_st))) || E_1 < 2) || !(0 == \old(t3_st))) || !(m_i == 1))) && (((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || (((((t2_pc == 1 && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_3) == E_3) && 0 == t3_st) && \old(t1_st) <= t1_st)) || E_M < 2) || !(0 == \old(t3_st)))) && (((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || local + 1 < \old(token)) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_3) == E_3) && \old(t1_st) <= t1_st))) && ((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || ((((!(\old(t1_st) == 2) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(m_i == 1)) || \old(E_3) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || (((((((token <= local && \old(t3_st) <= t3_st) && 2 <= E_1) && 0 == t1_st) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st) && 1 == m_pc)) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((2 <= E_1 && m_st == 2) && 0 == t3_st) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || (((((((token <= local && 2 <= E_1) && 0 == t1_st) && m_st == 2) && 0 == t3_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((2 <= E_1 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 0 == t3_st) && 1 == m_pc) && local <= token)) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || (((((\old(t3_st) <= t3_st && 2 <= E_1) && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || (((((E_1 == 2 && m_st == 2) && t3_st == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((((((((((!(T2_E == 0) && t1_pc == 1) && m_i == 1) && token <= local) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= E_2) && \old(t3_st) <= t3_st) && 2 <= E_1) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st)) || \old(token) < \old(local) + 3)) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || (((((2 <= E_1 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st) && 0 == t3_st) && 1 == m_pc)) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || (((((((((((((!(T2_E == 0) && t1_pc == 1) && m_i == 1) && token <= local) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(t2_st) <= t2_st) && 0 == t1_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || \old(t3_st) < 2) || !(1 == t3_pc)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || ((((((((((((((((((2 <= E_3 && !(T2_E == 0)) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_i == 1) && 2 <= t1_st) && 2 <= E_M) && 2 <= E_2) && \old(t3_st) <= t3_st) && 2 <= E_1) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st)) || !(0 == \old(m_pc))) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(1 == t2_pc) || t2_st < 2) || E_3 < 2) || E_M < 2) || ((((((T1_E == 0 || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || local < token) || token < local) || E_2 < 2) || t3_st < 2) || !(1 == t3_pc)) || 0 == __retres1) && (((((((((((((((T1_E == 0 || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 0 == __retres1)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc) || 0 == __retres1)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(m_i == 1)) || 0 == __retres1) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || 0 == __retres1) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((0 == __retres1 || !(T3_E == 2)) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == E_3) || !(0 == t3_st)) || !(2 == M_E)) || (((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == t2_st)) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0))) && (((((((((!(1 == t2_pc) || t1_st < 2) || t2_st < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || t3_st < 2) || !(1 == t3_pc)) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || 0 == __retres1)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || 0 == __retres1) || T2_E == 0) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 == __retres1) || token < local + 2)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || 0 == __retres1) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st)) && (((((((((((((((0 == __retres1 || E_1 < 2) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || 0 == __retres1) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || local < token) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || 0 == __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || 0 == __retres1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || !(t1_pc == 0)) || 0 == __retres1) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == m_st) || !(0 == t2_pc))) && ((((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || 0 == __retres1) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(t1_pc == 1)) || 0 == __retres1) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 3) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && 0 == t2_st)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || (((((E_M == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && t3_st == 2) && t3_pc == 1)) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(0 == t2_pc))) && (((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t2_st) && \old(t1_st) <= t1_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t1_st)) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && t1_st == 0) && t2_st == 0) && 0 == m_st) && token == 0)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((\old(t1_st) < 2 || \old(t2_st) < 2) || (((((((1 == t3_pc && 2 <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && token <= local + 3) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || (((((1 == t3_pc && 2 <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || local + 2 < \old(token)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && 0 == t1_st) && 0 == m_st) && token == 0)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || !(2 == \old(t2_st))) || T2_E == 0) || !(\old(t1_st) == 0)) || (t2_st == 2 && t3_st == 2)) || !(t1_pc == 0)) || !(2 == E_3)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(0 == \old(t3_pc))) || !(1 == t2_pc)) || !(m_i == 1)) || 0 == \old(m_st))) && (((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || ((((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 0 == t1_st)) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((1 == t3_pc && \old(E_M) <= E_M) && 2 <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc))) && ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && ((((((((((((1 == t3_pc && \old(t3_st) <= t3_st) && \old(E_M) == E_M) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || local + 2 < \old(token)) || \old(token) < local + 2)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token))) && ((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || !(0 == t2_pc))) && ((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || 0 == __retres1) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == E_3) || !(0 == t3_st)) || !(2 == M_E)) || (((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == t2_st)) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0)) && (((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 0 == __retres1)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || 0 < t2_pc) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || 0 == __retres1) || E_2 < 2) || 0 < t3_pc)) && ((((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((0 == __retres1 || E_1 < 2) || T1_E == 0) || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || token < local + 3)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || 0 == __retres1) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || 0 == __retres1) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && ((((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || __retres1 == 0) || T2_E == 0) || !(t1_st == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == m_st) || !(0 == t2_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 == __retres1) || 0 < t3_pc) || 0 == E_2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 == E_2)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || local + 1 < token) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || 0 == __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((0 == __retres1 || T1_E == 0) || 0 < t2_pc) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || token < local + 2)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || 0 == __retres1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || local + 1 < token) || 0 == E_2) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || 0 == __retres1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) && (((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || 0 == __retres1) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || 0 == __retres1) || !(1 == t3_pc)) || T2_E == 0) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 3)) && (((((((((((((((T1_E == 0 || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || 0 == __retres1) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || local + 1 < token) || 0 == E_2)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || 0 == __retres1) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || local + 1 < token) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == E_3) || !(0 == t3_st)) || !(2 == M_E)) || (((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == t2_st)) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0)) || __retres1 == 0)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || __retres1 == 0) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((((((((!(1 == t2_pc) || t2_st < 2) || E_3 < 2) || E_M < 2) || ((((((T1_E == 0 || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || local < token) || 0 == __retres1) || token < local) || E_2 < 2) || t3_st < 2) || !(1 == t3_pc))) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || 0 == __retres1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((t1_st < 2 || E_M < 2) || ((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || !(0 == t3_st)) || 0 == __retres1)) && (((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || !(m_i == 1)) || 0 == __retres1) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || 0 == E_2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 == E_2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || 0 == __retres1) || !(1 == m_pc)) || E_M < 2) || 0 == E_2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || __retres1 == 0) || !(2 == E_2)) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == m_st) || !(0 == t2_pc))) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || 0 == __retres1) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || 0 == __retres1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((!(1 == t2_pc) || t1_st < 2) || t2_st < 2) || E_3 < 2) || E_M < 2) || 0 == __retres1) || E_2 < 2) || t3_st < 2) || !(1 == t3_pc)) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t3_st == 0 || t3_st == 2) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || (((((((t1_pc == 1 && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t3_st) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st)) || \old(token) < local) || !(0 == \old(t3_st)))) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && 0 == t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2)) && ((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && \old(E_2) <= E_2)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && ((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || (((((t1_pc == 1 && m_st == 2) && t1_st == 2) && 0 == t3_st) && t2_st == 0) && E_2 == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(2 == E_1)) || (((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || t3_st == 0 || t3_st == 2) || E_3 < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2) || 0 < t3_pc) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && \old(E_2) <= E_2))) && ((((((((((((((T1_E == 0 || ((((((t1_pc == 1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && 0 == t3_st) && 0 == m_st) && token == 0) && \old(E_2) <= E_2)) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || (((((t1_pc == 1 && 2 <= t1_st) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && (((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || ((((((t1_pc == 1 && t1_st == 2) && 0 == t3_st) && t2_st == 0) && 0 == m_st) && token == 0) && E_2 == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || (((((((t1_pc == 1 && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || E_M < 2) || local < \old(token)) || \old(token) < local) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2))) && ((((0 < t2_pc || E_M < 2) || (((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_2) && m_st == 2) && 0 == t3_st) && 0 == t2_st)) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || !(0 == \old(t3_st))) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) && (((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || (((((\old(t2_st) <= t2_st && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token)) || E_M < 2) || local < \old(token)) || \old(token) < local)) && ((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(T2_E == 2)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || (((((\old(t2_st) <= t2_st && 0 == t3_st) && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && token <= local) && \old(t1_st) <= t1_st) && local <= token)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || !(0 == \old(t3_st)))) && (((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || ((((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && 0 == t2_st) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st))) && (((((((0 == t3_st && 0 == t2_st) && ((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && \old(E_2) == E_2) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && \old(t1_st) <= t1_st) || 0 < t2_pc) || E_M < 2) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || !(0 == \old(t3_st)))) && (((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || T3_E == 0) || T2_E == 0) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || \old(E_M) < 2) || \old(E_1) < 2) || \old(t2_st) < 2) || ((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && m_st == 2) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1)) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(token) < \old(local) + 3) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || t3_st == 2) || !(m_i == 1)) || \old(E_3) < 2) || \old(E_M) < 2) || (!(2 == \old(t3_st)) || !(1 == \old(m_pc))) || !(2 == \old(m_st))) || \old(E_2) < 2)) && (((((((((((((((((!(T1_E == 2) || !(m_i == 1)) || !(2 == M_E)) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(0 == \old(local))) || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || !(T3_E == 2)) || !(\old(t1_pc) == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && (((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_3 == 0)) && 2 <= t1_st) && m_st == 2) && 2 <= t2_st) && 2 <= E_M) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((\old(t2_st) <= t2_st && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && m_st == 2) && \old(E_3) <= E_3) && 1 == m_pc) && \old(t3_st) <= t3_st) && 2 <= E_1) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_M) < 2) || \old(E_2) < 2) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(T3_E) == 2) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(1 == t3_i)) || !(m_i == 1)) || (((((((((((((((((E_3 == 2 && m_pc == 0) && t3_pc == 0) && E_1 == 2) && T1_E == 2) && E_M == 2) && t3_st == 0) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && 0 == m_st) && T3_E == 2) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((2 <= t2_st && 2 <= E_M && ((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 2 <= E_1) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_1 == 0)) && \old(E_2) <= E_2) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= t1_st)) || !(2 == \old(E_1))) || (((((2 <= t2_st && 2 <= E_M) && local + 3 <= token) && (((((1 == t3_pc && 2 <= E_1) && ((0 == m_st && 1 == m_pc) && t1_pc == 1) && ((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_1 == 0)) && \old(E_2) <= E_2) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && token <= local + 3) && 2 <= t1_st)) || !(1 == t2_i)) || !(2 == \old(E_3)) || !(0 == \old(t3_st))) || !(2 == \old(M_E))) || (((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || (((((t2_pc == 1 && \old(t3_st) <= t3_st) && m_st == 2) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((T1_E == 0 || T3_E == 0) || (t1_st == 2 && t2_st == 2)) || T2_E == 0) || E_M < 2) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) || !(2 == E_1)) || 0 == \old(m_st))) && (((((((((((E_1 < 2 || T1_E == 0) || (t3_st == 2 && m_st == 2)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(m_i == 1)) || \old(E_3) < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st)))))) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || (((((((2 <= E_3 && t2_pc == 1) && token <= local + 2) && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || local + 1 < \old(token)) || (((((2 <= E_3 && t2_pc == 1) && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || (((((t2_pc == 1 && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st))) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || ((((((t2_pc == 1 && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || ((((((t2_pc == 1 && token == \old(token)) && m_st == 2) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3)) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || E_M < 2) || !(0 == \old(t3_st))) || (((((2 <= E_3 && t2_pc == 1) && m_st == 2) && 0 == t3_st) && 2 <= t2_st) && \old(t1_st) <= t1_st))) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((((t2_pc == 1 && t1_st == 2) && 0 == t3_st) && t2_st == 2) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_2 < 2) || (t3_st == 2 && m_st == 2))) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || ((((((t2_pc == 1 && \old(t3_st) <= t3_st) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0)) || E_2 < 2)) && (((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(2 == \old(E_3))) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_1 < 2) || (((((E_3 == 2 && t2_pc == 1) && m_st == 2) && 0 == t3_st) && t2_st == 2) && t1_st == 0)) || !(0 == \old(t3_st))) || !(m_i == 1)) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || (((((t2_pc == 1 && \old(t3_st) <= t3_st) && m_st == 2) && 2 <= t2_st) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st)) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || ((((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local + 3) && (\old(E_1) == E_1 && m_st == \old(m_st)) && 1 == m_pc) && local + 3 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || \old(token) < \old(local) + 3)) && ((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((E_1 < 2 || (((((0 == t1_st && 0 == t2_st) && m_st == 2) && token <= local) && \old(E_M) <= E_M) && local <= token)) || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) && (((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && 0 == t2_st) && t3_pc <= 0) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || !(m_i == 1)) || E_3 < 2) || (((\old(t2_st) <= t2_st && m_st == 2) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((\old(t1_st) < 2 || ((((((1 == t3_pc && 2 <= E_M) && \old(t2_st) <= t2_st) && token <= local + 3) && \old(token) + 1 <= token) && 0 == m_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || \old(E_M) < 2) || local + 2 < \old(token)) || (((2 <= E_M && m_st == 2) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st)) || \old(token) < local + 2)) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || E_1 < 2) || !(0 == \old(t3_pc))) || !(2 == \old(E_M))) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || ((((E_M == 2 && t3_pc == 0) && m_st == 2) && t1_st == 0) && t2_st == 0)) || !(0 == t2_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || ((\old(E_M) <= E_M && \old(t1_st) <= t1_st) && (((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && 2 <= E_1) && 0 == t2_st)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc)) || local + 1 < \old(token)) || (((token == \old(token) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && (((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && 2 <= E_1) && 0 == t2_st))) && (((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || !(2 == \old(t2_st))) || T2_E == 0) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || \old(E_M) < 2) || ((t3_pc == 0 && t2_st == 2) && \old(t3_st) <= t3_st)) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || !(0 == \old(t3_pc))) || !(1 == t2_pc)) || !(m_i == 1)) || 0 == \old(m_st))) && (((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((\old(t2_st) <= t2_st && 0 == t1_st && (((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_st == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_2 == 0)) && token <= local) && \old(E_M) <= E_M) && local <= token)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || !(T2_E == 2)) || ((((((0 == m_st && t3_pc == 0) && \old(t3_st) <= t3_st) && E_M == 2) && t1_st == 0) && t2_st == 0) && token == 0)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == M_E)) || (((((((((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == \old(t3_pc))) || !(0 == m_pc)) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((((((((T1_E == 0 || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && \old(t2_st) <= t2_st) && 0 == t1_st) && t3_pc <= 0) && 0 == m_st) && token == 0)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || t1_pc == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || 1 == m_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || ((\old(t2_st) <= t2_st && 0 == t1_st && m_st == \old(m_st)) && \old(E_M) <= E_M)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || \old(E_M) < 2) || E_2 < 2) || 0 < \old(t3_pc))) && (((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || \old(E_M) < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == \old(m_st))) && (((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)))) || \old(t2_st) < 2) || !(t1_pc == 1)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < \old(t3_pc)) || ((((((\old(t3_st) <= t3_st && \old(E_M) <= E_M) && \old(t2_st) <= t2_st) && t3_pc <= 0) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || 1 == m_pc) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || local + 1 < token) || 0 == E_2) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || __retres1 == 0) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == E_3) || !(0 == t3_st)) || !(2 == M_E)) || (((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == t2_st)) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0))) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || 0 == __retres1) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 0 == __retres1) || 1 <= __retres1) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || t2_st < 2) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == t3_st)) || !(t1_st == 0)) || !(1 == t2_pc)) || 0 == __retres1) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || token < local + 1) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || local + 1 < token) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((0 == __retres1 || E_1 < 2) || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 < t3_pc) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == __retres1) || 0 < t3_pc) || 0 == m_st) || 1 <= __retres1) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || !(2 == E_2)) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(0 == m_pc)) || !(0 == t3_st)) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == E_1)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == m_st) || !(0 == t2_pc)) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || 1 <= __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || 0 == __retres1) || !(t1_pc == 1)) || token < local) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 1 <= __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || 0 == __retres1) || t2_st < 2) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && ((((((((((((t2_st < 2 || local < token) || token < local) || t3_st < 2) || !(1 == t3_pc)) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || 1 <= __retres1) || 0 == __retres1)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || !(t1_pc == 1)) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || local + 3 < token) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 3)) && ((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || t1_pc == 1) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(t1_st == 0)) || 0 == __retres1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_M < 2) || 0 == E_1) || E_2 < 2) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == E_3) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || 0 == __retres1) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || token < local + 2) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_3)) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || ((((((m_st == 0 && token == 0) && 0 == t3_st) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) && (((((((((((((m_st == 2 && 0 == t3_st) && t2_st == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st) || T1_E == 0) || T3_E == 0) || T2_E == 0) || ((((!(\old(t1_pc) == 0) || !(1 == m_pc)) || !(2 == \old(E_2))) || !(2 == \old(m_st))) && (((!(\old(t1_pc) == 0) || !(0 == \old(m_st))) || !(2 == \old(E_2))) || !(0 == m_pc)))) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || !(2 == E_1)) || (((!(2 == E_3) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(0 == t3_pc)) || !(0 == \old(t3_st)))) && (((0 < t2_pc || E_M < 2) || (((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || ((((0 == t2_st && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)))) && (((((((((((((((((((0 == t2_st && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(E_2) <= E_2) || E_1 < 2) || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || \old(E_2) < 2) || ((m_pc == 1 && m_st == 2) && t3_st == 0) || ((m_pc == 1 && t3_st == 2) && m_st == 2))) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || \old(E_2) < 2) || ((((\old(t2_st) <= t2_st && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && ((1 == t3_pc && m_st == 2) && 2 <= E_1) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(E_2) <= E_2))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || (((\old(t2_st) <= t2_st && ((((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 2 <= E_2) && \old(t1_st) <= t1_st) && 0 == t3_st)) || ((((((2 <= E_2 && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && token <= \old(token) + 1) && local + 1 <= token) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((!(1 == t2_pc) || E_1 < 2) || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t2_st) < 2) || E_M < 2) || local < \old(token)) || \old(token) < local) || ((((\old(t2_st) <= t2_st && 2 <= E_2) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && ((1 == t3_pc && m_st == 2) && 2 <= E_1) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0))) || ((((((0 == t2_st && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)))) && ((((0 < t2_pc || E_M < 2) || ((((((E_1 < 2 || (((((T1_E == 0 || !(m_i == 1)) || 0 == E_1) || !(\old(t1_pc) == 1)) || T3_E == 0) || 0 == E_M) || T2_E == 0) || E_3 < 2) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == \old(m_st))) || \old(E_2) < 2) || 0 < t3_pc) || ((((2 <= E_2 && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((T1_E == 0 || ((((((\old(t2_st) <= t2_st && ((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && 0 == t3_st) && token <= local) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || \old(t1_pc) == 1) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2) || 0 < t3_pc)) && (((((((((((((((((((((((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && 0 == t2_st) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2) || T1_E == 0) || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || T3_E == 0) || \old(t1_pc) == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || ((((\old(t2_st) <= t2_st && 0 == t3_st) && (((((((((!(T2_E == 0) && m_i == 1) && !(E_M == 0)) && !(T3_E == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 < t3_pc)) && ((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || \old(t2_st) < 2) || ((((((\old(t2_st) <= t2_st && ((((!(T2_E == 0) && !(T3_E == 0)) && !(T1_E == 0)) && m_st == 0) && m_pc == 0) && local == 0) && token <= local) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(t1_pc) == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || \old(E_2) < 2)) && (((((((((((E_1 < 2 || T1_E == 0) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(2 == E_M)) && ((((!(\old(t1_pc) == 0) || !(2 == \old(E_2))) || !(1 == t3_pc)) || !(0 == t2_pc)) || !(2 == E_M)))) || !(m_i == 1)) || ((E_2 == 2 && t1_pc == 0) && (((m_pc == 1 && m_st == 2) && t3_st == 0) || ((m_pc == 1 && t3_st == 2) && m_st == 2)))) || !(0 == \old(t2_st))) || E_3 < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(0 == \old(t3_st))) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || ((((((\old(t2_st) <= t2_st && token == \old(token)) && 2 <= E_1 && (((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && token <= local) && \old(t1_st) <= t1_st) && local <= token) && 0 == t3_st)) || !(0 == \old(m_pc))) && (((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || (((((((\old(E_1) == E_1 && m_st == \old(m_st)) && m_pc == 0) && 0 == t3_st) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == \old(m_pc)))) && ((((((((((((\old(E_1) < 2 || ((((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local + 3) && (\old(E_1) == E_1 && m_st == \old(m_st)) && 1 == m_pc) && local + 3 <= token) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st)) || \old(t2_st) < 2) || (((((T1_E == 0 || !(m_i == 1)) || !(1 == \old(m_pc))) || !(t1_pc == 1)) || T3_E == 0) || 0 == \old(m_st)) || T2_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(local) + 3 < \old(token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || E_M < 2) || E_2 < 2) || \old(token) < \old(local) + 3)) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || (\old(t2_st) <= t2_st && \old(t3_st) <= t3_st && ((m_st == \old(m_st) && ((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && 0 == t1_st) && 2 <= E_1)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((\old(E_1) < 2 || \old(t2_st) < 2) || \old(t3_st) < 2) || !(1 == t3_pc)) || (((((((2 <= E_1 && (((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && token <= local) && \old(t1_st) <= t1_st) && local <= token)) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_3 < 2) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((((((!(T3_E == 2) || !(T1_E == 2)) || !(2 == E_2) || !(0 == \old(local))) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(2 == E_3)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || (((((((m_st == \old(m_st) && t1_st == 0) && m_pc == 0) && E_1 == 2) && t3_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((\old(t2_st) <= t2_st && ((m_st == \old(m_st) && ((((!(t1_pc == 1) && \old(E_1) == E_1) && !(T2_E == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && 0 == t1_st) && 2 <= E_1) && 0 == t3_st)) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || ((((m_pc == 0 && ((\old(E_1) == E_1 && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && \old(t3_st) <= t3_st)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((\old(E_1) < 2 || !(0 == \old(t2_st))) || ((((((((T1_E == 0 || 0 == E_3) || !(0 == \old(local))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(\old(token) == 0)) || !(m_i == 1)) || 0 == \old(E_1)) || 0 == \old(m_st)) || 0 < t2_pc) || \old(t3_st) < 2) || !(1 == t3_pc)) || \old(t1_st) < 2) || ((((token == \old(token) && token <= local) && (((((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && !(m_pc == 1)) && !(T3_E == 0)) && !(T1_E == 0)) && !(E_3 == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && !(m_st == 0)) && 0 == t2_st) && \old(t3_st) <= t3_st) && \old(t1_st) <= t1_st) && local <= token)) || E_3 < 2) || E_M < 2) || E_2 < 2) || !(0 == \old(m_pc))) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || t1_st < 2) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || __retres1 == 1) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_2 < 2) && ((((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || t3_st < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || __retres1 == 1) || E_M < 2) || E_2 < 2) || local + 1 < token)) && ((((((((((T1_E == 0 || T3_E == 0) || __retres1 == 1) || T2_E == 0) || E_M < 2) || ((((!(0 == m_st) || !(t1_st == 2)) || !(2 == E_2)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || ((!(token == 0) || !(0 == local)) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == t3_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || !(token == 0)) || t1_st < 2) || !(0 == m_st)) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || !(0 == m_pc)) || __retres1 == 1) || local < token) || token < local)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || __retres1 == 1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || E_3 < 2) || E_M < 2) || !(1 == m_pc) || !(2 == m_st)) || E_2 < 2) || 0 < t3_pc)) && ((((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || t1_st < 2) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || __retres1 == 1) || t2_st < 2) || !(t1_pc == 1)) || !(1 == t3_pc)) || t3_st < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || t2_st < 2) || token < local) || __retres1 == 1) || !(0 == t3_st)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < t3_pc) || 0 == m_st)) && (((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || __retres1 == 1) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || t2_st < 2) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2)) && ((((((((((((((((((E_1 < 2 || T1_E == 0) || __retres1 == 1) || !(2 == m_st)) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc) || local + 1 < token)) && (((((((((((!(T3_E == 2) || !(T1_E == 2)) || __retres1 == 1) || !(1 == t1_i)) || !(T2_E == 2)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(2 == E_3) || !(0 == t3_st)) || !(2 == M_E)) || (((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == t2_st)) || !(2 == E_2)) || !(0 == local)) || !(0 == t2_pc)) || !(0 == t3_pc)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0))) && (((((((((((((((T1_E == 0 || __retres1 == 1) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || t2_st < 2) || t1_pc == 1) || !(0 == t3_st)) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 < t3_pc)) && (((((((((((((((((T1_E == 0 || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || t2_st < 2) || token < local) || t3_st < 2) || !(1 == t3_pc)) || __retres1 == 1) || !(1 == t2_pc)) || !(m_i == 1)) || E_3 < 2) || E_2 < 2) || 0 == m_st)) && ((((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || !(t1_pc == 1)) || token < local) || !(0 == t3_st)) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || __retres1 == 1) || E_2 < 2) || 0 < t3_pc) || 0 == m_st)) && (((((((((T1_E == 0 || __retres1 == 1) || T3_E == 0) || T2_E == 0) || !(2 == E_3)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || ((((((!(t1_pc == 0) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == m_st)) || !(0 == t3_pc)) || !(0 == t3_st)) || !(t1_st == 0)) || !(0 == t2_pc))) && (((((((((((((((T1_E == 0 || 0 < t2_pc) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || t1_pc == 1) || !(1 == t3_pc)) || t3_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_2 < 2) || __retres1 == 1)) && ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || __retres1 == 1) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == t3_st)) || t1_st < 2) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T3_E == 0) || !(1 == t3_pc)) || T2_E == 0) || !(0 == t3_st)) || !(1 == t2_pc)) || t1_st < 2) || !(m_i == 1)) || __retres1 == 1) || E_3 < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || token < local + 2)) && (((((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || T3_E == 0) || T2_E == 0) || !(t1_st == 0)) || E_M < 2) || E_1 < 2) || ((!(1 == m_pc) || !(2 == m_st)) && (((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)))) || token < local) || t3_st < 2) || !(1 == t3_pc)) || __retres1 == 1) || !(m_i == 1)) || !(0 == t2_st)) || E_3 < 2) || E_2 < 2) || 0 == m_st) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || t3_st == 2) || !(\old(t1_pc) == 1)) || T3_E == 0) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || \old(E_M) < 2) || (!(2 == \old(t3_st)) || !(1 == \old(m_pc))) || !(2 == \old(m_st))) || \old(E_2) < 2) && ((((((((((((((((((((((T1_E == 0 || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || T3_E == 0) || T2_E == 0) || \old(local) + 3 < \old(token)) || \old(t1_st) < 2) || \old(E_M) < 2) || ((token <= local + 1 && local + 1 <= token) && (2 <= E_M && (((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st)) || \old(E_1) < 2) || \old(t2_st) < 2) || ((token <= local && (2 <= t2_st && 2 <= E_M) && (((2 <= E_2 && (((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && local <= token)) || (((((((2 <= t2_st && 2 <= E_M) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1)) || !(\old(t1_pc) == 1)) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || ((((2 <= t2_st && ((((2 <= E_M && 2 <= E_3) && t2_pc == 1) && 2 <= E_2) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t3_st) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(token) < \old(local) + 3)) && (((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && t3_pc == 0) && E_1 == 2) && \old(E_M) <= E_M) && t1_st == 2) && 0 == t3_st) && t2_pc == 0) && \old(E_3) <= E_3) && t2_st == 0) && E_2 == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && 0 == t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || !(T1_E == 2)) || (((((t2_pc == 0 && E_M == 2) && ((((E_1 == 2 && E_3 == 2) && m_st == 2 && t3_pc == 0) && 1 == m_pc) && 0 == t1_st) && 0 == t2_st) && E_2 == 2) && t1_pc == 0) && 0 == t3_st)) || (((((token <= local + 1 && 2 <= E_3 && (t2_pc == 1 && 2 <= E_2) && (((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && local + 1 <= token) && 2 <= t1_st) && \old(E_M) <= E_M) && 0 == t3_st)) || ((((((((((!(t1_pc == 1) && 1 == t3_pc) && t2_pc <= 0) && 2 <= E_1) && \old(E_M) <= E_M) && 2 <= t3_st) && \old(E_3) <= E_3) && t1_st == 0) && t2_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || ((((((((((!(t1_pc == 1) && t2_pc == 1) && 0 == t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && t3_pc <= 0) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((token <= local + 1 && local + 1 <= token) && (2 <= E_M && (((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st)) || ((((((((((2 <= t3_st && 1 == t3_pc) && t1_pc == 1) && 2 <= t1_st) && t2_pc <= 0) && 0 == t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((token <= local && (2 <= t2_st && 2 <= E_M) && (((2 <= E_2 && (((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && local <= token)) || (((2 <= t2_st && 2 <= E_3 && (t2_pc == 1 && ((((!(t1_pc == 1) && t3_pc <= 0) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && \old(E_2) <= E_2) && \old(E_M) <= E_M) && 0 == t3_st)) || ((((((((((2 <= t3_st && t2_pc == 1) && 1 == t3_pc) && t1_pc == 1) && 2 <= t1_st) && 2 <= t2_st) && \old(E_3) <= E_3) && 2 <= E_1) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || ((2 <= t2_st && ((((((((!(t1_pc == 1) && 1 == t3_pc) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && \old(E_2) <= E_2) && \old(E_M) <= E_M)) || ((((((((((t2_pc == 1 && t1_pc == 1) && 2 <= t1_st) && 0 == t3_st) && 2 <= t2_st) && \old(E_3) <= E_3) && t3_pc <= 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && \old(E_M) <= E_M) && \old(E_2) <= E_2)) || !(m_i == 1)) || ((((2 <= t2_st && ((((2 <= E_M && 2 <= E_3) && t2_pc == 1) && 2 <= E_2) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t3_st) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(2 == M_E)) || (((((!(\old(token) == 0) || !(0 == \old(t2_st))) || !(2 == \old(E_2))) || !(0 == \old(t2_pc))) || !(0 == \old(t3_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || ((((((2 <= E_3 && 2 <= E_2 && (((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && token <= local) && t2_pc <= 0) && \old(E_M) <= E_M) && local <= token) && 0 == t3_st)) || ((((((((E_M == 2 && ((0 == t1_st && E_3 == 2 && m_st == 0) && 0 == t2_st) && (E_1 == 2 && m_pc == 0) && t3_pc == 0) && t2_pc == 0) && local == 0) && E_2 == 2) && t1_pc == 0) && token <= local) && local <= token) && 0 == t3_st)) || (((((((2 <= t2_st && 2 <= E_3) && 2 <= t3_st) && t2_pc == 1) && 2 <= E_2) && 2 <= t1_st) && ((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && \old(E_M) <= E_M)) || !(0 == \old(local))) || ((((((((((((((2 <= E_3 && 2 <= t3_st) && t2_pc == 1) && 1 == t3_pc) && token <= local + 3) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && 2 <= t1_st) && 2 <= t2_st) && 2 <= E_M) && local + 3 <= token) && 2 <= E_2) && 0 == m_st) && 1 == m_pc) && 2 <= E_1)) || !(T3_E == 2)) || !(\old(t1_pc) == 0)) || ((((((2 <= E_3 && 2 <= t3_st) && (((((1 == t3_pc && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && 2 <= E_2) && token <= local) && t2_pc <= 0) && \old(E_M) <= E_M) && local <= token)) || !(2 == \old(E_3))) || ((((((((((((1 == t3_pc && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && 2 <= E_3) && 2 <= t3_st) && \old(E_2) <= E_2) && 2 <= t1_st) && t2_pc <= 0) && \old(E_M) <= E_M)) || !(1 == t1_i)) || (((((2 <= t2_st && 2 <= E_3 && t2_pc == 1 && 2 <= E_2 && (((t3_pc <= 0 && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && token <= local) && \old(E_M) <= E_M) && local <= token) && 0 == t3_st)) || (((((2 <= E_3 && 2 <= t3_st) && (((((!(t1_pc == 1) && 1 == t3_pc) && 1 == m_pc) && m_st == 2) && 0 == t1_st) && 2 <= E_1) && 0 == t2_st) && \old(E_2) <= E_2) && t2_pc <= 0) && \old(E_M) <= E_M)) || !(T2_E == 2)) || (((((2 <= t2_st && 2 <= E_3) && 2 <= t1_st) && (t2_pc == 1 && 2 <= E_2) && (((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && m_st == 2) && 2 <= E_1) && \old(E_M) <= E_M) && 0 == t3_st)) || !(0 == \old(t3_st))) || !(2 == \old(E_M))) || ((((2 <= t1_st && t2_pc <= 0) && 2 <= E_3 && ((((((t3_pc <= 0 && 1 == m_pc) && t1_pc == 1) && (((((!(T3_E == 0) && !(T1_E == 0)) && !(T2_E == 0)) && m_i == 1) && !(E_M == 0)) && !(E_2 == 0)) && !(E_3 == 0)) && m_st == 2) && 2 <= E_1) && 0 == t2_st) && \old(E_2) <= E_2) && \old(E_M) <= E_M) && 0 == t3_st)) || !(0 == \old(m_st))) || !(1 == t3_i)) || !(2 == \old(E_1))) || !(1 == t2_i))) && ((((((((((((((((\old(E_1) < 2 || (((((((\old(t2_st) <= t2_st && t2_pc == 1) && \old(E_3) <= E_3) && \old(t3_st) <= t3_st) && (((m_st == \old(m_st) && 1 == t3_pc) && 1 == m_pc) && t1_pc == 1) && 2 <= E_1) && \old(E_M) <= E_M) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == \old(t3_pc))) || T2_E == 0) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == \old(m_pc))) || \old(E_M) < 2) || \old(E_2) < 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || ((((((\old(t2_st) <= t2_st && t1_st == 2) && t3_st == 0) && \old(E_3) <= E_3) && t2_pc == 0) && 0 == m_st) && token == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) && ((((((\old(t1_st) < 2 || ((((((2 <= E_3 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((2 <= E_3 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(t1_st) <= t1_st)) || \old(token) < local + 1) || (((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || E_M < 2) || local + 1 < \old(token))) && (((((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(2 == \old(E_3))) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_1 < 2) || !(0 == \old(t3_st))) || !(m_i == 1)) || (((((E_3 == 2 && \old(t2_st) <= t2_st) && m_st == 2) && 0 == t3_st) && t2_pc == 0) && t1_st == 0)) || 0 < t3_pc)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || (((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_3) <= E_3) && \old(t1_st) <= t1_st)) || E_M < 2) || E_2 < 2)) && (((((((((((((((((E_1 < 2 || ((((((\old(t2_st) <= t2_st && t2_pc <= 0) && 0 == t3_st) && \old(E_3) <= E_3) && token <= local) && local <= token) && m_st == \old(m_st) && 0 == t1_st)) || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && (((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || ((((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 0 == t1_st) && \old(E_3) <= E_3)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || ((((((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && m_st == 2) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && \old(E_3) <= E_3) && \old(t2_st) <= t2_st) && t2_pc <= 0) && \old(t1_st) <= t1_st) && 0 == t3_st)) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(0 == \old(t3_st))) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || 0 < t3_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(t1_pc == 1)) || t3_st == 2) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || \old(t1_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_M < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st))))) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || T3_E == 0) || t1_pc == 1) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || !(\old(t1_st) == 0)) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_M < 2) || E_2 < 2) || ((((\old(E_3) <= E_3 && \old(t2_st) <= t2_st) && \old(t3_st) <= t3_st) && t2_pc <= 0) && m_st == \old(m_st) && 0 == t1_st))) && (((((((((((E_1 < 2 || T1_E == 0) || T3_E == 0) || \old(t3_st) < 2) || !(1 == t3_pc)) || T2_E == 0) || (t3_st == 2 && t2_pc == 0)) || !(\old(t1_st) == 0)) || (((((!(t1_pc == 0) || !(2 == E_2)) || !(1 == t3_pc)) || !(0 == \old(t2_pc))) || !(2 == E_M)) && ((((!(t1_pc == 0) || !(2 == E_2)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(2 == E_M)))) || !(m_i == 1)) || \old(E_3) < 2) || (((!(1 == m_pc) || !(2 == \old(m_st))) || !(0 == \old(t3_st))) && ((!(2 == \old(t3_st)) || !(1 == m_pc)) || !(2 == \old(m_st)))))) && ((((((((((((((T1_E == 0 || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && \old(E_3) <= E_3) && 0 == m_st && 0 == t1_st) && token == 0) && \old(t3_st) <= t3_st)) || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || !(\old(t1_st) == 0)) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || t1_pc == 1) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || E_2 < 2)) && ((((((((((((((T1_E == 0 || 0 < \old(t2_pc)) || T3_E == 0) || T2_E == 0) || \old(t1_st) < 2) || E_M < 2) || E_1 < 2) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(t1_pc == 1)) || !(1 == t3_pc)) || \old(t3_st) < 2) || !(m_i == 1)) || \old(E_3) < 2) || ((((((t2_pc <= 0 && \old(t3_st) <= t3_st) && \old(t2_st) <= t2_st) && \old(E_3) <= E_3) && 0 == m_st) && token == 0) && \old(t1_st) <= t1_st)) || E_2 < 2)) && ((((\old(t1_st) < 2 || ((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T3_E == 0) || T2_E == 0) || !(1 == \old(t2_pc))) || !(m_i == 1)) || \old(E_3) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 < t3_pc) || E_M < 2) || (((((((((((((((m_st == \old(m_st) && !(T2_E == 0)) && t1_pc == 1) && m_i == 1) && !(E_M == 0)) && m_st == 2) && !(T3_E == 0)) && !(T1_E == 0)) && t3_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && 2 <= E_3) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && 0 == t3_st)) || !(0 == \old(t3_st)))) && ((((((((((((((((((!(2 == E_2) || !(T3_E == 2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || ((((((E_3 == 2 && m_st == 0) && \old(t2_st) <= t2_st) && 0 == t3_st) && t2_pc == 0) && t1_st == 0) && token == 0)) || !(2 == \old(E_3))) || !(1 == t1_i)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(0 == \old(t3_st))) || !(0 == t3_pc)) || !(2 == E_M)) || !(1 == t3_i)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((T1_E == 0 || T3_E == 0) || T2_E == 0) || E_M < 2) || (t2_pc == 0 && t1_st == 2)) || ((((((((!(\old(t1_st) == 2) || !(1 == m_pc)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) && (((((((!(0 == \old(m_st)) || !(\old(t1_st) == 2)) || !(2 == E_2)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || !(0 == t3_pc)) || !(0 == \old(t3_st))) || !(0 == m_pc)))) || !(m_i == 1)) || \old(E_3) < 2) || !(2 == E_1)) || 0 == \old(m_st)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 210 locations, 1 error locations. SAFE Result, 297.2s OverallTime, 44 OverallIterations, 5 TraceHistogramMax, 169.4s AutomataDifference, 0.0s DeadEndRemovalTime, 84.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 15895 SDtfs, 25595 SDslu, 108088 SDs, 0 SdLazy, 54052 SolverSat, 7641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.6s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 13183 GetRequests, 11398 SyntacticMatches, 90 SemanticMatches, 1695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78482 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25505occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.4s AbstIntTime, 30 AbstIntIterations, 13 AbstIntStrong, 0.9925083094140555 AbsIntWeakeningRatio, 0.6062910473556862 AbsIntAvgWeakeningVarsNumRemoved, 19.489111648807466 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 44 MinimizatonAttempts, 10709 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 86606 PreInvPairs, 87250 NumberOfFragments, 52953 HoareAnnotationTreeSize, 86606 FomulaSimplifications, 10794253 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2983715 FormulaSimplificationTreeSizeReductionInter, 76.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 14175 NumberOfCodeBlocks, 14175 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 18696 ConstructedInterpolants, 0 QuantifiedInterpolants, 6618926 SizeOfPredicates, 22 NumberOfNonLiveVariables, 20695 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 78 InterpolantComputations, 35 PerfectInterpolantSequences, 11120/11873 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...