./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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 e3d58fadf54daed6107b58402b79d250d23d0301 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:39:46,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:39:46,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:39:46,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:39:46,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:39:46,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:39:46,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:39:46,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:39:46,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:39:46,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:39:46,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:39:46,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:39:46,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:39:46,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:39:46,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:39:46,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:39:46,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:39:46,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:39:46,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:39:46,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:39:46,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:39:46,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:39:46,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:39:46,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:39:46,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:39:46,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:39:46,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:39:46,713 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:39:46,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:39:46,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:39:46,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:39:46,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:39:46,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:39:46,716 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:39:46,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:39:46,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:39:46,717 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:39:46,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:39:46,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:39:46,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:39:46,728 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:39:46,728 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:39:46,729 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:39:46,729 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:39:46,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:39:46,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:39:46,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:39:46,731 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:39:46,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:39:46,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:39:46,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:39:46,734 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_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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 -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-11-22 23:39:46,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:39:46,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:39:46,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:39:46,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:39:46,766 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:39:46,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-22 23:39:46,801 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/data/31007d10e/5a886d13a1a447f8bd23a8988882736b/FLAG1a7f7ceaa [2018-11-22 23:39:47,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:39:47,206 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-22 23:39:47,211 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/data/31007d10e/5a886d13a1a447f8bd23a8988882736b/FLAG1a7f7ceaa [2018-11-22 23:39:47,219 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/data/31007d10e/5a886d13a1a447f8bd23a8988882736b [2018-11-22 23:39:47,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:39:47,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:39:47,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:39:47,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:39:47,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:39:47,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac28ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47, skipping insertion in model container [2018-11-22 23:39:47,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:39:47,260 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:39:47,421 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:39:47,426 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:39:47,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:39:47,470 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:39:47,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47 WrapperNode [2018-11-22 23:39:47,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:39:47,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:39:47,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:39:47,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:39:47,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:39:47,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:39:47,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:39:47,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:39:47,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... [2018-11-22 23:39:47,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:39:47,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:39:47,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:39:47,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:39:47,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:39:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-22 23:39:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-22 23:39:47,592 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-22 23:39:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-22 23:39:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-22 23:39:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-22 23:39:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:39:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-22 23:39:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-22 23:39:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-22 23:39:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:39:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-22 23:39:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-22 23:39:47,924 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:39:47,924 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 23:39:47,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:47 BoogieIcfgContainer [2018-11-22 23:39:47,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:39:47,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:39:47,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:39:47,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:39:47,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:39:47" (1/3) ... [2018-11-22 23:39:47,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7388f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:47, skipping insertion in model container [2018-11-22 23:39:47,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:47" (2/3) ... [2018-11-22 23:39:47,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7388f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:47, skipping insertion in model container [2018-11-22 23:39:47,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:47" (3/3) ... [2018-11-22 23:39:47,929 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-22 23:39:47,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:39:47,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:39:47,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:39:47,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:39:47,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:39:47,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:39:47,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:39:47,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:39:47,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:39:47,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:39:47,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:39:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-11-22 23:39:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:47,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:47,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:47,999 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:48,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-11-22 23:39:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:48,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:48,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:48,230 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-22 23:39:48,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:48,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:48,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:48,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:48,249 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-11-22 23:39:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:48,648 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-11-22 23:39:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:48,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:48,659 INFO L225 Difference]: With dead ends: 361 [2018-11-22 23:39:48,659 INFO L226 Difference]: Without dead ends: 195 [2018-11-22 23:39:48,663 INFO L631 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-22 23:39:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-22 23:39:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-22 23:39:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-11-22 23:39:48,709 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-11-22 23:39:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:48,710 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-11-22 23:39:48,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-11-22 23:39:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:48,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:48,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:48,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:48,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-11-22 23:39:48,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:48,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:48,810 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-22 23:39:48,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:48,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:48,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:48,813 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-11-22 23:39:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:49,076 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-11-22 23:39:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:49,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:49,078 INFO L225 Difference]: With dead ends: 340 [2018-11-22 23:39:49,078 INFO L226 Difference]: Without dead ends: 195 [2018-11-22 23:39:49,079 INFO L631 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-22 23:39:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-22 23:39:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-22 23:39:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-11-22 23:39:49,101 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-11-22 23:39:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:49,101 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-11-22 23:39:49,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-11-22 23:39:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:49,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:49,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:49,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:49,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-11-22 23:39:49,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:49,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:49,188 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-22 23:39:49,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:49,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:49,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:49,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:49,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:49,190 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-11-22 23:39:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:49,402 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-11-22 23:39:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:49,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:49,405 INFO L225 Difference]: With dead ends: 338 [2018-11-22 23:39:49,405 INFO L226 Difference]: Without dead ends: 193 [2018-11-22 23:39:49,406 INFO L631 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-22 23:39:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-22 23:39:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-11-22 23:39:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-11-22 23:39:49,422 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-11-22 23:39:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:49,422 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-11-22 23:39:49,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-11-22 23:39:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:49,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:49,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:49,424 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:49,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:49,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-11-22 23:39:49,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:49,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:49,474 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-22 23:39:49,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:49,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:49,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:49,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:49,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:49,475 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-11-22 23:39:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:49,705 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-11-22 23:39:49,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:49,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:49,707 INFO L225 Difference]: With dead ends: 355 [2018-11-22 23:39:49,707 INFO L226 Difference]: Without dead ends: 210 [2018-11-22 23:39:49,708 INFO L631 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-22 23:39:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-22 23:39:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-11-22 23:39:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-11-22 23:39:49,725 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-11-22 23:39:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:49,725 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-11-22 23:39:49,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-11-22 23:39:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:49,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:49,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:49,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:49,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-11-22 23:39:49,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:49,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:49,781 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-22 23:39:49,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:49,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:49,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:49,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:49,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:49,782 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-11-22 23:39:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:50,020 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-11-22 23:39:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:50,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:50,023 INFO L225 Difference]: With dead ends: 349 [2018-11-22 23:39:50,023 INFO L226 Difference]: Without dead ends: 204 [2018-11-22 23:39:50,023 INFO L631 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-22 23:39:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-22 23:39:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-11-22 23:39:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-11-22 23:39:50,040 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-11-22 23:39:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:50,040 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-11-22 23:39:50,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-11-22 23:39:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:50,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:50,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:50,041 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:50,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-11-22 23:39:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:50,106 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-22 23:39:50,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:50,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:39:50,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:50,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:39:50,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:39:50,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:39:50,108 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-11-22 23:39:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:50,401 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-11-22 23:39:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:39:50,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-22 23:39:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:50,403 INFO L225 Difference]: With dead ends: 351 [2018-11-22 23:39:50,403 INFO L226 Difference]: Without dead ends: 206 [2018-11-22 23:39:50,404 INFO L631 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-22 23:39:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-22 23:39:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-11-22 23:39:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-22 23:39:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-11-22 23:39:50,420 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-11-22 23:39:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:50,421 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-11-22 23:39:50,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:39:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-11-22 23:39:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:39:50,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:50,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:50,422 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:50,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-11-22 23:39:50,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:50,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:50,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:50,475 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-22 23:39:50,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:50,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 23:39:50,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:50,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:39:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:39:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 23:39:50,476 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-11-22 23:39:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:50,639 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-11-22 23:39:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:39:50,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-22 23:39:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:50,640 INFO L225 Difference]: With dead ends: 445 [2018-11-22 23:39:50,641 INFO L226 Difference]: Without dead ends: 301 [2018-11-22 23:39:50,641 INFO L631 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-22 23:39:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-22 23:39:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-11-22 23:39:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-22 23:39:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-11-22 23:39:50,670 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-11-22 23:39:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-11-22 23:39:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:39:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-11-22 23:39:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-22 23:39:50,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:50,672 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:50,672 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:50,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-11-22 23:39:50,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:50,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:50,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-22 23:39:50,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:39:50,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:39:50,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-22 23:39:50,730 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [39], [42], [47], [50], [54], [56], [86], [89], [103], [104], [107], [113], [119], [125], [131], [137], [141], [142], [145], [148], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [278], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:39:50,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:39:50,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:39:50,898 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:39:50,899 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 385 root evaluator evaluations with a maximum evaluation depth of 3. Performed 385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-22 23:39:50,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:50,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:39:51,020 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 69.09% of their original sizes. [2018-11-22 23:39:51,021 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:39:51,082 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-22 23:39:51,082 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:39:51,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:39:51,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-22 23:39:51,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:51,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 23:39:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:39:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:39:51,084 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 10 states. [2018-11-22 23:39:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:52,089 INFO L93 Difference]: Finished difference Result 689 states and 918 transitions. [2018-11-22 23:39:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:39:52,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2018-11-22 23:39:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:52,091 INFO L225 Difference]: With dead ends: 689 [2018-11-22 23:39:52,091 INFO L226 Difference]: Without dead ends: 404 [2018-11-22 23:39:52,092 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-22 23:39:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-22 23:39:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2018-11-22 23:39:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-22 23:39:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-11-22 23:39:52,118 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 145 [2018-11-22 23:39:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:52,119 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-11-22 23:39:52,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 23:39:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-11-22 23:39:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-22 23:39:52,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:52,122 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:52,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:52,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1214533374, now seen corresponding path program 1 times [2018-11-22 23:39:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:52,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-22 23:39:52,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:39:52,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:39:52,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-11-22 23:39:52,185 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:39:52,188 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:39:52,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:39:52,207 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:39:52,208 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Performed 437 root evaluator evaluations with a maximum evaluation depth of 3. Performed 437 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-22 23:39:52,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:52,216 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:39:52,262 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 67.8% of their original sizes. [2018-11-22 23:39:52,262 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:39:52,352 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-11-22 23:39:52,352 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:39:52,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:39:52,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-22 23:39:52,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:52,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 23:39:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:39:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:39:52,354 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 15 states. [2018-11-22 23:39:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:53,573 INFO L93 Difference]: Finished difference Result 777 states and 1004 transitions. [2018-11-22 23:39:53,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 23:39:53,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-11-22 23:39:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:53,575 INFO L225 Difference]: With dead ends: 777 [2018-11-22 23:39:53,575 INFO L226 Difference]: Without dead ends: 402 [2018-11-22 23:39:53,576 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-11-22 23:39:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-22 23:39:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-11-22 23:39:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-22 23:39:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2018-11-22 23:39:53,599 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 164 [2018-11-22 23:39:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:53,599 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2018-11-22 23:39:53,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 23:39:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2018-11-22 23:39:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-22 23:39:53,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:53,602 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:53,602 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:53,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1162528349, now seen corresponding path program 1 times [2018-11-22 23:39:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:53,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:53,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-22 23:39:53,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:39:53,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:39:53,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-11-22 23:39:53,650 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:39:53,653 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:39:53,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:39:53,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:39:53,672 INFO L272 AbstractInterpreter]: Visited 62 different actions 62 times. Never merged. Never widened. Performed 486 root evaluator evaluations with a maximum evaluation depth of 3. Performed 486 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-22 23:39:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:53,674 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:39:53,715 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 66.11% of their original sizes. [2018-11-22 23:39:53,715 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:39:53,861 INFO L415 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2018-11-22 23:39:53,861 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:39:53,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:39:53,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-22 23:39:53,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:53,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 23:39:53,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 23:39:53,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:39:53,862 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 19 states. [2018-11-22 23:39:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:56,064 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2018-11-22 23:39:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-22 23:39:56,064 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 165 [2018-11-22 23:39:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:56,067 INFO L225 Difference]: With dead ends: 775 [2018-11-22 23:39:56,069 INFO L226 Difference]: Without dead ends: 402 [2018-11-22 23:39:56,070 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-11-22 23:39:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-22 23:39:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-11-22 23:39:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-22 23:39:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2018-11-22 23:39:56,101 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 165 [2018-11-22 23:39:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:56,101 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2018-11-22 23:39:56,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 23:39:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2018-11-22 23:39:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-22 23:39:56,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:56,103 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:56,103 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:56,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2051811056, now seen corresponding path program 1 times [2018-11-22 23:39:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-22 23:39:56,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:39:56,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:56,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:39:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:39:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:39:56,165 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 6 states. [2018-11-22 23:39:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:56,230 INFO L93 Difference]: Finished difference Result 685 states and 906 transitions. [2018-11-22 23:39:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:39:56,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-11-22 23:39:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:56,232 INFO L225 Difference]: With dead ends: 685 [2018-11-22 23:39:56,232 INFO L226 Difference]: Without dead ends: 407 [2018-11-22 23:39:56,233 INFO L631 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-22 23:39:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-22 23:39:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-11-22 23:39:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-22 23:39:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 502 transitions. [2018-11-22 23:39:56,266 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 502 transitions. Word has length 165 [2018-11-22 23:39:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:56,266 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 502 transitions. [2018-11-22 23:39:56,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:39:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 502 transitions. [2018-11-22 23:39:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-22 23:39:56,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:56,270 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:56,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:56,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1349669902, now seen corresponding path program 1 times [2018-11-22 23:39:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-22 23:39:56,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:56,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:39:56,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:56,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:39:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:39:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:39:56,332 INFO L87 Difference]: Start difference. First operand 399 states and 502 transitions. Second operand 6 states. [2018-11-22 23:39:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:56,379 INFO L93 Difference]: Finished difference Result 696 states and 914 transitions. [2018-11-22 23:39:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:39:56,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-11-22 23:39:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:56,382 INFO L225 Difference]: With dead ends: 696 [2018-11-22 23:39:56,382 INFO L226 Difference]: Without dead ends: 413 [2018-11-22 23:39:56,383 INFO L631 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-22 23:39:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-11-22 23:39:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 409. [2018-11-22 23:39:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-22 23:39:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 512 transitions. [2018-11-22 23:39:56,416 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 512 transitions. Word has length 165 [2018-11-22 23:39:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:56,416 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 512 transitions. [2018-11-22 23:39:56,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:39:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 512 transitions. [2018-11-22 23:39:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-22 23:39:56,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:56,419 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:56,419 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:56,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash 573558132, now seen corresponding path program 1 times [2018-11-22 23:39:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:56,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-22 23:39:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:39:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:39:56,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:39:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:39:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:39:56,461 INFO L87 Difference]: Start difference. First operand 409 states and 512 transitions. Second operand 3 states. [2018-11-22 23:39:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:39:56,524 INFO L93 Difference]: Finished difference Result 977 states and 1288 transitions. [2018-11-22 23:39:56,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:39:56,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-11-22 23:39:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:39:56,528 INFO L225 Difference]: With dead ends: 977 [2018-11-22 23:39:56,528 INFO L226 Difference]: Without dead ends: 684 [2018-11-22 23:39:56,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:39:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-22 23:39:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 675. [2018-11-22 23:39:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-22 23:39:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 882 transitions. [2018-11-22 23:39:56,581 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 882 transitions. Word has length 165 [2018-11-22 23:39:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:39:56,581 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 882 transitions. [2018-11-22 23:39:56,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:39:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 882 transitions. [2018-11-22 23:39:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-22 23:39:56,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:39:56,583 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:39:56,583 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:39:56,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1473280628, now seen corresponding path program 1 times [2018-11-22 23:39:56,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:39:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:39:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:39:56,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:39:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:39:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:39:56,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:39:56,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:39:56,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-22 23:39:56,647 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [36], [39], [42], [44], [47], [52], [54], [56], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:39:56,649 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:39:56,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:39:56,704 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:39:56,704 INFO L272 AbstractInterpreter]: Visited 112 different actions 155 times. Merged at 5 different actions 6 times. Never widened. Performed 1137 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-11-22 23:39:56,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:39:56,716 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:39:56,814 INFO L227 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 77.42% of their original sizes. [2018-11-22 23:39:56,814 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:39:57,676 INFO L415 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2018-11-22 23:39:57,677 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:39:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:39:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2018-11-22 23:39:57,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:39:57,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-22 23:39:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-22 23:39:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=3752, Unknown=0, NotChecked=0, Total=4290 [2018-11-22 23:39:57,680 INFO L87 Difference]: Start difference. First operand 675 states and 882 transitions. Second operand 66 states. [2018-11-22 23:40:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:18,089 INFO L93 Difference]: Finished difference Result 3445 states and 4868 transitions. [2018-11-22 23:40:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-11-22 23:40:18,089 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 167 [2018-11-22 23:40:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:18,099 INFO L225 Difference]: With dead ends: 3445 [2018-11-22 23:40:18,099 INFO L226 Difference]: Without dead ends: 2748 [2018-11-22 23:40:18,109 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16614 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3309, Invalid=40163, Unknown=0, NotChecked=0, Total=43472 [2018-11-22 23:40:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-11-22 23:40:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2614. [2018-11-22 23:40:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2018-11-22 23:40:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3461 transitions. [2018-11-22 23:40:18,358 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3461 transitions. Word has length 167 [2018-11-22 23:40:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:18,359 INFO L480 AbstractCegarLoop]: Abstraction has 2614 states and 3461 transitions. [2018-11-22 23:40:18,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-22 23:40:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3461 transitions. [2018-11-22 23:40:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-22 23:40:18,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:18,360 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:40:18,360 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:18,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:18,361 INFO L82 PathProgramCache]: Analyzing trace with hash -511157367, now seen corresponding path program 1 times [2018-11-22 23:40:18,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:18,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-22 23:40:18,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:40:18,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:40:18,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:18,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:40:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:40:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:40:18,456 INFO L87 Difference]: Start difference. First operand 2614 states and 3461 transitions. Second operand 5 states. [2018-11-22 23:40:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:18,986 INFO L93 Difference]: Finished difference Result 5600 states and 7893 transitions. [2018-11-22 23:40:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:40:18,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-11-22 23:40:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:18,998 INFO L225 Difference]: With dead ends: 5600 [2018-11-22 23:40:18,999 INFO L226 Difference]: Without dead ends: 3350 [2018-11-22 23:40:19,008 INFO L631 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-22 23:40:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2018-11-22 23:40:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3198. [2018-11-22 23:40:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2018-11-22 23:40:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4275 transitions. [2018-11-22 23:40:19,263 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4275 transitions. Word has length 153 [2018-11-22 23:40:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:19,264 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 4275 transitions. [2018-11-22 23:40:19,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:40:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4275 transitions. [2018-11-22 23:40:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-22 23:40:19,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:19,268 INFO L402 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, 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-22 23:40:19,268 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:19,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash -250010523, now seen corresponding path program 1 times [2018-11-22 23:40:19,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:19,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:19,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-22 23:40:19,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:19,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:19,359 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-22 23:40:19,359 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:19,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:19,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:19,404 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:40:19,404 INFO L272 AbstractInterpreter]: Visited 108 different actions 141 times. Never merged. Never widened. Performed 958 root evaluator evaluations with a maximum evaluation depth of 3. Performed 958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-22 23:40:19,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:19,405 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:40:19,503 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 75.74% of their original sizes. [2018-11-22 23:40:19,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:40:20,042 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-22 23:40:20,043 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:40:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [6] total 56 [2018-11-22 23:40:20,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:20,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-22 23:40:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-22 23:40:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2342, Unknown=0, NotChecked=0, Total=2652 [2018-11-22 23:40:20,044 INFO L87 Difference]: Start difference. First operand 3198 states and 4275 transitions. Second operand 52 states. [2018-11-22 23:40:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:28,302 INFO L93 Difference]: Finished difference Result 5859 states and 7949 transitions. [2018-11-22 23:40:28,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-22 23:40:28,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 190 [2018-11-22 23:40:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:28,314 INFO L225 Difference]: With dead ends: 5859 [2018-11-22 23:40:28,315 INFO L226 Difference]: Without dead ends: 3548 [2018-11-22 23:40:28,323 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1179, Invalid=11931, Unknown=0, NotChecked=0, Total=13110 [2018-11-22 23:40:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-11-22 23:40:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3489. [2018-11-22 23:40:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-11-22 23:40:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4639 transitions. [2018-11-22 23:40:28,552 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4639 transitions. Word has length 190 [2018-11-22 23:40:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:28,552 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 4639 transitions. [2018-11-22 23:40:28,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-22 23:40:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4639 transitions. [2018-11-22 23:40:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-22 23:40:28,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:28,556 INFO L402 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, 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-22 23:40:28,556 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:28,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash 348520683, now seen corresponding path program 1 times [2018-11-22 23:40:28,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:28,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:28,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-22 23:40:28,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:28,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:28,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-22 23:40:28,641 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [269], [272], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:28,642 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:28,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:28,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:40:28,683 INFO L272 AbstractInterpreter]: Visited 114 different actions 147 times. Never merged. Never widened. Performed 1000 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1000 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-22 23:40:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:28,685 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:40:28,768 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 76.11% of their original sizes. [2018-11-22 23:40:28,768 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:40:29,290 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-22 23:40:29,290 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:40:29,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:29,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2018-11-22 23:40:29,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:29,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-22 23:40:29,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-22 23:40:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2018-11-22 23:40:29,292 INFO L87 Difference]: Start difference. First operand 3489 states and 4639 transitions. Second operand 54 states. [2018-11-22 23:40:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:35,550 INFO L93 Difference]: Finished difference Result 6338 states and 8655 transitions. [2018-11-22 23:40:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-22 23:40:35,550 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 196 [2018-11-22 23:40:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:35,559 INFO L225 Difference]: With dead ends: 6338 [2018-11-22 23:40:35,559 INFO L226 Difference]: Without dead ends: 4137 [2018-11-22 23:40:35,563 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 258 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1185, Invalid=12387, Unknown=0, NotChecked=0, Total=13572 [2018-11-22 23:40:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2018-11-22 23:40:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4072. [2018-11-22 23:40:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2018-11-22 23:40:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 5407 transitions. [2018-11-22 23:40:35,750 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 5407 transitions. Word has length 196 [2018-11-22 23:40:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:35,751 INFO L480 AbstractCegarLoop]: Abstraction has 4072 states and 5407 transitions. [2018-11-22 23:40:35,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-22 23:40:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 5407 transitions. [2018-11-22 23:40:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-22 23:40:35,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:35,753 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:40:35,754 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:35,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1614110952, now seen corresponding path program 1 times [2018-11-22 23:40:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:35,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-22 23:40:35,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:35,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:35,798 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-22 23:40:35,799 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:35,801 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:35,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:35,831 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:40:35,831 INFO L272 AbstractInterpreter]: Visited 116 different actions 167 times. Merged at 11 different actions 11 times. Never widened. Performed 1177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-22 23:40:35,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:35,836 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:40:35,911 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 76.3% of their original sizes. [2018-11-22 23:40:35,911 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:40:36,618 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-22 23:40:36,618 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:40:36,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:36,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [3] total 65 [2018-11-22 23:40:36,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:36,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-22 23:40:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-22 23:40:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3644, Unknown=0, NotChecked=0, Total=4032 [2018-11-22 23:40:36,619 INFO L87 Difference]: Start difference. First operand 4072 states and 5407 transitions. Second operand 64 states. [2018-11-22 23:40:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:41,746 INFO L93 Difference]: Finished difference Result 5429 states and 7255 transitions. [2018-11-22 23:40:41,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-22 23:40:41,746 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 211 [2018-11-22 23:40:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:41,751 INFO L225 Difference]: With dead ends: 5429 [2018-11-22 23:40:41,751 INFO L226 Difference]: Without dead ends: 2241 [2018-11-22 23:40:41,756 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1387, Invalid=14113, Unknown=0, NotChecked=0, Total=15500 [2018-11-22 23:40:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-11-22 23:40:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2135. [2018-11-22 23:40:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2018-11-22 23:40:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 2751 transitions. [2018-11-22 23:40:41,849 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 2751 transitions. Word has length 211 [2018-11-22 23:40:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:41,849 INFO L480 AbstractCegarLoop]: Abstraction has 2135 states and 2751 transitions. [2018-11-22 23:40:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-22 23:40:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2751 transitions. [2018-11-22 23:40:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-22 23:40:41,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:41,852 INFO L402 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, 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-22 23:40:41,852 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:41,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1608070936, now seen corresponding path program 1 times [2018-11-22 23:40:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:41,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-22 23:40:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:41,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:41,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-11-22 23:40:41,935 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:41,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:41,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:42,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:42,078 INFO L272 AbstractInterpreter]: Visited 122 different actions 500 times. Merged at 31 different actions 119 times. Never widened. Performed 5633 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5633 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 7 different actions. Largest state had 42 variables. [2018-11-22 23:40:42,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:42,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:42,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:42,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:42,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:42,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:40:42,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-22 23:40:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-22 23:40:42,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:42,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:40:42,484 INFO L87 Difference]: Start difference. First operand 2135 states and 2751 transitions. Second operand 3 states. [2018-11-22 23:40:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:42,675 INFO L93 Difference]: Finished difference Result 4040 states and 5455 transitions. [2018-11-22 23:40:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:42,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-22 23:40:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:42,683 INFO L225 Difference]: With dead ends: 4040 [2018-11-22 23:40:42,683 INFO L226 Difference]: Without dead ends: 2219 [2018-11-22 23:40:42,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 415 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:40:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-11-22 23:40:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2124. [2018-11-22 23:40:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2018-11-22 23:40:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2698 transitions. [2018-11-22 23:40:42,863 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2698 transitions. Word has length 210 [2018-11-22 23:40:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:42,864 INFO L480 AbstractCegarLoop]: Abstraction has 2124 states and 2698 transitions. [2018-11-22 23:40:42,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2698 transitions. [2018-11-22 23:40:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-22 23:40:42,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:42,867 INFO L402 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, 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] [2018-11-22 23:40:42,867 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:42,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -958122421, now seen corresponding path program 1 times [2018-11-22 23:40:42,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:42,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-22 23:40:42,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:42,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:42,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-22 23:40:42,937 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [288], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:42,938 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:42,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:43,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:43,056 INFO L272 AbstractInterpreter]: Visited 122 different actions 396 times. Merged at 31 different actions 86 times. Never widened. Performed 3851 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3851 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-22 23:40:43,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:43,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:43,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:43,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:43,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:43,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 23:40:43,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-22 23:40:43,297 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:43,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-11-22 23:40:43,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:40:43,298 INFO L87 Difference]: Start difference. First operand 2124 states and 2698 transitions. Second operand 3 states. [2018-11-22 23:40:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:43,472 INFO L93 Difference]: Finished difference Result 4624 states and 6194 transitions. [2018-11-22 23:40:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:43,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-22 23:40:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:43,489 INFO L225 Difference]: With dead ends: 4624 [2018-11-22 23:40:43,489 INFO L226 Difference]: Without dead ends: 2712 [2018-11-22 23:40:43,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:40:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2018-11-22 23:40:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2694. [2018-11-22 23:40:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2018-11-22 23:40:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3414 transitions. [2018-11-22 23:40:43,643 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3414 transitions. Word has length 211 [2018-11-22 23:40:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:43,643 INFO L480 AbstractCegarLoop]: Abstraction has 2694 states and 3414 transitions. [2018-11-22 23:40:43,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3414 transitions. [2018-11-22 23:40:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-22 23:40:43,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:43,646 INFO L402 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, 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-22 23:40:43,646 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:43,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1243658086, now seen corresponding path program 1 times [2018-11-22 23:40:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:43,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:43,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-22 23:40:43,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:43,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:43,723 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-22 23:40:43,723 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:43,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:43,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:43,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:43,820 INFO L272 AbstractInterpreter]: Visited 123 different actions 378 times. Merged at 30 different actions 76 times. Never widened. Performed 4008 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-22 23:40:43,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:43,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:43,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:43,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:43,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:43,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:43,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-22 23:40:43,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-22 23:40:44,047 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-22 23:40:44,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:44,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:40:44,047 INFO L87 Difference]: Start difference. First operand 2694 states and 3414 transitions. Second operand 3 states. [2018-11-22 23:40:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:44,192 INFO L93 Difference]: Finished difference Result 5878 states and 7954 transitions. [2018-11-22 23:40:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:44,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-22 23:40:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:44,202 INFO L225 Difference]: With dead ends: 5878 [2018-11-22 23:40:44,202 INFO L226 Difference]: Without dead ends: 3396 [2018-11-22 23:40:44,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:40:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2018-11-22 23:40:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3370. [2018-11-22 23:40:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2018-11-22 23:40:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4335 transitions. [2018-11-22 23:40:44,360 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4335 transitions. Word has length 211 [2018-11-22 23:40:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:44,361 INFO L480 AbstractCegarLoop]: Abstraction has 3370 states and 4335 transitions. [2018-11-22 23:40:44,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4335 transitions. [2018-11-22 23:40:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-22 23:40:44,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:44,364 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:40:44,364 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:44,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -326896353, now seen corresponding path program 1 times [2018-11-22 23:40:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:44,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-22 23:40:44,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:44,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:44,425 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-22 23:40:44,425 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:44,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:44,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:44,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:44,497 INFO L272 AbstractInterpreter]: Visited 121 different actions 294 times. Merged at 13 different actions 25 times. Never widened. Performed 3447 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3447 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-22 23:40:44,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:44,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:44,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:44,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:44,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-22 23:40:44,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-22 23:40:44,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:44,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2018-11-22 23:40:44,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:44,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:40:44,812 INFO L87 Difference]: Start difference. First operand 3370 states and 4335 transitions. Second operand 3 states. [2018-11-22 23:40:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:44,958 INFO L93 Difference]: Finished difference Result 5164 states and 6608 transitions. [2018-11-22 23:40:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:44,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-22 23:40:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:44,968 INFO L225 Difference]: With dead ends: 5164 [2018-11-22 23:40:44,968 INFO L226 Difference]: Without dead ends: 3379 [2018-11-22 23:40:44,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:40:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2018-11-22 23:40:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3370. [2018-11-22 23:40:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2018-11-22 23:40:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4284 transitions. [2018-11-22 23:40:45,121 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4284 transitions. Word has length 212 [2018-11-22 23:40:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:45,121 INFO L480 AbstractCegarLoop]: Abstraction has 3370 states and 4284 transitions. [2018-11-22 23:40:45,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4284 transitions. [2018-11-22 23:40:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-22 23:40:45,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:45,124 INFO L402 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, 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-22 23:40:45,124 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1411595648, now seen corresponding path program 1 times [2018-11-22 23:40:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:45,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:45,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-22 23:40:45,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:45,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:45,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-22 23:40:45,204 INFO L202 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:45,205 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:45,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:45,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:45,324 INFO L272 AbstractInterpreter]: Visited 125 different actions 531 times. Merged at 31 different actions 121 times. Never widened. Performed 4984 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4984 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-22 23:40:45,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:45,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:45,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:45,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:45,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:45,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:45,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-22 23:40:45,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-22 23:40:45,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:45,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-11-22 23:40:45,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:45,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:45,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:40:45,597 INFO L87 Difference]: Start difference. First operand 3370 states and 4284 transitions. Second operand 3 states. [2018-11-22 23:40:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:45,752 INFO L93 Difference]: Finished difference Result 4449 states and 5676 transitions. [2018-11-22 23:40:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:45,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-22 23:40:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:45,761 INFO L225 Difference]: With dead ends: 4449 [2018-11-22 23:40:45,761 INFO L226 Difference]: Without dead ends: 3381 [2018-11-22 23:40:45,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 415 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-22 23:40:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2018-11-22 23:40:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3370. [2018-11-22 23:40:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2018-11-22 23:40:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4190 transitions. [2018-11-22 23:40:45,913 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4190 transitions. Word has length 212 [2018-11-22 23:40:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:45,913 INFO L480 AbstractCegarLoop]: Abstraction has 3370 states and 4190 transitions. [2018-11-22 23:40:45,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4190 transitions. [2018-11-22 23:40:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-22 23:40:45,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:45,916 INFO L402 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, 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] [2018-11-22 23:40:45,916 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:45,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash 925553302, now seen corresponding path program 1 times [2018-11-22 23:40:45,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:45,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:45,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-22 23:40:45,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:40:45,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 23:40:45,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:45,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:40:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:40:45,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 23:40:45,979 INFO L87 Difference]: Start difference. First operand 3370 states and 4190 transitions. Second operand 4 states. [2018-11-22 23:40:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:46,188 INFO L93 Difference]: Finished difference Result 5774 states and 7351 transitions. [2018-11-22 23:40:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:40:46,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-11-22 23:40:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:46,194 INFO L225 Difference]: With dead ends: 5774 [2018-11-22 23:40:46,194 INFO L226 Difference]: Without dead ends: 2897 [2018-11-22 23:40:46,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-22 23:40:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2018-11-22 23:40:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2891. [2018-11-22 23:40:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2891 states. [2018-11-22 23:40:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3459 transitions. [2018-11-22 23:40:46,397 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3459 transitions. Word has length 211 [2018-11-22 23:40:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:46,397 INFO L480 AbstractCegarLoop]: Abstraction has 2891 states and 3459 transitions. [2018-11-22 23:40:46,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:40:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3459 transitions. [2018-11-22 23:40:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-22 23:40:46,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:46,401 INFO L402 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, 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] [2018-11-22 23:40:46,401 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:46,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -22073876, now seen corresponding path program 1 times [2018-11-22 23:40:46,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:46,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:46,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-22 23:40:46,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:46,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:46,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-22 23:40:46,454 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:46,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:46,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:46,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:46,558 INFO L272 AbstractInterpreter]: Visited 124 different actions 355 times. Merged at 23 different actions 35 times. Never widened. Performed 3990 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-22 23:40:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:46,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:46,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:46,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:46,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:46,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-22 23:40:46,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-22 23:40:46,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:46,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 10 [2018-11-22 23:40:46,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:46,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:40:46,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:40:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:40:46,816 INFO L87 Difference]: Start difference. First operand 2891 states and 3459 transitions. Second operand 4 states. [2018-11-22 23:40:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:47,133 INFO L93 Difference]: Finished difference Result 5790 states and 7491 transitions. [2018-11-22 23:40:47,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:40:47,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-11-22 23:40:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:47,141 INFO L225 Difference]: With dead ends: 5790 [2018-11-22 23:40:47,141 INFO L226 Difference]: Without dead ends: 3370 [2018-11-22 23:40:47,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 408 SyntacticMatches, 11 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:40:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2018-11-22 23:40:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3055. [2018-11-22 23:40:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2018-11-22 23:40:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 3635 transitions. [2018-11-22 23:40:47,342 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 3635 transitions. Word has length 211 [2018-11-22 23:40:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:47,342 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 3635 transitions. [2018-11-22 23:40:47,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:40:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3635 transitions. [2018-11-22 23:40:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-22 23:40:47,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:47,345 INFO L402 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, 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-22 23:40:47,345 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:47,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 467873814, now seen corresponding path program 1 times [2018-11-22 23:40:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:47,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-22 23:40:47,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:47,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:47,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-22 23:40:47,398 INFO L202 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:47,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:47,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:47,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:47,536 INFO L272 AbstractInterpreter]: Visited 125 different actions 430 times. Merged at 39 different actions 89 times. Never widened. Performed 4250 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4250 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-22 23:40:47,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:47,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:47,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:47,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:47,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:47,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:47,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 23:40:47,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-22 23:40:47,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:47,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2018-11-22 23:40:47,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:47,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:40:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:40:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:40:47,820 INFO L87 Difference]: Start difference. First operand 3055 states and 3635 transitions. Second operand 4 states. [2018-11-22 23:40:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:48,145 INFO L93 Difference]: Finished difference Result 5736 states and 7126 transitions. [2018-11-22 23:40:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:40:48,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-22 23:40:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:48,153 INFO L225 Difference]: With dead ends: 5736 [2018-11-22 23:40:48,153 INFO L226 Difference]: Without dead ends: 3305 [2018-11-22 23:40:48,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:40:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2018-11-22 23:40:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3302. [2018-11-22 23:40:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2018-11-22 23:40:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4096 transitions. [2018-11-22 23:40:48,317 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4096 transitions. Word has length 213 [2018-11-22 23:40:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:48,317 INFO L480 AbstractCegarLoop]: Abstraction has 3302 states and 4096 transitions. [2018-11-22 23:40:48,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:40:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4096 transitions. [2018-11-22 23:40:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-22 23:40:48,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:48,320 INFO L402 BasicCegarLoop]: trace histogram [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, 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-22 23:40:48,320 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:48,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1904886773, now seen corresponding path program 1 times [2018-11-22 23:40:48,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:48,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:48,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:48,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:48,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-11-22 23:40:48,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:48,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:48,382 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-22 23:40:48,382 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [269], [272], [282], [285], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [405], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:48,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:48,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:48,428 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 23:40:48,428 INFO L272 AbstractInterpreter]: Visited 125 different actions 168 times. Merged at 2 different actions 2 times. Never widened. Performed 1160 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-22 23:40:48,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:48,432 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 23:40:48,505 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 75.33% of their original sizes. [2018-11-22 23:40:48,505 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 23:40:49,245 INFO L415 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2018-11-22 23:40:49,245 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 23:40:49,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:40:49,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [5] total 72 [2018-11-22 23:40:49,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:49,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-22 23:40:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-22 23:40:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=4285, Unknown=0, NotChecked=0, Total=4692 [2018-11-22 23:40:49,246 INFO L87 Difference]: Start difference. First operand 3302 states and 4096 transitions. Second operand 69 states. [2018-11-22 23:40:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:55,476 INFO L93 Difference]: Finished difference Result 5181 states and 6476 transitions. [2018-11-22 23:40:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-22 23:40:55,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 264 [2018-11-22 23:40:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:55,483 INFO L225 Difference]: With dead ends: 5181 [2018-11-22 23:40:55,483 INFO L226 Difference]: Without dead ends: 3430 [2018-11-22 23:40:55,487 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1180, Invalid=11476, Unknown=0, NotChecked=0, Total=12656 [2018-11-22 23:40:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2018-11-22 23:40:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3419. [2018-11-22 23:40:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3419 states. [2018-11-22 23:40:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4229 transitions. [2018-11-22 23:40:55,680 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 4229 transitions. Word has length 264 [2018-11-22 23:40:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:55,680 INFO L480 AbstractCegarLoop]: Abstraction has 3419 states and 4229 transitions. [2018-11-22 23:40:55,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-22 23:40:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 4229 transitions. [2018-11-22 23:40:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-22 23:40:55,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:55,683 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:40:55,683 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:55,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash -614304329, now seen corresponding path program 1 times [2018-11-22 23:40:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:55,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:55,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-22 23:40:55,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:55,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:55,754 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-11-22 23:40:55,754 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [282], [285], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [405], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:55,755 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:55,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:55,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:55,867 INFO L272 AbstractInterpreter]: Visited 143 different actions 571 times. Merged at 48 different actions 103 times. Never widened. Performed 4860 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 19 fixpoints after 10 different actions. Largest state had 42 variables. [2018-11-22 23:40:55,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:55,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:55,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:55,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:55,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:55,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-22 23:40:56,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-22 23:40:56,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:56,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-22 23:40:56,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:56,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:40:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:40:56,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:40:56,221 INFO L87 Difference]: Start difference. First operand 3419 states and 4229 transitions. Second operand 6 states. [2018-11-22 23:40:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:56,389 INFO L93 Difference]: Finished difference Result 6403 states and 8263 transitions. [2018-11-22 23:40:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:40:56,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-22 23:40:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:56,395 INFO L225 Difference]: With dead ends: 6403 [2018-11-22 23:40:56,395 INFO L226 Difference]: Without dead ends: 3314 [2018-11-22 23:40:56,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 527 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:40:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-11-22 23:40:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3314. [2018-11-22 23:40:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3314 states. [2018-11-22 23:40:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4032 transitions. [2018-11-22 23:40:56,553 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4032 transitions. Word has length 265 [2018-11-22 23:40:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:56,553 INFO L480 AbstractCegarLoop]: Abstraction has 3314 states and 4032 transitions. [2018-11-22 23:40:56,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:40:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4032 transitions. [2018-11-22 23:40:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-22 23:40:56,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:56,555 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 23:40:56,555 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:56,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 2 times [2018-11-22 23:40:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:56,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:56,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-22 23:40:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:40:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 23:40:56,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:56,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 23:40:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:40:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:40:56,685 INFO L87 Difference]: Start difference. First operand 3314 states and 4032 transitions. Second operand 7 states. [2018-11-22 23:40:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:57,995 INFO L93 Difference]: Finished difference Result 10790 states and 14752 transitions. [2018-11-22 23:40:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 23:40:57,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-11-22 23:40:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:58,013 INFO L225 Difference]: With dead ends: 10790 [2018-11-22 23:40:58,013 INFO L226 Difference]: Without dead ends: 9029 [2018-11-22 23:40:58,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:40:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9029 states. [2018-11-22 23:40:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9029 to 8710. [2018-11-22 23:40:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8710 states. [2018-11-22 23:40:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 11701 transitions. [2018-11-22 23:40:58,560 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 11701 transitions. Word has length 265 [2018-11-22 23:40:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:58,560 INFO L480 AbstractCegarLoop]: Abstraction has 8710 states and 11701 transitions. [2018-11-22 23:40:58,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 23:40:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 11701 transitions. [2018-11-22 23:40:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-22 23:40:58,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:58,564 INFO L402 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, 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] [2018-11-22 23:40:58,564 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -234137424, now seen corresponding path program 1 times [2018-11-22 23:40:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:58,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:58,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:40:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:58,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-11-22 23:40:58,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:58,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:40:58,627 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-22 23:40:58,627 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [291], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:40:58,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:40:58,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:40:58,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:40:58,761 INFO L272 AbstractInterpreter]: Visited 143 different actions 629 times. Merged at 49 different actions 122 times. Never widened. Performed 5939 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5939 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 25 fixpoints after 15 different actions. Largest state had 42 variables. [2018-11-22 23:40:58,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:58,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:40:58,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:40:58,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:40:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:58,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:40:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:40:58,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:40:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-22 23:40:58,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:40:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-22 23:40:59,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:40:59,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-11-22 23:40:59,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:40:59,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:40:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:40:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:40:59,007 INFO L87 Difference]: Start difference. First operand 8710 states and 11701 transitions. Second operand 3 states. [2018-11-22 23:40:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:40:59,580 INFO L93 Difference]: Finished difference Result 14820 states and 20430 transitions. [2018-11-22 23:40:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:40:59,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-22 23:40:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:40:59,597 INFO L225 Difference]: With dead ends: 14820 [2018-11-22 23:40:59,598 INFO L226 Difference]: Without dead ends: 6845 [2018-11-22 23:40:59,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 555 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-22 23:40:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2018-11-22 23:40:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6668. [2018-11-22 23:40:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6668 states. [2018-11-22 23:40:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 8425 transitions. [2018-11-22 23:40:59,982 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 8425 transitions. Word has length 277 [2018-11-22 23:40:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:40:59,983 INFO L480 AbstractCegarLoop]: Abstraction has 6668 states and 8425 transitions. [2018-11-22 23:40:59,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:40:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 8425 transitions. [2018-11-22 23:40:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-22 23:40:59,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:40:59,987 INFO L402 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, 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] [2018-11-22 23:40:59,987 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:40:59,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:40:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash 959908059, now seen corresponding path program 1 times [2018-11-22 23:40:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:40:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:59,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:40:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:40:59,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:40:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:41:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-22 23:41:00,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:41:00,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:41:00,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-22 23:41:00,047 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-11-22 23:41:00,049 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:41:00,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:41:00,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:41:00,321 INFO L272 AbstractInterpreter]: Visited 143 different actions 978 times. Merged at 48 different actions 163 times. Never widened. Performed 8123 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 42 fixpoints after 13 different actions. Largest state had 42 variables. [2018-11-22 23:41:00,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:41:00,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:41:00,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:41:00,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/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-22 23:41:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:41:00,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:41:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:41:00,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:41:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-22 23:41:00,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:41:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-22 23:41:00,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:41:00,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-22 23:41:00,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:41:00,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:41:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:41:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:41:00,550 INFO L87 Difference]: Start difference. First operand 6668 states and 8425 transitions. Second operand 4 states. [2018-11-22 23:41:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:41:00,788 INFO L93 Difference]: Finished difference Result 7534 states and 9494 transitions. [2018-11-22 23:41:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:41:00,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-11-22 23:41:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:41:00,789 INFO L225 Difference]: With dead ends: 7534 [2018-11-22 23:41:00,789 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 23:41:00,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 555 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-22 23:41:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 23:41:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 23:41:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 23:41:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 23:41:00,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2018-11-22 23:41:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:41:00,800 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:41:00,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:41:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:41:00,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:41:00,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 23:41:00,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:01,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:02,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:02,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:41:03,845 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:05,148 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 204 DAG size of output: 123 [2018-11-22 23:41:05,389 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:05,851 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2018-11-22 23:41:06,620 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2018-11-22 23:41:07,209 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 127 [2018-11-22 23:41:07,320 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 82 [2018-11-22 23:41:07,627 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 129 [2018-11-22 23:41:07,742 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 85 [2018-11-22 23:41:07,851 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 75 [2018-11-22 23:41:08,000 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 85 [2018-11-22 23:41:08,389 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 116 [2018-11-22 23:41:09,001 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 120 [2018-11-22 23:41:09,363 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 116 [2018-11-22 23:41:09,703 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2018-11-22 23:41:10,010 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 129 [2018-11-22 23:41:11,247 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 193 DAG size of output: 131 [2018-11-22 23:41:11,635 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2018-11-22 23:41:11,766 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 85 [2018-11-22 23:41:12,439 WARN L180 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 115 [2018-11-22 23:41:13,703 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 214 DAG size of output: 141 [2018-11-22 23:41:14,196 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2018-11-22 23:41:15,668 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 222 DAG size of output: 149 [2018-11-22 23:41:16,829 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 216 DAG size of output: 132 [2018-11-22 23:41:16,935 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 63 [2018-11-22 23:41:17,180 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:17,669 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 120 [2018-11-22 23:41:18,317 WARN L180 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 126 [2018-11-22 23:41:18,653 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 109 [2018-11-22 23:41:18,906 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-11-22 23:41:19,468 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 162 [2018-11-22 23:41:20,153 WARN L180 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 114 [2018-11-22 23:41:20,267 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 85 [2018-11-22 23:41:20,381 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 85 [2018-11-22 23:41:21,329 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 170 [2018-11-22 23:41:21,435 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 75 [2018-11-22 23:41:21,680 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:22,712 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 199 DAG size of output: 108 [2018-11-22 23:41:23,221 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 120 [2018-11-22 23:41:23,697 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 118 [2018-11-22 23:41:23,809 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 1 [2018-11-22 23:41:24,252 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2018-11-22 23:41:24,842 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 150 [2018-11-22 23:41:25,191 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 84 [2018-11-22 23:41:25,436 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2018-11-22 23:41:26,554 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 216 DAG size of output: 132 [2018-11-22 23:41:27,469 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 154 [2018-11-22 23:41:27,604 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 85 [2018-11-22 23:41:29,462 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 268 DAG size of output: 205 [2018-11-22 23:41:29,931 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 125 [2018-11-22 23:41:30,253 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 70 [2018-11-22 23:41:30,495 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:31,406 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 115 [2018-11-22 23:41:31,640 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 116 [2018-11-22 23:41:31,893 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 116 [2018-11-22 23:41:32,655 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 117 [2018-11-22 23:41:33,205 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 152 [2018-11-22 23:41:35,053 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 268 DAG size of output: 205 [2018-11-22 23:41:35,056 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse6 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse40 (= 1 ~m_pc~0)) (.cse38 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~m_st~0 2))) (let ((.cse41 (= 1 ~t2_pc~0)) (.cse34 (and (and (and (not .cse6) (not .cse7) .cse40 (not (= ~M_E~0 0)) (not (= ~E_2~0 0))) .cse38 .cse5) (<= 2 ~E_1~0))) (.cse18 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (= ~t2_st~0 0)) (.cse24 (= ~token~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (= ~t1_pc~0 0)) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse21 (not (= |old(~token~0)| 0))) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse17 (not (= 0 ~local~0))) (.cse29 (not (= 0 ~m_pc~0))) (.cse1 (not (= 2 ~E_M~0))) (.cse11 (not (= 0 |old(~t2_st~0)|))) (.cse13 (not (= 2 ~E_1~0))) (.cse14 (not (= 0 ~t2_pc~0))) (.cse26 (<= |old(~E_2~0)| ~E_2~0)) (.cse15 (< ~E_1~0 2)) (.cse16 (< |old(~t2_st~0)| 2)) (.cse30 (< ~local~0 |old(~token~0)|)) (.cse9 (not (= 2 |old(~m_st~0)|))) (.cse31 (not .cse18)) (.cse32 (< |old(~token~0)| ~local~0)) (.cse37 (= 0 ~t2_st~0)) (.cse8 (= 0 ~M_E~0)) (.cse33 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse23 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse35 (<= 2 ~E_2~0)) (.cse36 (<= (+ ~local~0 1) ~token~0)) (.cse25 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (and .cse41 .cse34)) (.cse19 (= 1 ~E_M~0)) (.cse20 (not .cse41)) (.cse12 (not .cse40)) (.cse27 (< |old(~E_2~0)| 2)) (.cse28 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse6 .cse16 .cse17 .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse22 (and (not (= 1 ~t1_pc~0)) .cse23 (= ~m_st~0 0) .cse24 .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse15 .cse6 (< 0 ~t2_pc~0) .cse30 .cse9 .cse31 .cse32 .cse7 .cse8 .cse19 .cse11 .cse12 .cse27 (and .cse33 .cse34 .cse35 .cse36 .cse25 .cse37) .cse28) (or (and .cse38 .cse2 .cse24 .cse3 .cse4 .cse25) .cse0 (not (= ~T1_E~0 2)) .cse10 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (or .cse21 .cse22 .cse17 .cse29) .cse1 (not (= ~m_i~0 1)) .cse11 .cse13 (not (= 1 ~t2_i~0)) .cse14 (not (= 2 ~M_E~0))) (or .cse15 .cse6 .cse16 .cse30 .cse9 .cse32 .cse18 .cse7 .cse8 .cse19 .cse20 .cse12 (and .cse23 (<= ~token~0 ~local~0) .cse25 (<= ~local~0 ~token~0) .cse39 .cse26) .cse27 .cse28) (or .cse15 .cse6 .cse16 .cse30 .cse9 .cse31 .cse32 (and .cse33 .cse35 .cse36 .cse25 .cse39 .cse37) .cse7 .cse8 (and .cse33 .cse23 .cse35 .cse36 .cse25 .cse39) .cse19 .cse20 .cse12 .cse27 .cse28))))) [2018-11-22 23:41:35,056 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-11-22 23:41:35,057 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse22 (= 1 ~t1_pc~0)) (.cse12 (= |old(~t1_pc~0)| 1))) (let ((.cse20 (not .cse12)) (.cse7 (= ~token~0 |old(~token~0)|)) (.cse0 (< ~E_1~0 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse27 (not (= 0 ~local~0))) (.cse25 (not (= |old(~token~0)| 0))) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse5 (not .cse22)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse9 (= |old(~E_2~0)| ~E_2~0)) (.cse32 (= ~token~0 0)) (.cse10 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse28 (not (= 0 ~m_pc~0))) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse11 (< |old(~token~0)| ~local~0)) (.cse15 (= 1 ~E_M~0)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (= 0 ~E_M~0)) (.cse23 (not (= 2 |old(~E_2~0)|))) (.cse29 (not (= 2 ~E_M~0))) (.cse8 (= ~m_st~0 2)) (.cse31 (= ~t2_st~0 0)) (.cse33 (= ~E_2~0 2)) (.cse34 (= ~t1_pc~0 0)) (.cse1 (= ~T1_E~0 0)) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse24 (not (= |old(~t1_pc~0)| 0))) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse17 (not (= 1 ~m_pc~0))) (.cse35 (not (= 2 ~E_1~0))) (.cse36 (not (= 0 ~t2_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse4 .cse20 .cse11 .cse13 .cse14 .cse15 .cse21 .cse17 .cse18 .cse19 (and .cse22 .cse7 .cse8 .cse9 (= 0 ~t2_st~0) .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse11 (and .cse22 .cse6 .cse7 .cse8 .cse9 .cse10) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse23 (not (= ~T1_E~0 2)) .cse24 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (or .cse25 .cse26 .cse27 .cse28) .cse29 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse10) (not (= ~m_i~0 1)) .cse21 .cse35 (not (= 1 ~t2_i~0)) .cse36 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse26 .cse18 (and .cse5 .cse30 .cse6 .cse9 .cse32 .cse10) .cse19 .cse28) (or .cse1 .cse3 .cse4 (and (= ~t2_st~0 2) .cse34) .cse11 .cse13 (or .cse24 .cse35 (not (= 2 |old(~t2_st~0)|))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse23 .cse29 (and .cse8 .cse31 .cse33 .cse34) (or .cse1 .cse13 .cse14 .cse4 .cse24 .cse21 .cse17 .cse35) .cse36)))) [2018-11-22 23:41:35,057 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-22 23:41:35,057 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse13 (= 1 ~t1_pc~0)) (.cse14 (= ~token~0 |old(~token~0)|)) (.cse15 (= ~m_st~0 2)) (.cse16 (= |old(~E_2~0)| ~E_2~0)) (.cse17 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (not (= 0 ~local~0))) (.cse20 (not (= |old(~token~0)| 0))) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= 0 ~m_pc~0))) (.cse18 (not (= 2 |old(~E_2~0)|))) (.cse24 (not (= 2 ~E_M~0))) (.cse19 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~t2_st~0)|))) (.cse25 (not (= 2 ~E_1~0))) (.cse26 (not (= 0 ~t2_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse5 (< |old(~token~0)| ~local~0)) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse28 (not (= 1 ~t2_pc~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 (= 0 ~t2_st~0) .cse17)) (or .cse18 (not (= ~T1_E~0 2)) .cse19 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (or .cse20 .cse21 .cse22 .cse23) .cse24 (not (= ~m_i~0 1)) .cse9 .cse25 (not (= 1 ~t2_i~0)) .cse26 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 (and .cse13 (<= |old(~t2_st~0)| ~t2_st~0) .cse14 .cse15 .cse16 .cse17) .cse6 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse27 .cse22 .cse4 .cse6 .cse7 .cse8 .cse28 .cse20 .cse21 .cse11 .cse12 .cse23) (or .cse18 .cse24 (or .cse1 .cse6 .cse7 .cse3 .cse19 .cse9 .cse10 .cse25) .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse28 .cse10 .cse11 .cse12))) [2018-11-22 23:41:35,057 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-11-22 23:41:35,057 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse16 (<= 2 ~E_2~0)) (.cse18 (= ~m_st~0 2)) (.cse19 (<= (+ ~local~0 1) ~token~0)) (.cse23 (= |old(~t1_pc~0)| 1))) (let ((.cse27 (not (= |old(~token~0)| 0))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse22 (not (= 0 ~local~0))) (.cse29 (not (= 0 ~m_pc~0))) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (= ~token~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse17 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (<= |old(~E_2~0)| ~E_2~0)) (.cse11 (not (= 1 ~t2_pc~0))) (.cse30 (not (= 2 |old(~E_2~0)|))) (.cse32 (not (= 2 ~E_M~0))) (.cse35 (= ~t1_pc~0 1)) (.cse36 (= ~t1_st~0 2)) (.cse37 (= ~t2_st~0 0)) (.cse31 (not (= |old(~t1_pc~0)| 0))) (.cse34 (not (= 2 ~E_1~0))) (.cse38 (not (= 0 ~t2_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse4 (< ~local~0 |old(~token~0)|)) (.cse5 (not (= 2 |old(~m_st~0)|))) (.cse6 (not .cse23)) (.cse7 (< |old(~token~0)| ~local~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse33 (not (= 0 |old(~t2_st~0)|))) (.cse12 (not (= 1 ~m_pc~0))) (.cse20 (< |old(~E_2~0)| 2)) (.cse3 (and .cse13 .cse14 .cse15 .cse16 .cse18 (= 0 ~t2_st~0) .cse19)) (.cse21 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse22 .cse23 (and .cse13 .cse14 .cse24 .cse17 .cse25 .cse26) .cse8 .cse9 .cse10 .cse11 .cse27 .cse28 .cse20 .cse21 .cse29) (or .cse30 (not (= ~T1_E~0 2)) .cse31 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (or .cse27 .cse28 .cse22 .cse29) .cse32 (not (= ~m_i~0 1)) .cse33 .cse34 (not (= 1 ~t2_i~0)) (and .cse35 .cse24 .cse36 .cse37 .cse25 .cse26) .cse38 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse23 .cse8 .cse9 (and .cse13 .cse14 .cse17 (= ~token~0 |old(~token~0)|) .cse18 .cse26) .cse10 .cse11 .cse12 .cse20 .cse21) (or .cse30 .cse32 (and .cse35 .cse18 .cse36 .cse37 (= ~E_2~0 2)) (or .cse1 .cse8 .cse9 .cse5 .cse31 .cse33 .cse12 .cse34) .cse38) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse33 .cse12 .cse20 .cse3 .cse21)))) [2018-11-22 23:41:35,058 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse15 (not (= ~E_2~0 0))) (.cse16 (= ~m_st~0 2)) (.cse17 (<= (+ ~local~0 1) ~token~0)) (.cse18 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (not (= 0 ~local~0))) (.cse23 (not (= |old(~token~0)| 0))) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse26 (not (= 0 ~m_pc~0))) (.cse21 (not (= 2 |old(~E_2~0)|))) (.cse27 (not (= 2 ~E_M~0))) (.cse22 (not (= |old(~t1_pc~0)| 0))) (.cse20 (not (= 0 |old(~t2_st~0)|))) (.cse28 (not (= 2 ~E_1~0))) (.cse29 (not (= 0 ~t2_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse5 (< |old(~token~0)| ~local~0)) (.cse19 (= |old(~t1_pc~0)| 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 (<= |old(~t2_st~0)| ~t2_st~0) .cse16 .cse17 .cse18)) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse4 (not .cse19) .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 (= 0 ~t2_st~0) .cse17 .cse18)) (or .cse21 (not (= ~T1_E~0 2)) .cse22 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (or .cse23 .cse24 .cse25 .cse26) .cse27 (not (= ~m_i~0 1)) .cse20 .cse28 (not (= 1 ~t2_i~0)) .cse29 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse25 .cse19 .cse6 .cse7 .cse8 .cse9 .cse23 .cse24 .cse11 .cse12 .cse26) (or .cse21 .cse27 (or .cse1 .cse6 .cse7 .cse4 .cse22 .cse20 .cse10 .cse28) .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-22 23:41:35,058 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-11-22 23:41:35,058 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-11-22 23:41:35,058 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse40 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse39 (= ~t1_st~0 0)) (.cse27 (= 0 |old(~m_st~0)|)) (.cse42 (+ ~local~0 2)) (.cse38 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= ~m_st~0 2)) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (+ ~local~0 1))) (let ((.cse19 (< 0 ~t2_pc~0)) (.cse16 (< ~token~0 .cse43)) (.cse23 (= 0 ~t2_st~0)) (.cse17 (< .cse43 ~token~0)) (.cse18 (= 0 ~E_2~0)) (.cse3 (and .cse38 .cse37 .cse24)) (.cse0 (< ~E_1~0 2)) (.cse5 (< .cse42 ~token~0)) (.cse32 (not .cse27)) (.cse14 (< ~token~0 .cse42)) (.cse29 (and .cse22 .cse39 (= ~t2_st~0 0))) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse31 (not (= ~t1_pc~0 0))) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse36 (not (= 0 ~t2_pc~0))) (.cse33 (not (= 0 ~m_pc~0))) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse30 (not (= 2 ~E_M~0))) (.cse11 (not .cse28)) (.cse35 (not (= 2 ~E_1~0))) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse20 (< ~local~0 ~token~0)) (.cse6 (not .cse40)) (.cse21 (< ~token~0 ~local~0)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse41 (and .cse22 .cse38 .cse24)) (.cse26 (= 0 ~E_1~0)) (.cse12 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse11 .cse17 .cse13 .cse18 .cse3) (or .cse1 .cse19 .cse20 .cse6 .cse21 .cse7 (and .cse22 .cse23 .cse24) .cse8 .cse15 .cse10 .cse25 .cse26 .cse12 .cse13 .cse27 .cse28) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse29 .cse30 (or (not (= ~token~0 0)) .cse31 .cse32 (not (= 0 ~local~0)) .cse33 .cse34) (not (= ~m_i~0 1)) .cse25 .cse35 (not (= 1 ~t2_i~0)) .cse36 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse19 .cse4 .cse6 .cse7 .cse8 .cse15 .cse16 .cse25 .cse11 (and .cse37 .cse23 .cse24) .cse17 .cse13 .cse18) (or .cse1 .cse2 .cse20 .cse21 (and .cse22 .cse38 .cse39) .cse40 .cse7 .cse8 .cse34 .cse15 .cse9 .cse26 .cse12 .cse13 .cse27 .cse28) (or .cse0 (not .cse15) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse41 .cse14) (or .cse1 .cse29 .cse20 .cse21 .cse7 .cse8 .cse30 .cse34 .cse31 (not (= 1 ~E_1~0)) .cse25 .cse12 .cse27 .cse36 .cse33) (or (not (= 2 |old(~t2_st~0)|)) .cse1 .cse4 .cse6 .cse7 .cse8 .cse30 .cse9 (not (= |old(~t1_st~0)| 2)) .cse11 .cse35 .cse12 (and .cse37 (= ~t1_st~0 2) (= ~t2_st~0 2))) (or .cse1 .cse2 .cse20 .cse6 .cse21 .cse7 .cse8 .cse15 .cse9 .cse10 .cse41 .cse26 .cse12 .cse13 .cse27)))) [2018-11-22 23:41:35,059 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse42 (= ~t1_pc~0 1)) (.cse35 (= 1 ~m_pc~0)) (.cse43 (+ ~local~0 1)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= activate_threads_~tmp~1 0)) (.cse41 (= ~t1_st~0 0)) (.cse11 (= 0 |old(~m_st~0)|)) (.cse44 (+ ~local~0 2)) (.cse21 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse27 (= ~m_st~0 2)) (.cse22 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse19 (and .cse21 .cse27 .cse22)) (.cse17 (< .cse44 ~token~0)) (.cse26 (< ~token~0 .cse44)) (.cse6 (not (= 2 ~E_M~0))) (.cse8 (not (= ~t1_pc~0 0))) (.cse40 (not .cse11)) (.cse13 (not (= 0 ~m_pc~0))) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (= 2 ~E_1~0))) (.cse0 (and .cse30 .cse31 .cse41 (= ~t2_st~0 0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse14 (< ~E_1~0 2)) (.cse29 (< 0 ~t2_pc~0)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse37 (< ~token~0 .cse43)) (.cse9 (not (= 0 |old(~t2_st~0)|))) (.cse25 (not .cse35)) (.cse32 (= 0 ~t2_st~0)) (.cse38 (< .cse43 ~token~0)) (.cse39 (= 0 ~E_2~0)) (.cse1 (= ~T1_E~0 0)) (.cse36 (< |old(~t2_st~0)| 2)) (.cse2 (< ~local~0 ~token~0)) (.cse18 (not .cse42)) (.cse3 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse24 (< |old(~t1_st~0)| 2)) (.cse20 (= ~m_st~0 0)) (.cse33 (= 0 ~E_1~0)) (.cse10 (< ~E_2~0 2)) (.cse34 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 1 ~E_1~0)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (not .cse15) .cse1 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21 .cse22) .cse4 .cse5 .cse23 .cse24 .cse25 .cse10 .cse26) (or (not (= 2 |old(~t2_st~0)|)) .cse1 .cse16 (and .cse27 (= ~t1_st~0 2) (= ~t2_st~0 2)) .cse18 .cse4 .cse5 .cse6 .cse23 (not (= |old(~t1_st~0)| 2)) .cse25 .cse28 .cse10) (or .cse1 .cse29 .cse2 .cse18 .cse3 (and .cse30 .cse31 .cse32 .cse22) .cse4 .cse5 .cse15 .cse24 .cse9 .cse33 .cse10 .cse34 .cse11 .cse35) (or .cse14 .cse1 .cse36 .cse16 .cse18 .cse4 .cse5 .cse15 .cse23 .cse37 .cse25 .cse38 .cse34 .cse39 .cse19) (or .cse14 .cse1 .cse36 (and .cse30 .cse21 .cse22) .cse17 .cse18 .cse4 .cse5 .cse15 .cse23 .cse24 .cse40 .cse25 .cse10 .cse34 .cse26) (or .cse14 .cse27 .cse1 .cse36 .cse2 .cse16 .cse18 .cse3 .cse4 .cse5 .cse15 .cse23 .cse24 .cse10 .cse34) (or .cse14 .cse1 .cse36 .cse19 .cse16 .cse17 .cse18 .cse4 .cse5 .cse15 .cse23 .cse24 .cse25 .cse10 .cse34 .cse26) (or .cse1 .cse36 (and .cse30 .cse21 .cse31 .cse41) .cse2 .cse3 .cse42 .cse4 .cse5 .cse7 .cse15 .cse23 .cse33 .cse10 .cse34 .cse11 .cse35) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse6 (or (not (= ~token~0 0)) .cse8 .cse40 (not (= 0 ~local~0)) .cse13 .cse7) (not (= ~m_i~0 1)) .cse9 .cse28 .cse0 (not (= 1 ~t2_i~0)) .cse12 (not (= 2 ~M_E~0))) (or .cse14 .cse1 .cse29 .cse16 .cse18 .cse4 .cse5 .cse15 .cse37 .cse9 .cse25 (and .cse27 .cse32 .cse22) .cse38 .cse34 .cse39) (or .cse1 .cse36 .cse2 .cse18 .cse3 .cse4 .cse5 (and .cse30 .cse31) .cse15 .cse23 .cse24 .cse33 .cse10 .cse34 .cse11 .cse35) (or .cse1 .cse36 .cse2 .cse18 .cse3 .cse4 .cse5 .cse15 .cse23 .cse24 (and .cse21 (or .cse30 .cse20) .cse22) .cse33 .cse10 .cse34 .cse11)))) [2018-11-22 23:41:35,059 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-22 23:41:35,059 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-11-22 23:41:35,059 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse40 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse39 (= ~t1_st~0 0)) (.cse27 (= 0 |old(~m_st~0)|)) (.cse42 (+ ~local~0 2)) (.cse38 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= ~m_st~0 2)) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (+ ~local~0 1))) (let ((.cse19 (< 0 ~t2_pc~0)) (.cse16 (< ~token~0 .cse43)) (.cse23 (= 0 ~t2_st~0)) (.cse17 (< .cse43 ~token~0)) (.cse18 (= 0 ~E_2~0)) (.cse3 (and .cse38 .cse37 .cse24)) (.cse0 (< ~E_1~0 2)) (.cse5 (< .cse42 ~token~0)) (.cse32 (not .cse27)) (.cse14 (< ~token~0 .cse42)) (.cse29 (and .cse22 .cse39 (= ~t2_st~0 0))) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse31 (not (= ~t1_pc~0 0))) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse36 (not (= 0 ~t2_pc~0))) (.cse33 (not (= 0 ~m_pc~0))) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse30 (not (= 2 ~E_M~0))) (.cse11 (not .cse28)) (.cse35 (not (= 2 ~E_1~0))) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse20 (< ~local~0 ~token~0)) (.cse6 (not .cse40)) (.cse21 (< ~token~0 ~local~0)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse41 (and .cse22 .cse38 .cse24)) (.cse26 (= 0 ~E_1~0)) (.cse12 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse11 .cse17 .cse13 .cse18 .cse3) (or .cse1 .cse19 .cse20 .cse6 .cse21 .cse7 (and .cse22 .cse23 .cse24) .cse8 .cse15 .cse10 .cse25 .cse26 .cse12 .cse13 .cse27 .cse28) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse29 .cse30 (or (not (= ~token~0 0)) .cse31 .cse32 (not (= 0 ~local~0)) .cse33 .cse34) (not (= ~m_i~0 1)) .cse25 .cse35 (not (= 1 ~t2_i~0)) .cse36 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse19 .cse4 .cse6 .cse7 .cse8 .cse15 .cse16 .cse25 .cse11 (and .cse37 .cse23 .cse24) .cse17 .cse13 .cse18) (or .cse1 .cse2 .cse20 .cse21 (and .cse22 .cse38 .cse39) .cse40 .cse7 .cse8 .cse34 .cse15 .cse9 .cse26 .cse12 .cse13 .cse27 .cse28) (or .cse0 (not .cse15) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse41 .cse14) (or .cse1 .cse29 .cse20 .cse21 .cse7 .cse8 .cse30 .cse34 .cse31 (not (= 1 ~E_1~0)) .cse25 .cse12 .cse27 .cse36 .cse33) (or (not (= 2 |old(~t2_st~0)|)) .cse1 .cse4 .cse6 .cse7 .cse8 .cse30 .cse9 (not (= |old(~t1_st~0)| 2)) .cse11 .cse35 .cse12 (and .cse37 (= ~t1_st~0 2) (= ~t2_st~0 2))) (or .cse1 .cse2 .cse20 .cse6 .cse21 .cse7 .cse8 .cse15 .cse9 .cse10 .cse41 .cse26 .cse12 .cse13 .cse27)))) [2018-11-22 23:41:35,059 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-11-22 23:41:35,059 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-11-22 23:41:35,059 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-11-22 23:41:35,060 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-11-22 23:41:35,060 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-22 23:41:35,060 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse19 (= 0 |old(~m_st~0)|)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= activate_threads_~tmp~1 0)) (.cse8 (= ~t1_st~0 0)) (.cse20 (= 1 ~m_pc~0)) (.cse44 (+ ~local~0 1)) (.cse39 (= ~t1_pc~0 1)) (.cse10 (= activate_threads_~tmp___0~0 0)) (.cse36 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= ~m_st~0 2)) (.cse11 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (+ ~local~0 2))) (let ((.cse24 (< .cse45 ~token~0)) (.cse28 (< ~token~0 .cse45)) (.cse26 (and .cse10 .cse36 .cse37 .cse11)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse25 (not (= 1 ~t2_pc~0))) (.cse14 (< |old(~t1_st~0)| 2)) (.cse16 (= 0 ~E_1~0)) (.cse17 (< ~E_2~0 2)) (.cse35 (= ~m_st~0 0)) (.cse21 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< 0 ~t2_pc~0)) (.cse23 (not (= 2 |old(~m_st~0)|))) (.cse3 (not .cse39)) (.cse9 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse41 (< ~token~0 .cse44)) (.cse27 (not .cse20)) (.cse7 (= 0 ~t2_st~0)) (.cse42 (< .cse44 ~token~0)) (.cse18 (= 0 ~E_M~0)) (.cse43 (= 0 ~E_2~0)) (.cse29 (and .cse10 .cse5 .cse6 .cse8 (= ~t2_st~0 0))) (.cse30 (not (= 2 ~E_M~0))) (.cse32 (not (= ~t1_pc~0 0))) (.cse38 (not .cse19)) (.cse34 (not (= 0 ~m_pc~0))) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse15 (not (= 0 |old(~t2_st~0)|))) (.cse40 (not (= 2 ~E_1~0))) (.cse33 (not (= 0 ~t2_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 (and .cse10 .cse5 .cse6 .cse7 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse22 .cse23 .cse24 .cse3 .cse9 .cse12 .cse13 .cse25 .cse14 .cse26 .cse27 .cse17 .cse18 .cse28) (or .cse0 .cse2 .cse4 .cse29 .cse9 .cse12 .cse30 .cse31 .cse32 (not (= 1 ~E_1~0)) .cse15 .cse17 .cse19 .cse33 .cse34) (or .cse21 (not .cse13) .cse26 .cse0 .cse23 (and .cse35 .cse10 .cse36 .cse11) .cse24 .cse3 .cse9 .cse12 .cse25 .cse14 .cse27 .cse17 .cse28) (or .cse21 .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse9 .cse12 .cse13 .cse25 .cse14 .cse27 (and .cse37 .cse11) .cse17 .cse18) (or .cse0 .cse22 .cse2 .cse3 .cse4 .cse9 (and .cse5 .cse6) .cse12 .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse22 .cse24 .cse3 .cse9 .cse12 .cse13 .cse25 .cse14 .cse38 .cse27 .cse17 .cse18 .cse28 (and .cse10 .cse5 .cse36 .cse11)) (or .cse0 .cse22 .cse2 .cse4 .cse39 .cse9 .cse12 .cse31 .cse13 .cse25 .cse16 .cse17 .cse18 .cse19 (and .cse10 .cse5 .cse36 .cse6 .cse8) .cse20) (or (not (= 2 |old(~t2_st~0)|)) .cse0 (and .cse10 .cse37 (= ~t1_st~0 2) (= ~t2_st~0 2)) .cse23 .cse3 .cse9 .cse12 .cse30 .cse25 (not (= |old(~t1_st~0)| 2)) .cse27 .cse40 .cse17) (or .cse21 .cse0 .cse22 .cse23 .cse3 .cse26 .cse9 .cse12 .cse13 .cse25 .cse41 .cse27 .cse42 .cse18 .cse43) (or .cse0 .cse22 .cse2 .cse3 .cse4 .cse9 (and (or (and .cse35 .cse8) (and .cse5 .cse8)) .cse36) .cse12 .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19 (and .cse10 .cse36 (or .cse5 .cse35) .cse11)) (or .cse21 .cse0 .cse1 .cse23 .cse3 .cse9 .cse12 .cse13 .cse41 .cse15 .cse27 (and .cse10 .cse37 .cse7 .cse11) .cse42 .cse18 .cse43) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse29 (not (= ~T2_E~0 2)) .cse30 (or (not (= ~token~0 0)) .cse32 .cse38 (not (= 0 ~local~0)) .cse34 .cse31) (not (= ~m_i~0 1)) .cse15 .cse40 (not (= 1 ~t2_i~0)) .cse33 (not (= 2 ~M_E~0)))))) [2018-11-22 23:41:35,060 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-11-22 23:41:35,060 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse31 (= ~t1_pc~0 1)) (.cse29 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse27 (= ~m_st~0 2)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= 1 ~m_pc~0)) (.cse33 (+ ~local~0 1))) (let ((.cse15 (< 0 ~t2_pc~0)) (.cse9 (< ~token~0 .cse33)) (.cse19 (= 0 ~t2_st~0)) (.cse11 (< .cse33 ~token~0)) (.cse13 (= 0 ~E_2~0)) (.cse0 (< ~E_1~0 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse10 (not .cse26)) (.cse14 (and .cse29 .cse27 .cse20)) (.cse30 (= ~t1_st~0 0)) (.cse32 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (= 0 |old(~t2_st~0)|))) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse16 (< ~local~0 ~token~0)) (.cse4 (not .cse31)) (.cse17 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse21 (< |old(~t1_st~0)| 2)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= 0 ~E_1~0)) (.cse24 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0)) (.cse25 (= 0 |old(~m_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse15 .cse16 .cse4 .cse17 .cse5 (and .cse18 .cse19 .cse20) .cse6 .cse7 .cse21 .cse22 .cse23 .cse24 .cse12 .cse25 .cse26) (or .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 (and .cse27 .cse19 .cse20) .cse11 .cse12 .cse13) (let ((.cse28 (+ ~local~0 2))) (or .cse0 (not .cse7) .cse1 .cse3 (< .cse28 ~token~0) .cse4 .cse5 .cse6 .cse8 .cse21 .cse10 .cse14 .cse24 (< ~token~0 .cse28))) (or .cse1 .cse2 .cse16 .cse17 (and .cse18 .cse29 .cse30) .cse31 .cse5 .cse6 .cse32 .cse7 .cse8 .cse23 .cse24 .cse12 .cse25 .cse26) (or .cse1 (and .cse18 .cse30 (= ~t2_st~0 0)) .cse16 .cse17 .cse5 .cse6 (not (= 2 ~E_M~0)) .cse32 (not (= ~t1_pc~0 0)) (not (= 1 ~E_1~0)) .cse22 .cse24 .cse25 (not (= 0 ~t2_pc~0)) (not (= 0 ~m_pc~0))) (or .cse1 .cse2 .cse16 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse21 (and .cse18 .cse29 .cse20) .cse23 .cse24 .cse12 .cse25)))) [2018-11-22 23:41:35,061 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-11-22 23:41:35,061 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse26 (+ ~local~0 1))) (let ((.cse18 (not (= 0 ~local~0))) (.cse17 (not (= |old(~token~0)| 0))) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= 0 ~m_pc~0))) (.cse9 (< |old(~token~0)| .cse26)) (.cse12 (< .cse26 |old(~token~0)|)) (.cse16 (not (= ~t1_pc~0 0))) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse25 (< |old(~token~0)| ~local~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse11 (< ~E_2~0 2)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse1 (= ~T1_E~0 0)) (.cse14 (not (= 2 ~E_2~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse20 (not (= 2 |old(~E_M~0)|))) (.cse10 (not (= 1 ~m_pc~0))) (.cse22 (not (= 2 ~E_1~0))) (.cse23 (not (= 0 |old(~t2_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (not (= ~T1_E~0 2)) .cse15 .cse16 (not (= 1 ~t1_i~0)) (or .cse17 .cse18 .cse19) (not (= ~T2_E~0 2)) .cse20 .cse21 (not (= ~m_i~0 1)) .cse22 (not (= 1 ~t2_i~0)) .cse23 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse21 .cse11 .cse13 .cse19) (or .cse0 .cse1 (and (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 2) (<= |old(~t1_st~0)| ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse24 .cse3 .cse25 .cse5 .cse6 .cse20 .cse15 .cse16 .cse10 .cse22 .cse11 .cse23) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse25 .cse5 .cse6 .cse15 .cse7 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13) (or .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse20 (not (= |old(~t1_st~0)| 2)) .cse10 .cse22 .cse23)))) [2018-11-22 23:41:35,061 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse41 (+ ~local~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse5 (= 1 ~t2_pc~0)) (.cse27 (= ~token~0 |old(~token~0)|)) (.cse9 (= ~m_st~0 2)) (.cse6 (<= 2 ~t2_st~0)) (.cse8 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse22 (= ~t2_st~0 2)) (.cse30 (< ~local~0 |old(~token~0)|)) (.cse31 (< |old(~token~0)| ~local~0)) (.cse10 (not (= 2 |old(~m_st~0)|))) (.cse34 (and .cse2 .cse3 .cse5 .cse27 .cse9 .cse6 .cse8)) (.cse16 (< |old(~token~0)| .cse41)) (.cse17 (not (= 1 ~m_pc~0))) (.cse19 (< .cse41 |old(~token~0)|)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse29 (< 0 |old(~t2_pc~0)|)) (.cse11 (not (= ~t1_pc~0 1))) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse18 (< ~E_2~0 2)) (.cse20 (= 0 |old(~E_M~0)|)) (.cse23 (not (= 2 ~E_2~0))) (.cse32 (not (= |old(~t1_st~0)| 0))) (.cse33 (not (= ~t1_pc~0 0))) (.cse38 (not (= |old(~token~0)| 0))) (.cse35 (not (= 0 ~local~0))) (.cse40 (not (= 0 ~m_pc~0))) (.cse24 (not (= 2 |old(~E_M~0)|))) (.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse28 (= ~t1_st~0 0)) (.cse37 (= ~token~0 0)) (.cse39 (not (= 0 |old(~m_st~0)|))) (.cse25 (not (= 2 ~E_1~0))) (.cse26 (not (= 0 |old(~t2_pc~0)|)))) (and (let ((.cse21 (+ ~local~0 2))) (let ((.cse4 (<= ~token~0 .cse21)) (.cse7 (<= .cse21 ~token~0))) (or .cse0 .cse1 (and (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7 .cse8) .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 1 |old(~t2_pc~0)|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) (or .cse1 (and .cse5 (= ~E_M~0 2) .cse9 (= ~t1_st~0 2) .cse22) .cse23 .cse10 .cse11 .cse12 .cse13 .cse24 (not (= |old(~t1_st~0)| 2)) .cse17 .cse25 .cse26) (or .cse0 .cse1 (and .cse2 .cse3 .cse5 .cse27 .cse9 .cse6 .cse28) .cse29 .cse30 .cse10 .cse11 .cse31 .cse12 .cse13 .cse32 .cse14 .cse17 .cse18 .cse20) (or .cse1 .cse30 .cse10 .cse31 .cse12 .cse13 .cse24 .cse32 .cse33 .cse17 (and .cse2 .cse3 .cse5 .cse27 .cse9 .cse22 .cse28) .cse25 .cse18 .cse26) (or .cse0 .cse1 .cse29 .cse30 .cse10 .cse11 .cse31 .cse34 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse29 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse29 .cse35 .cse11 (and .cse2 .cse3 .cse5 .cse36 .cse6 .cse37 .cse8) .cse12 .cse13 .cse14 .cse38 .cse15 .cse39 .cse18 .cse20 .cse40) (or .cse23 (not (= ~T1_E~0 2)) .cse32 .cse33 (not (= 1 ~t1_i~0)) (or .cse38 .cse35 .cse40) (not (= ~T2_E~0 2)) .cse24 (and .cse2 .cse3 .cse5 .cse36 .cse6 .cse28 .cse37) .cse39 (not (= ~m_i~0 1)) .cse25 (not (= 1 ~t2_i~0)) .cse26 (not (= 2 ~M_E~0)))))) [2018-11-22 23:41:35,061 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-11-22 23:41:35,062 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse27 (+ ~local~0 1))) (let ((.cse18 (not (= 0 ~local~0))) (.cse17 (not (= |old(~token~0)| 0))) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= 0 ~m_pc~0))) (.cse9 (< |old(~token~0)| .cse27)) (.cse12 (< .cse27 |old(~token~0)|)) (.cse16 (not (= ~t1_pc~0 0))) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse25 (< ~local~0 |old(~token~0)|)) (.cse26 (< |old(~token~0)| ~local~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse11 (< ~E_2~0 2)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse1 (= ~T1_E~0 0)) (.cse14 (not (= 2 ~E_2~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse20 (not (= 2 |old(~E_M~0)|))) (.cse10 (not (= 1 ~m_pc~0))) (.cse22 (not (= 2 ~E_1~0))) (.cse23 (not (= 0 |old(~t2_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (not (= ~T1_E~0 2)) .cse15 .cse16 (not (= 1 ~t1_i~0)) (or .cse17 .cse18 .cse19) (not (= ~T2_E~0 2)) .cse20 .cse21 (not (= ~m_i~0 1)) .cse22 (not (= 1 ~t2_i~0)) .cse23 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse21 .cse11 .cse13 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse24 (+ ~local~0 2))) (and (<= ~token~0 .cse24) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~m_st~0 2) (<= .cse24 ~token~0) (<= |old(~t1_st~0)| ~t1_st~0) (= 1 ~E_M~0)))) (or .cse1 .cse25 .cse3 .cse26 .cse5 .cse6 .cse20 .cse15 .cse16 .cse10 .cse22 .cse11 .cse23) (or .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse26 .cse5 .cse6 .cse15 .cse7 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse2 .cse25 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13) (or .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse20 (not (= |old(~t1_st~0)| 2)) .cse10 .cse22 .cse23)))) [2018-11-22 23:41:35,062 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-22 23:41:35,062 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse42 (+ ~local~0 1)) (.cse18 (not (= ~E_M~0 0))) (.cse19 (not (= ~E_M~0 1))) (.cse21 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse30 (= ~token~0 |old(~token~0)|)) (.cse24 (= ~m_st~0 2)) (.cse23 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse10 (and .cse18 .cse19 .cse21 .cse30 .cse24 .cse23)) (.cse9 (< |old(~token~0)| .cse42)) (.cse13 (< .cse42 |old(~token~0)|)) (.cse28 (not (= ~t1_pc~0 0))) (.cse39 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_st~0 0)) (.cse40 (<= ~local~0 ~token~0)) (.cse15 (< ~local~0 |old(~token~0)|)) (.cse16 (< |old(~token~0)| ~local~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse35 (not (= 2 ~E_2~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse26 (not (= 2 |old(~E_M~0)|))) (.cse11 (not (= 1 ~m_pc~0))) (.cse33 (not (= 2 ~E_1~0))) (.cse29 (= ~E_M~0 2)) (.cse31 (= ~t2_pc~0 0)) (.cse34 (not (= 0 |old(~t2_pc~0)|))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse37 (not (= 0 ~local~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse36 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse41 (not (= 0 |old(~m_st~0)|))) (.cse12 (< ~E_2~0 2)) (.cse17 (= ~m_st~0 0)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse38 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse10 .cse2 .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14) (let ((.cse25 (+ ~local~0 2))) (let ((.cse20 (<= ~token~0 .cse25)) (.cse22 (<= .cse25 ~token~0))) (or .cse0 (and .cse17 .cse18 .cse19 .cse20 (= 1 ~t2_pc~0) .cse21 .cse22 .cse23) .cse1 (and .cse18 .cse19 .cse20 .cse21 .cse24 .cse22 .cse23) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) (or .cse1 .cse15 .cse3 .cse16 .cse5 .cse6 .cse26 .cse27 .cse28 (and .cse21 .cse29 .cse30 .cse24 .cse31 .cse32) .cse11 .cse33 .cse12 .cse34) (or .cse35 (not (= ~T1_E~0 2)) .cse27 .cse28 (not (= 1 ~t1_i~0)) (or .cse36 .cse37 .cse38) (and .cse21 .cse29 .cse31 (and .cse32 .cse17) .cse39 .cse40) (not (= ~T2_E~0 2)) .cse26 .cse41 (not (= ~m_i~0 1)) .cse33 (not (= 1 ~t2_i~0)) .cse34 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 (and .cse21 .cse39 (and .cse18 .cse32) .cse24 .cse40 .cse19) .cse15 .cse3 .cse4 .cse16 .cse5 .cse6 .cse27 .cse7 .cse11 .cse12 .cse14) (or .cse1 .cse35 .cse3 .cse4 .cse5 .cse6 .cse26 (not (= |old(~t1_st~0)| 2)) .cse11 .cse33 (and .cse21 .cse29 .cse24 (= ~t1_st~0 2) .cse31) .cse34) (or .cse0 .cse1 .cse2 .cse37 .cse4 .cse5 .cse6 .cse7 .cse36 .cse8 .cse41 .cse12 (and .cse21 .cse17 (<= ~t2_pc~0 0) .cse18 (= ~token~0 0) .cse23 .cse19) .cse14 .cse38)))) [2018-11-22 23:41:35,062 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse31 (<= ~t2_pc~0 0)) (.cse32 (= |old(~E_M~0)| ~E_M~0)) (.cse24 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse34 (= ~token~0 |old(~token~0)|)) (.cse35 (= ~m_st~0 2)) (.cse33 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (+ ~local~0 1))) (let ((.cse19 (not (= 0 ~local~0))) (.cse18 (not (= |old(~token~0)| 0))) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse28 (= ~token~0 0)) (.cse20 (not (= 0 ~m_pc~0))) (.cse10 (< |old(~token~0)| .cse38)) (.cse13 (< .cse38 |old(~token~0)|)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse6 (and .cse31 .cse32 .cse24 .cse34 .cse35 .cse33)) (.cse17 (not (= ~t1_pc~0 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse36 (< ~local~0 |old(~token~0)|)) (.cse37 (< |old(~token~0)| ~local~0)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 |old(~E_M~0)|)) (.cse12 (< ~E_2~0 2)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse27 (= ~t1_st~0 0)) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (= 2 ~E_2~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse21 (not (= 2 |old(~E_M~0)|))) (.cse25 (= ~E_M~0 2)) (.cse26 (= ~t2_pc~0 0)) (.cse11 (not (= 1 ~m_pc~0))) (.cse29 (not (= 2 ~E_1~0))) (.cse30 (not (= 0 |old(~t2_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 (not (= ~T1_E~0 2)) .cse16 .cse17 (not (= 1 ~t1_i~0)) (or .cse18 .cse19 .cse20) (not (= ~T2_E~0 2)) .cse21 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (not (= ~m_i~0 1)) .cse29 (not (= 1 ~t2_i~0)) .cse30 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse7 .cse8 .cse18 .cse9 .cse22 (and .cse31 .cse32 .cse23 .cse24 .cse28 .cse33) .cse12 .cse14 .cse20) (or .cse0 .cse1 (and .cse32 (= 1 ~t2_pc~0) .cse24 .cse34 .cse35 .cse33) .cse3 .cse4 .cse5 .cse7 .cse8 (not (= 1 |old(~t2_pc~0)|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse36 .cse3 .cse4 .cse37 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse6 .cse14) (or .cse1 .cse36 .cse3 (and .cse24 .cse25 .cse34 .cse35 .cse26 .cse27) .cse37 .cse5 .cse7 .cse21 .cse16 .cse17 .cse11 .cse29 .cse12 .cse30) (or .cse0 .cse1 .cse2 .cse36 .cse3 .cse4 .cse37 .cse5 .cse7 .cse16 .cse8 .cse11 .cse12 .cse14 (and .cse31 .cse32 .cse24 .cse34 .cse35 .cse27)) (or .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse21 (not (= |old(~t1_st~0)| 2)) (and .cse24 .cse25 .cse35 (= ~t1_st~0 2) .cse26) .cse11 .cse29 .cse30)))) [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-11-22 23:41:35,063 INFO L444 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0))) (let ((.cse32 (= ~t1_pc~0 1)) (.cse22 (not (= ~token~0 0))) (.cse23 (not (= 0 ~m_st~0))) (.cse21 (not (= 0 ~local~0))) (.cse24 (not (= 0 ~m_pc~0))) (.cse12 (not .cse33)) (.cse3 (not (= 2 ~m_st~0))) (.cse34 (+ ~local~0 1))) (let ((.cse10 (< ~token~0 .cse34)) (.cse14 (< .cse34 ~token~0)) (.cse25 (not (= 2 ~E_2~0))) (.cse26 (not (= 2 ~E_M~0))) (.cse27 (not (= ~t1_pc~0 0))) (.cse28 (not (= 2 ~E_1~0))) (.cse16 (< ~t2_st~0 2)) (.cse19 (not (= ~t1_st~0 0))) (.cse20 (not (= 1 ~t2_pc~0))) (.cse2 (< 0 ~t2_pc~0)) (.cse17 (< ~local~0 ~token~0)) (.cse18 (< ~token~0 ~local~0)) (.cse8 (< ~t1_st~0 2)) (.cse0 (< ~E_1~0 2)) (.cse31 (not (= ~t1_st~0 2))) (.cse29 (not (= 0 ~t2_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse9 (= exists_runnable_thread_~__retres1~3 1)) (.cse30 (and (or .cse22 .cse23 .cse21 .cse24) (or .cse12 .cse3))) (.cse4 (not .cse32)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse11 (not (= 0 ~t2_st~0))) (.cse13 (< ~E_2~0 2)) (.cse15 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse19 .cse7 .cse20 .cse12 .cse13 .cse15 .cse9) (or .cse0 .cse9 .cse1 .cse16 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse22 .cse8 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse25 .cse17 .cse5 .cse6 .cse18 .cse9 .cse26 (or .cse27 .cse11 .cse12 .cse3 .cse19) .cse28 .cse29) (or .cse9 .cse1 .cse25 .cse30 .cse4 .cse5 .cse6 .cse26 .cse31 .cse11 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse18 .cse9 .cse5 .cse6 .cse19 .cse7 .cse11 .cse12 .cse13 .cse15) (or .cse25 (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse26 .cse9 (or .cse22 .cse27 .cse23 .cse21 .cse24 .cse19) (not (= ~m_i~0 1)) .cse11 .cse28 (not (= 1 ~t2_i~0)) .cse29 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse16 .cse9 .cse21 .cse32 .cse5 .cse6 .cse19 .cse7 .cse20 .cse22 .cse23 .cse13 .cse15 .cse24) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse9 .cse15) (or .cse0 (or .cse31 .cse29) .cse1 .cse9 .cse30 .cse4 .cse5 .cse6 .cse7 .cse11 .cse13 .cse15 .cse33))))) [2018-11-22 23:41:35,063 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse26 (+ ~local~0 2)) (.cse24 (= |old(~T2_E~0)| ~T2_E~0)) (.cse25 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse10 (not (= 0 ~m_st~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< ~t2_st~0 2)) (.cse14 (and (= |old(~E_1~0)| ~E_1~0) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25 .cse19 .cse20)) (.cse3 (< .cse26 ~token~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse15 (< ~token~0 .cse26)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse16 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse21 (not (= 2 |old(~E_M~0)|))) (.cse8 (not (= 1 ~t2_pc~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse22 (not (= 2 |old(~E_1~0)|))) (.cse12 (< |old(~E_2~0)| 2)) (.cse17 (= ~E_1~0 2)) (.cse18 (= ~E_M~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse14 .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse16 .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse17 .cse18 (= ~T2_E~0 2) .cse19 (= ~E_2~0 2) .cse20) .cse21 (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse10 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) .cse22 (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse16 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse23) .cse11 .cse12 (< .cse23 ~token~0) .cse13)) (or .cse0 .cse1 .cse2 .cse14 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or (not (= 2 ~t2_st~0)) .cse1 .cse16 .cse4 .cse5 .cse6 .cse21 .cse8 (not (= ~t1_st~0 2)) .cse11 .cse22 .cse12 (and .cse24 .cse17 .cse18 .cse25 .cse19 .cse20))))) [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-11-22 23:41:35,064 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse33 (+ ~local~0 1)) (.cse31 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 2)) (.cse20 (= 1 ~E_M~0)) (.cse15 (= 0 ~m_st~0))) (let ((.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= 0 ~t2_pc~0))) (.cse4 (not (= 0 ~m_pc~0))) (.cse3 (not .cse15)) (.cse1 (not (= 2 ~E_M~0))) (.cse7 (not (= 2 ~E_1~0))) (.cse30 (not .cse20)) (.cse27 (< .cse34 ~token~0)) (.cse28 (< ~t1_st~0 2)) (.cse29 (< ~token~0 .cse34)) (.cse16 (< ~E_1~0 2)) (.cse18 (not (= 2 ~m_st~0))) (.cse19 (not .cse31)) (.cse22 (< ~token~0 .cse33)) (.cse6 (not (= 0 ~t2_st~0))) (.cse23 (not .cse32)) (.cse24 (< .cse33 ~token~0)) (.cse26 (= 0 ~E_2~0)) (.cse9 (= ~T1_E~0 0)) (.cse17 (< ~t2_st~0 2)) (.cse10 (< ~local~0 ~token~0)) (.cse11 (< ~token~0 ~local~0)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0)) (.cse5 (not (= ~t1_st~0 0))) (.cse21 (not (= 1 ~t2_pc~0))) (.cse0 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse14 (< ~E_2~0 2)) (.cse25 (= 0 ~E_M~0))) (and (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse0 (not (= ~T2_E~0 2)) .cse1 (or (not (= ~token~0 0)) .cse2 .cse3 (not (= 0 ~local~0)) .cse4 .cse5) (not (= ~m_i~0 1)) .cse6 .cse7 (not (= 1 ~t2_i~0)) .cse8 (not (= 2 ~M_E~0))) (or .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse1 .cse5 .cse2 (not (= 1 ~E_1~0)) .cse6 .cse14 .cse15 .cse8 .cse4) (or .cse16 .cse0 .cse9 .cse17 .cse18 .cse19 .cse12 .cse13 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse16 .cse9 .cse17 .cse0 .cse27 .cse19 .cse12 .cse13 .cse21 .cse28 .cse3 .cse23 .cse14 .cse25 .cse29) (or .cse16 .cse30 .cse9 .cse27 .cse19 .cse12 .cse13 .cse21 .cse28 .cse3 .cse23 .cse14 .cse29 .cse0) (or .cse16 .cse9 .cse17 .cse18 .cse27 .cse19 .cse12 .cse13 .cse21 .cse28 .cse23 .cse14 .cse25 .cse0 .cse29) (or (not (= 2 ~t2_st~0)) .cse9 .cse18 .cse19 .cse12 .cse13 .cse1 .cse21 (not (= ~t1_st~0 2)) .cse0 .cse23 .cse7 .cse14) (or .cse16 .cse9 .cse17 .cse0 .cse10 .cse18 .cse19 .cse11 .cse12 .cse13 .cse20 .cse21 .cse28 .cse23 .cse14 .cse25) (or .cse16 .cse30 .cse9 .cse0 .cse18 .cse27 .cse19 .cse12 .cse13 .cse21 .cse28 .cse23 .cse14 .cse29) (or .cse16 .cse9 (< 0 ~t2_pc~0) .cse18 .cse19 .cse0 .cse12 .cse13 .cse20 .cse22 .cse6 .cse23 .cse24 .cse25 .cse26) (or .cse9 .cse17 .cse10 .cse11 .cse31 .cse12 .cse13 .cse5 .cse20 .cse21 .cse0 (= 0 ~E_1~0) .cse14 .cse25 .cse15 .cse32)))) [2018-11-22 23:41:35,065 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 0) (= ~t2_st~0 0)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-11-22 23:41:35,065 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,066 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_i~0 1) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~t2_i~0 1) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t1_i~0 1) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,066 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-22 23:41:35,066 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-11-22 23:41:35,067 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-22 23:41:35,067 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse15 (not (= 0 |old(~t2_st~0)|))) (.cse3 (not (= 0 |old(~local~0)|))) (.cse10 (not (= |old(~token~0)| 0))) (.cse14 (not (= 0 |old(~m_pc~0)|))) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse12 (= 0 ~E_M~0)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse16 (not .cse4)) (.cse11 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse7 .cse10 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse14 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse15 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse13 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse16 .cse5 .cse6 .cse8 .cse10 .cse17 .cse15 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse14) (let ((.cse19 (+ |old(~local~0)| 2))) (or .cse8 .cse9 .cse0 .cse17 .cse2 (let ((.cse18 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse18) (<= |old(~t2_st~0)| ~t2_st~0) (= ~m_st~0 |old(~m_st~0)|) (= ~token~0 |old(~token~0)|) (= 1 ~m_pc~0) (<= .cse18 ~token~0) (<= |old(~t1_st~0)| ~t1_st~0))) (or .cse1 (not (= 1 |old(~m_pc~0)|)) .cse12 .cse13 .cse5 .cse6) (< .cse19 |old(~token~0)|) .cse16 .cse11 (< |old(~token~0)| .cse19)))))) [2018-11-22 23:41:35,067 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse25 (= ~t1_pc~0 1)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse31 (= 1 ~t1_pc~0)) (.cse32 (not .cse5)) (.cse33 (not (= ~M_E~0 0))) (.cse34 (not (= ~E_M~0 0))) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= 2 ~E_1~0)) (.cse35 (not (= ~E_M~0 1))) (.cse30 (= 1 ~t2_pc~0)) (.cse20 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse21 (= ~m_st~0 2)) (.cse36 (<= 2 ~t2_st~0)) (.cse37 (not .cse1)) (.cse22 (= ~t1_st~0 0)) (.cse23 (= 1 ~m_pc~0)) (.cse24 (<= ~local~0 ~token~0))) (let ((.cse12 (and .cse31 .cse32 .cse33 .cse34 .cse18 .cse19 .cse35 .cse30 .cse20 .cse21 .cse36 .cse37 .cse22 .cse23 .cse24)) (.cse7 (and .cse31 .cse32 .cse33 .cse34 (<= 2 ~t1_st~0) (<= 2 ~E_2~0) .cse18 .cse19 .cse35 .cse30 .cse20 .cse21 .cse36 .cse37 .cse23 .cse29 .cse24)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse9 (not .cse30)) (.cse0 (< |old(~E_1~0)| 2)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse4 (not .cse25)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse13 (< ~E_2~0 2)) (.cse14 (= 0 ~E_M~0)) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse10 (not (= |old(~token~0)| 0))) (.cse16 (not (= 0 |old(~m_pc~0)|))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 0 |old(~m_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse17 (+ |old(~local~0)| 2))) (or .cse8 .cse9 .cse0 .cse11 .cse2 (or .cse1 (not (= 1 |old(~m_pc~0)|)) .cse14 .cse15 .cse5 .cse6) (< .cse17 |old(~token~0)|) .cse4 .cse12 .cse13 (< |old(~token~0)| .cse17) .cse7)) (or .cse0 .cse1 .cse2 .cse3 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16) (let ((.cse27 (= 0 ~t2_st~0))) (or .cse0 .cse1 (< 0 ~t2_pc~0) (and .cse18 .cse19 .cse21 .cse27 .cse22 .cse23 .cse24) .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse28 .cse13 .cse14 (and .cse18 .cse19 .cse21 .cse27 .cse23 .cse29 .cse24) .cse15 .cse16)) (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse26 .cse10 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse16 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse28 (and (= ~E_1~0 2) .cse18 .cse21 .cse22 (= ~t2_st~0 0) .cse23 .cse24) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse15 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))))))) [2018-11-22 23:41:35,068 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= 0 |old(~t2_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse17 (not .cse4)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (not (= |old(~token~0)| 0))) (.cse15 (< |old(~t1_st~0)| 2)) (.cse11 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse14 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse16 (+ |old(~local~0)| 2))) (or .cse8 .cse9 .cse0 .cse15 .cse2 (or .cse1 (not (= 1 |old(~m_pc~0)|)) .cse12 .cse13 .cse5 .cse6) (< .cse16 |old(~token~0)|) .cse17 .cse11 (< |old(~token~0)| .cse16))) (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse7 .cse10 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse14 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse18 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse13 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse17 .cse5 .cse6 .cse8 .cse10 .cse15 .cse18 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14)))) [2018-11-22 23:41:35,069 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse8 (= |old(~E_1~0)| ~E_1~0)) (.cse5 (= ~T2_E~0 0)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~T1_E~0 0))) (let ((.cse3 (not (= 0 |old(~local~0)|))) (.cse24 (and .cse8 (not .cse5) .cse11 (not (= ~M_E~0 0)) (not (= ~m_pc~0 1)) (not .cse1))) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse17 (not (= |old(~token~0)| 0))) (.cse21 (not (= 0 |old(~m_pc~0)|))) (.cse27 (not (= 0 |old(~t2_st~0)|))) (.cse9 (= ~m_pc~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~token~0 0)) (.cse14 (= ~local~0 0)) (.cse15 (= 1 ~E_M~0)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse26 (< |old(~t1_st~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse10 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse23 (= ~token~0 |old(~token~0)|)) (.cse25 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~m_st~0)|)) (.cse6 (= 0 ~M_E~0)) (.cse22 (not .cse4)) (.cse18 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse15 .cse16 .cse17 (and (and .cse23 (and .cse10 .cse24)) .cse25) .cse26 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 .cse22 .cse5 .cse6 .cse15 .cse17 (and .cse24 .cse9 (= 0 ~t2_st~0) .cse13 .cse14 .cse25) .cse26 .cse27 .cse18 .cse19 .cse20 .cse21) (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse7 .cse17 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse21 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse27 (and .cse9 (= ~E_1~0 2) .cse11 .cse12 (= ~t2_st~0 0) .cse13 .cse14) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse20 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse15 .cse16 .cse0 .cse26 .cse2 (let ((.cse28 (+ ~local~0 2))) (and .cse8 (<= ~token~0 .cse28) .cse10 .cse11 .cse23 (= 1 ~m_pc~0) (<= .cse28 ~token~0) .cse25)) (or .cse1 (not (= 1 |old(~m_pc~0)|)) .cse19 .cse20 .cse5 .cse6) (< .cse29 |old(~token~0)|) .cse22 .cse18 (< |old(~token~0)| .cse29)))))) [2018-11-22 23:41:35,070 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0 1))) (let ((.cse2 (< |old(~E_1~0)| 2)) (.cse5 (= ~T1_E~0 0)) (.cse4 (< |old(~t2_st~0)| 2)) (.cse19 (not (= 0 |old(~local~0)|))) (.cse21 (not (= ~m_pc~0 1))) (.cse15 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse16 (not (= ~E_1~0 0))) (.cse17 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (not .cse24)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse0 (= 1 ~E_M~0)) (.cse1 (not (= 1 ~t2_pc~0))) (.cse3 (< |old(~t1_st~0)| 2)) (.cse12 (< ~E_2~0 2)) (.cse6 (= 0 ~E_M~0)) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (= |old(~token~0)| 0))) (.cse23 (not (= 0 |old(~m_pc~0)|))) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (= ~t1_st~0 0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not (= 0 |old(~t2_st~0)|))) (.cse7 (= 0 |old(~m_st~0)|))) (and (let ((.cse10 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 (not (= 1 |old(~m_pc~0)|)) .cse6 .cse7 .cse8 .cse9) (< .cse10 |old(~token~0)|) .cse11 .cse12 (and .cse13 .cse14 .cse15 (= 1 ~m_pc~0) .cse16 .cse17 .cse18) (< |old(~token~0)| .cse10))) (or .cse2 .cse5 (< 0 ~t2_pc~0) .cse19 .cse11 .cse8 .cse9 .cse0 .cse20 .cse3 (and .cse21 .cse13 .cse14 (= 0 ~t2_st~0) .cse16 .cse17 .cse18) .cse22 .cse12 .cse6 .cse7 .cse23) (or .cse2 .cse5 .cse4 .cse19 .cse24 .cse8 .cse9 .cse25 (and .cse21 .cse13 .cse14 .cse15 .cse26 .cse16 .cse18) .cse0 .cse1 .cse20 .cse12 .cse6 .cse7 .cse23) (or .cse2 .cse5 .cse4 .cse19 (and .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse11 .cse8 .cse9 .cse0 .cse1 .cse20 .cse3 .cse12 .cse6 .cse7 .cse23) (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse25 .cse20 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse23 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (and (= ~m_pc~0 0) (= ~E_1~0 1) .cse13 .cse14 .cse26 (= ~t2_st~0 0) .cse18) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse22 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse7 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0)))))) [2018-11-22 23:41:35,072 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-22 23:41:35,073 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-22 23:41:35,073 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1))) (let ((.cse8 (not (= 0 |old(~t2_st~0)|))) (.cse12 (not (= 0 |old(~local~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= |old(~token~0)| 0))) (.cse2 (= ~m_pc~0 0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~token~0 0)) (.cse6 (= ~local~0 0)) (.cse7 (not (= 0 |old(~m_pc~0)|))) (.cse16 (= 1 ~E_M~0)) (.cse24 (not (= 1 ~t2_pc~0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse22 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~T1_E~0 0)) (.cse21 (= 0 ~E_M~0)) (.cse9 (= 0 |old(~m_st~0)|)) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse13 (not .cse25)) (.cse18 (< ~E_2~0 2))) (and (or (not (= 2 ~E_2~0)) (< |old(~local~0)| |old(~token~0)|) (not (= ~T1_E~0 2)) .cse0 .cse1 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) (and .cse2 (= ~E_1~0 2) .cse3 .cse4 (= ~t2_st~0 0) .cse5 .cse6) .cse7 (not (= ~T2_E~0 2)) (< |old(~token~0)| |old(~local~0)|) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse8 (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse9 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse10 .cse11 (< 0 ~t2_pc~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse1 .cse17 .cse8 .cse18 (and .cse19 .cse2 .cse3 (= 0 ~t2_st~0) .cse5 .cse6 .cse20) .cse21 .cse9 .cse7) (or (and .cse19 .cse2 .cse3 .cse22 .cse5 .cse6 .cse20) .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse1 .cse17 .cse18 .cse21 .cse9 .cse7) (or .cse10 .cse11 .cse23 .cse12 .cse25 .cse14 .cse15 .cse0 .cse16 .cse24 .cse1 (and .cse19 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6) .cse18 .cse21 .cse9 .cse7) (let ((.cse27 (+ |old(~local~0)| 2))) (or .cse16 .cse24 .cse10 .cse17 .cse23 (let ((.cse26 (+ ~local~0 2))) (and .cse19 (<= ~token~0 .cse26) .cse22 .cse3 (= ~token~0 |old(~token~0)|) (= 1 ~m_pc~0) (<= .cse26 ~token~0) .cse20)) (or .cse11 (not (= 1 |old(~m_pc~0)|)) .cse21 .cse9 .cse14 .cse15) (< .cse27 |old(~token~0)|) .cse13 .cse18 (< |old(~token~0)| .cse27)))))) [2018-11-22 23:41:35,076 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-11-22 23:41:35,076 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse17 (+ ~local~0 2))) (let ((.cse3 (< .cse17 ~token~0)) (.cse14 (< ~token~0 .cse17)) (.cse0 (< ~E_1~0 2)) (.cse2 (< ~t2_st~0 2)) (.cse7 (= 1 ~E_M~0)) (.cse9 (< ~t1_st~0 2)) (.cse12 (= 0 ~E_M~0)) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< ~E_2~0 2)) (.cse13 (= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse13 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (let ((.cse16 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse16) .cse10 .cse11 (< .cse16 ~token~0) .cse12)) (or .cse13 .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse15 .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (= 2 ~t2_st~0)) .cse1 .cse15 .cse4 .cse5 .cse6 (not (= 2 ~E_M~0)) .cse8 (not (= ~t1_st~0 2)) .cse10 (not (= 2 ~E_1~0)) .cse11 .cse13)))) [2018-11-22 23:41:35,076 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-11-22 23:41:35,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:41:35,076 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 |old(~m_st~0)|) (<= |old(~t2_st~0)| ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~M_E~0)| ~M_E~0) (<= |old(~t1_st~0)| ~t1_st~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-22 23:41:35,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:41:35,078 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-11-22 23:41:35,078 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-11-22 23:41:35,078 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-22 23:41:35,078 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-11-22 23:41:35,078 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-11-22 23:41:35,078 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-11-22 23:41:35,078 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-11-22 23:41:35,078 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse33 (+ |old(~local~0)| 2)) (.cse23 (<= 2 ~t2_st~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 0)) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~m_st~0 0))) (.cse22 (= 1 ~t2_pc~0)) (.cse18 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~E_1~0)) (.cse21 (not (= ~E_M~0 1)))) (let ((.cse5 (not (= 2 |old(~E_M~0)|))) (.cse8 (not (= 2 |old(~E_1~0)|))) (.cse27 (let ((.cse34 (+ ~local~0 2))) (and .cse23 .cse15 (and (not .cse0) (not .cse3) (= 1 ~m_pc~0) (not (= ~M_E~0 0)) .cse17 .cse19) .cse22 (<= 2 ~E_2~0) .cse18 (<= .cse34 ~token~0) .cse20 .cse21 (<= ~token~0 .cse34)))) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse30 (< .cse33 |old(~token~0)|)) (.cse31 (< |old(~token~0)| .cse33)) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse1 (not (= 2 |old(~m_st~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse4 (= 0 ~M_E~0)) (.cse12 (= 1 |old(~E_M~0)|)) (.cse6 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (< |old(~t1_st~0)| 2)) (.cse7 (not (= 1 |old(~m_pc~0)|))) (.cse9 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|))) (and (or (not (= 2 |old(~t2_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 (< |old(~local~0)| |old(~token~0)|) .cse1 .cse2 (< |old(~token~0)| |old(~local~0)|) .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse9 .cse14) (let ((.cse16 (= ~m_pc~0 0)) (.cse28 (= ~t1_st~0 0)) (.cse24 (= ~token~0 0)) (.cse25 (= ~local~0 0)) (.cse26 (<= |old(~E_2~0)| ~E_2~0))) (or (not (= 2 |old(~E_2~0)|)) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse27 (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse16 .cse19 (= ~E_1~0 2) (= ~E_M~0 2) (= ~t2_pc~0 0) .cse28 (= ~t2_st~0 0) .cse24 .cse25 (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= ~T2_E~0 2)) (and .cse15 .cse16 .cse17 .cse18 (<= ~t2_pc~0 0) .cse19 .cse20 .cse21 (= 0 ~t2_st~0) .cse24 .cse25 .cse26) .cse5 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse29 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse8 (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)) (and .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 (not .cse15) .cse23 .cse28 .cse24 .cse25 .cse26))) (or .cse10 .cse0 .cse11 .cse30 .cse2 .cse27 .cse3 .cse4 .cse12 .cse6 .cse13 .cse29 .cse7 .cse9 .cse14 .cse31) (or .cse10 .cse0 .cse11 .cse1 .cse30 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse9 .cse14 .cse31) (let ((.cse32 (+ |old(~local~0)| 1))) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 (< |old(~token~0)| .cse32) .cse7 .cse9 (< .cse32 |old(~token~0)|) .cse14))))) [2018-11-22 23:41:35,079 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-11-22 23:41:35,079 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-11-22 23:41:35,079 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-11-22 23:41:35,079 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse69 (+ ~local~0 2))) (let ((.cse11 (= 1 ~t1_pc~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse32 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse28 (<= 2 ~E_2~0)) (.cse16 (<= .cse69 ~token~0)) (.cse17 (<= 2 ~E_1~0)) (.cse19 (not (= ~E_M~0 1))) (.cse20 (<= ~token~0 .cse69)) (.cse52 (= ~m_st~0 0)) (.cse67 (+ ~local~0 1)) (.cse50 (= ~t1_st~0 0)) (.cse62 (= ~m_st~0 |old(~m_st~0)|)) (.cse64 (not .cse6)) (.cse65 (not (= ~M_E~0 0))) (.cse31 (= ~m_st~0 2)) (.cse49 (not (= ~E_M~0 0))) (.cse66 (not .cse1)) (.cse61 (= 1 ~m_pc~0)) (.cse68 (+ |old(~local~0)| 2))) (let ((.cse4 (< .cse68 |old(~token~0)|)) (.cse25 (< |old(~token~0)| .cse68)) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 1))) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= 1 |old(~t2_pc~0)|))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse13 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse14 (= ~token~0 |old(~token~0)|)) (.cse15 (and .cse62 .cse64 .cse65 .cse31 .cse49 .cse66 .cse61)) (.cse18 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (not (= 1 |old(~m_pc~0)|))) (.cse23 (< |old(~E_2~0)| 2)) (.cse24 (= 0 |old(~E_M~0)|)) (.cse39 (= ~t2_pc~0 1)) (.cse43 (= ~t2_st~0 2)) (.cse37 (and .cse64 .cse65 .cse31 .cse49 .cse66 .cse50 .cse61)) (.cse40 (= ~E_M~0 2)) (.cse44 (= ~E_1~0 2)) (.cse36 (<= ~token~0 ~local~0)) (.cse38 (<= ~local~0 ~token~0)) (.cse27 (<= ~token~0 .cse67)) (.cse29 (<= .cse67 ~token~0)) (.cse30 (and .cse66 .cse64 .cse61 .cse65 .cse49 (not (= ~E_1~0 0)) (not .cse52) (not (= ~E_2~0 0)))) (.cse33 (and .cse11 .cse12 .cse64 .cse52 .cse65 .cse49 .cse32 .cse26 .cse66 .cse28 .cse61 .cse16 .cse17 .cse19 .cse20)) (.cse41 (= ~t1_pc~0 1)) (.cse42 (= ~t1_st~0 2)) (.cse34 (= 0 ~t2_st~0)) (.cse21 (<= |old(~E_2~0)| ~E_2~0)) (.cse45 (not (= 2 |old(~E_M~0)|))) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse46 (not (= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse6 .cse7 .cse10 (and .cse26 .cse11 .cse27 .cse12 .cse28 .cse29 .cse30 .cse31 .cse32 .cse17 .cse19) .cse0 .cse2 .cse33 (and (and .cse11 .cse27 .cse12 .cse28 .cse29 .cse30 .cse31 .cse17 .cse19 .cse34) .cse32) .cse4 .cse5 (and .cse26 .cse11 .cse12 .cse28 .cse30 .cse31 .cse32 .cse16 .cse17 .cse19 .cse20) .cse8 .cse9 .cse35 .cse22 .cse23 .cse24 (and .cse26 .cse36 (and .cse11 .cse37 .cse12 .cse28 .cse17 .cse19) .cse38) (and .cse26 .cse11 .cse12 .cse28 .cse36 .cse30 .cse31 .cse32 .cse17 .cse38 .cse19) .cse25) (or (not (= 2 |old(~t2_st~0)|)) .cse1 (and .cse39 .cse40 .cse15 .cse41 .cse42 .cse43 .cse44 .cse21) .cse3 .cse5 .cse6 .cse7 .cse45 .cse9 (not (= |old(~t1_st~0)| 2)) .cse22 .cse46 .cse23) (or .cse0 .cse1 .cse2 (< |old(~local~0)| |old(~token~0)|) .cse3 .cse5 (< |old(~token~0)| |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23 .cse24 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse36 .cse17 .cse18 .cse38 .cse19 .cse21)) (let ((.cse47 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse47) (and .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21) .cse22 .cse23 (< .cse47 |old(~token~0)|) .cse24)) (let ((.cse53 (= ~m_pc~0 0)) (.cse56 (= ~token~0 0)) (.cse57 (= ~local~0 0)) (.cse60 (= ~m_pc~0 1))) (let ((.cse55 (= ~t2_st~0 0)) (.cse58 (= ~E_2~0 2)) (.cse59 (= ~t1_pc~0 0)) (.cse48 (<= ~t2_pc~0 0)) (.cse54 (= ~t2_pc~0 0)) (.cse51 (let ((.cse63 (= eval_~tmp~0 1))) (or (and .cse52 .cse53 .cse56 .cse57 .cse63) (and .cse60 .cse31 .cse63))))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (and .cse11 .cse27 .cse12 .cse28 .cse29 .cse31 .cse17 .cse30 .cse19 .cse34) .cse32) (and .cse39 .cse40 .cse41 .cse31 .cse42 .cse30 .cse43 .cse44 .cse21) (and .cse26 .cse11 .cse27 .cse12 .cse28 .cse29 .cse31 .cse32 .cse17 .cse30 .cse19) (and .cse26 .cse11 .cse12 .cse28 .cse31 .cse32 .cse16 .cse17 .cse30 .cse19 .cse20) (and .cse26 .cse11 .cse12 .cse28 .cse36 .cse31 .cse32 .cse17 .cse30 .cse38 .cse19) (not (= ~m_i~0 1)) (and .cse11 .cse31 .cse32 .cse48 .cse30 .cse34 .cse36 .cse17 .cse38 .cse19 .cse21) (not (= 2 ~M_E~0)) (and .cse26 .cse37 .cse12 .cse36 .cse17 .cse38 .cse19 .cse21) (and (and .cse37 .cse11 .cse48 .cse17 .cse19 .cse21) .cse36 .cse38 .cse34) (not (= 1 ~t1_i~0)) (and .cse12 (not .cse11) .cse49 .cse26 .cse50 .cse36 .cse51 .cse17 .cse38 .cse19 .cse21) (and .cse40 (and .cse44 .cse52 .cse53) .cse54 .cse50 .cse55 .cse56 .cse57 .cse58 .cse59) (and .cse11 .cse12 .cse49 .cse32 .cse26 .cse36 .cse51 .cse17 .cse38 .cse19 .cse21) (and .cse40 .cse41 (and .cse60 .cse55 .cse31) .cse42 .cse44 .cse54 .cse58) (and .cse40 .cse50 .cse55 (and .cse31 .cse44 .cse54 .cse61) .cse36 .cse58 .cse59 .cse38) (and .cse11 .cse27 .cse28 .cse29 .cse31 .cse32 .cse48 .cse17 .cse30 .cse34 .cse19) (not (= ~T2_E~0 2)) .cse33 (and .cse41 .cse49 .cse17 .cse19 .cse62 .cse42 .cse34 .cse54 .cse51 .cse21) .cse45 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse35 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) .cse46 (not (= 1 ~t2_i~0))))))))) [2018-11-22 23:41:35,082 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-22 23:41:35,082 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-11-22 23:41:35,082 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse69 (+ ~local~0 2))) (let ((.cse11 (= 1 ~t1_pc~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse32 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse28 (<= 2 ~E_2~0)) (.cse16 (<= .cse69 ~token~0)) (.cse17 (<= 2 ~E_1~0)) (.cse19 (not (= ~E_M~0 1))) (.cse20 (<= ~token~0 .cse69)) (.cse52 (= ~m_st~0 0)) (.cse67 (+ ~local~0 1)) (.cse50 (= ~t1_st~0 0)) (.cse62 (= ~m_st~0 |old(~m_st~0)|)) (.cse64 (not .cse6)) (.cse65 (not (= ~M_E~0 0))) (.cse31 (= ~m_st~0 2)) (.cse49 (not (= ~E_M~0 0))) (.cse66 (not .cse1)) (.cse61 (= 1 ~m_pc~0)) (.cse68 (+ |old(~local~0)| 2))) (let ((.cse4 (< .cse68 |old(~token~0)|)) (.cse25 (< |old(~token~0)| .cse68)) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 1))) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= 1 |old(~t2_pc~0)|))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse13 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse14 (= ~token~0 |old(~token~0)|)) (.cse15 (and .cse62 .cse64 .cse65 .cse31 .cse49 .cse66 .cse61)) (.cse18 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (not (= 1 |old(~m_pc~0)|))) (.cse23 (< |old(~E_2~0)| 2)) (.cse24 (= 0 |old(~E_M~0)|)) (.cse39 (= ~t2_pc~0 1)) (.cse43 (= ~t2_st~0 2)) (.cse37 (and .cse64 .cse65 .cse31 .cse49 .cse66 .cse50 .cse61)) (.cse40 (= ~E_M~0 2)) (.cse44 (= ~E_1~0 2)) (.cse36 (<= ~token~0 ~local~0)) (.cse38 (<= ~local~0 ~token~0)) (.cse27 (<= ~token~0 .cse67)) (.cse29 (<= .cse67 ~token~0)) (.cse30 (and .cse66 .cse64 .cse61 .cse65 .cse49 (not (= ~E_1~0 0)) (not .cse52) (not (= ~E_2~0 0)))) (.cse33 (and .cse11 .cse12 .cse64 .cse52 .cse65 .cse49 .cse32 .cse26 .cse66 .cse28 .cse61 .cse16 .cse17 .cse19 .cse20)) (.cse41 (= ~t1_pc~0 1)) (.cse42 (= ~t1_st~0 2)) (.cse34 (= 0 ~t2_st~0)) (.cse21 (<= |old(~E_2~0)| ~E_2~0)) (.cse45 (not (= 2 |old(~E_M~0)|))) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse46 (not (= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25) (or .cse1 .cse6 .cse7 .cse10 (and .cse26 .cse11 .cse27 .cse12 .cse28 .cse29 .cse30 .cse31 .cse32 .cse17 .cse19) .cse0 .cse2 .cse33 (and (and .cse11 .cse27 .cse12 .cse28 .cse29 .cse30 .cse31 .cse17 .cse19 .cse34) .cse32) .cse4 .cse5 (and .cse26 .cse11 .cse12 .cse28 .cse30 .cse31 .cse32 .cse16 .cse17 .cse19 .cse20) .cse8 .cse9 .cse35 .cse22 .cse23 .cse24 (and .cse26 .cse36 (and .cse11 .cse37 .cse12 .cse28 .cse17 .cse19) .cse38) (and .cse26 .cse11 .cse12 .cse28 .cse36 .cse30 .cse31 .cse32 .cse17 .cse38 .cse19) .cse25) (or (not (= 2 |old(~t2_st~0)|)) .cse1 (and .cse39 .cse40 .cse15 .cse41 .cse42 .cse43 .cse44 .cse21) .cse3 .cse5 .cse6 .cse7 .cse45 .cse9 (not (= |old(~t1_st~0)| 2)) .cse22 .cse46 .cse23) (or .cse0 .cse1 .cse2 (< |old(~local~0)| |old(~token~0)|) .cse3 .cse5 (< |old(~token~0)| |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23 .cse24 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse36 .cse17 .cse18 .cse38 .cse19 .cse21)) (let ((.cse47 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse47) (and .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17 .cse18 .cse19 .cse21) .cse22 .cse23 (< .cse47 |old(~token~0)|) .cse24)) (let ((.cse53 (= ~m_pc~0 0)) (.cse56 (= ~token~0 0)) (.cse57 (= ~local~0 0)) (.cse60 (= ~m_pc~0 1))) (let ((.cse55 (= ~t2_st~0 0)) (.cse58 (= ~E_2~0 2)) (.cse59 (= ~t1_pc~0 0)) (.cse48 (<= ~t2_pc~0 0)) (.cse54 (= ~t2_pc~0 0)) (.cse51 (let ((.cse63 (= eval_~tmp~0 1))) (or (and .cse52 .cse53 .cse56 .cse57 .cse63) (and .cse60 .cse31 .cse63))))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (and .cse11 .cse27 .cse12 .cse28 .cse29 .cse31 .cse17 .cse30 .cse19 .cse34) .cse32) (and .cse39 .cse40 .cse41 .cse31 .cse42 .cse30 .cse43 .cse44 .cse21) (and .cse26 .cse11 .cse27 .cse12 .cse28 .cse29 .cse31 .cse32 .cse17 .cse30 .cse19) (and .cse26 .cse11 .cse12 .cse28 .cse31 .cse32 .cse16 .cse17 .cse30 .cse19 .cse20) (and .cse26 .cse11 .cse12 .cse28 .cse36 .cse31 .cse32 .cse17 .cse30 .cse38 .cse19) (not (= ~m_i~0 1)) (and .cse11 .cse31 .cse32 .cse48 .cse30 .cse34 .cse36 .cse17 .cse38 .cse19 .cse21) (not (= 2 ~M_E~0)) (and .cse26 .cse37 .cse12 .cse36 .cse17 .cse38 .cse19 .cse21) (and (and .cse37 .cse11 .cse48 .cse17 .cse19 .cse21) .cse36 .cse38 .cse34) (not (= 1 ~t1_i~0)) (and .cse12 (not .cse11) .cse49 .cse26 .cse50 .cse36 .cse51 .cse17 .cse38 .cse19 .cse21) (and .cse40 (and .cse44 .cse52 .cse53) .cse54 .cse50 .cse55 .cse56 .cse57 .cse58 .cse59) (and .cse11 .cse12 .cse49 .cse32 .cse26 .cse36 .cse51 .cse17 .cse38 .cse19 .cse21) (and .cse40 .cse41 (and .cse60 .cse55 .cse31) .cse42 .cse44 .cse54 .cse58) (and .cse40 .cse50 .cse55 (and .cse31 .cse44 .cse54 .cse61) .cse36 .cse58 .cse59 .cse38) (and .cse11 .cse27 .cse28 .cse29 .cse31 .cse32 .cse48 .cse17 .cse30 .cse34 .cse19) (not (= ~T2_E~0 2)) .cse33 (and .cse41 .cse49 .cse17 .cse19 .cse62 .cse42 .cse34 .cse54 .cse51 .cse21) .cse45 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse35 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) .cse46 (not (= 1 ~t2_i~0))))))))) [2018-11-22 23:41:35,083 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse40 (+ |old(~local~0)| 2)) (.cse3 (= ~T2_E~0 0)) (.cse31 (= ~m_st~0 2)) (.cse28 (not (= ~E_M~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse36 (= 1 ~m_pc~0))) (let ((.cse17 (= 1 ~t2_pc~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse5 (not (= 2 |old(~E_M~0)|))) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (= 2 |old(~E_1~0)|))) (.cse22 (<= ~token~0 ~local~0)) (.cse16 (= 1 ~t1_pc~0)) (.cse18 (<= 2 ~E_2~0)) (.cse20 (and (not .cse3) (not (= ~M_E~0 0)) .cse31 .cse28 (not .cse0) .cse36 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse19 (<= 2 ~E_1~0)) (.cse21 (not (= ~E_M~0 1))) (.cse23 (<= ~local~0 ~token~0)) (.cse24 (< .cse40 |old(~token~0)|)) (.cse26 (< |old(~token~0)| .cse40)) (.cse10 (< |old(~E_1~0)| 2)) (.cse11 (< |old(~t2_st~0)| 2)) (.cse1 (not (= 2 |old(~m_st~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse4 (= 0 ~M_E~0)) (.cse12 (= 1 |old(~E_M~0)|)) (.cse6 (not (= 1 |old(~t2_pc~0)|))) (.cse13 (< |old(~t1_st~0)| 2)) (.cse7 (not (= 1 |old(~m_pc~0)|))) (.cse9 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|))) (and (or (not (= 2 |old(~t2_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 (< |old(~local~0)| |old(~token~0)|) .cse1 .cse2 (< |old(~token~0)| |old(~local~0)|) .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse9 .cse14) (or .cse10 .cse0 .cse11 (and .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23) .cse24 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse25 .cse7 .cse9 .cse14 .cse26) (let ((.cse27 (<= |old(~E_2~0)| ~E_2~0)) (.cse32 (= ~E_1~0 2)) (.cse30 (= ~E_M~0 2)) (.cse34 (= ~t2_pc~0 0)) (.cse35 (= ~t2_st~0 0)) (.cse37 (= ~E_2~0 2)) (.cse33 (= ~t1_pc~0 0)) (.cse29 (let ((.cse38 (= eval_~tmp~0 1))) (or (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse38) (and (= ~m_pc~0 1) .cse31 .cse38))))) (or (and .cse15 .cse17 .cse22 .cse20 .cse19 .cse23 .cse21 .cse27) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse17 (not .cse16) .cse28 .cse15 .cse22 .cse29 .cse19 .cse23 .cse21 .cse27) (and .cse30 .cse31 (and .cse32 .cse33) .cse34 .cse35 .cse36 .cse37) (not (= 1 ~t1_i~0)) (and .cse32 .cse30 .cse34 .cse35 .cse37 .cse33 .cse29) (not (= ~T2_E~0 2)) .cse5 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse25 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse8 (not (= 1 ~t2_i~0)) (and .cse22 (and .cse16 .cse18 .cse20 (<= ~t2_pc~0 0) .cse19 .cse21) .cse23 (= 0 ~t2_st~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)))) (or .cse10 .cse0 .cse11 .cse1 .cse24 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse9 .cse14 .cse26) (let ((.cse39 (+ |old(~local~0)| 1))) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 (< |old(~token~0)| .cse39) .cse7 .cse9 (< .cse39 |old(~token~0)|) .cse14))))) [2018-11-22 23:41:35,085 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse35 (+ |old(~local~0)| 2)) (.cse36 (+ ~local~0 2))) (let ((.cse3 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= 2 |old(~E_1~0)|))) (.cse0 (= ~E_1~0 2)) (.cse2 (= ~E_M~0 2)) (.cse4 (not (= 0 |old(~m_st~0)|))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse32 (<= ~token~0 .cse36)) (.cse33 (<= .cse36 ~token~0)) (.cse31 (< .cse35 |old(~token~0)|)) (.cse34 (< |old(~token~0)| .cse35)) (.cse11 (= 1 ~t1_pc~0)) (.cse13 (= |old(~E_1~0)| ~E_1~0)) (.cse14 (= |old(~E_M~0)| ~E_M~0)) (.cse15 (= 1 ~t2_pc~0)) (.cse16 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse17 (= ~token~0 |old(~token~0)|)) (.cse18 (= ~m_st~0 2)) (.cse19 (= |old(~E_2~0)| ~E_2~0)) (.cse20 (= 1 ~m_pc~0)) (.cse21 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (< |old(~E_1~0)| 2)) (.cse7 (= ~T1_E~0 0)) (.cse8 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 2 |old(~m_st~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 1))) (.cse22 (= ~T2_E~0 0)) (.cse23 (= 0 ~M_E~0)) (.cse24 (= 1 |old(~E_M~0)|)) (.cse25 (not (= 1 |old(~t2_pc~0)|))) (.cse26 (< |old(~t1_st~0)| 2)) (.cse28 (not (= 1 |old(~m_pc~0)|))) (.cse29 (< |old(~E_2~0)| 2)) (.cse30 (= 0 |old(~E_M~0)|))) (and (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (and (= ~m_pc~0 0) .cse0 .cse1 .cse2 (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) .cse3 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse4 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse5 (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (let ((.cse27 (+ |old(~local~0)| 1))) (or .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (+ ~local~0 1))) (and .cse11 (<= ~token~0 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= .cse12 ~token~0) .cse20 .cse21)) .cse22 .cse23 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse27) .cse28 .cse29 (< .cse27 |old(~token~0)|) .cse30)) (or (not (= 2 |old(~t2_st~0)|)) .cse7 .cse9 .cse10 .cse22 .cse23 .cse3 .cse25 (not (= |old(~t1_st~0)| 2)) .cse28 .cse5 .cse29 (and (= ~t1_pc~0 1) .cse0 .cse15 .cse2 .cse19 .cse18 (= ~t1_st~0 2) (= ~t2_st~0 2) .cse20)) (or .cse6 .cse7 .cse8 .cse31 .cse10 .cse22 .cse23 .cse24 .cse25 .cse26 .cse4 .cse28 .cse29 .cse30 (and .cse11 .cse13 .cse14 .cse32 .cse15 .cse1 .cse16 .cse17 .cse19 .cse20 .cse33 .cse21) .cse34) (or .cse6 .cse7 .cse8 (and .cse11 .cse13 .cse14 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21) .cse9 .cse31 .cse10 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse34) (or (and .cse11 .cse13 (<= ~token~0 ~local~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= ~local~0 ~token~0)) .cse6 .cse7 .cse8 (< |old(~local~0)| |old(~token~0)|) .cse9 .cse10 (< |old(~token~0)| |old(~local~0)|) .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30)))) [2018-11-22 23:41:35,088 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-11-22 23:41:35,088 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-11-22 23:41:35,088 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse44 (+ |old(~local~0)| 2)) (.cse28 (= ~T1_E~0 0)) (.cse31 (= ~T2_E~0 0)) (.cse17 (= 1 ~m_pc~0)) (.cse1 (not (= ~E_M~0 0))) (.cse26 (= ~m_st~0 0)) (.cse45 (+ ~local~0 1))) (let ((.cse23 (not (= 2 |old(~E_M~0)|))) (.cse25 (not (= 2 |old(~E_1~0)|))) (.cse24 (not (= 0 |old(~m_st~0)|))) (.cse0 (= 1 ~t1_pc~0)) (.cse10 (<= ~token~0 .cse45)) (.cse11 (= 1 ~t2_pc~0)) (.cse15 (and (not .cse28) (not .cse31) .cse17 (not (= ~M_E~0 0)) .cse1 (not (= ~E_1~0 0)) (not .cse26) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_2~0)) (.cse13 (<= .cse45 ~token~0)) (.cse14 (= ~m_st~0 2)) (.cse2 (<= 2 ~t1_st~0)) (.cse6 (<= 2 ~E_1~0)) (.cse8 (not (= ~E_M~0 1))) (.cse41 (< .cse44 |old(~token~0)|)) (.cse42 (< |old(~token~0)| .cse44)) (.cse36 (< |old(~E_1~0)| 2)) (.cse37 (< |old(~t2_st~0)| 2)) (.cse29 (not (= 2 |old(~m_st~0)|))) (.cse30 (not (= |old(~t1_pc~0)| 1))) (.cse32 (= 0 ~M_E~0)) (.cse38 (= 1 |old(~E_M~0)|)) (.cse33 (not (= 1 |old(~t2_pc~0)|))) (.cse39 (< |old(~t1_st~0)| 2)) (.cse34 (not (= 1 |old(~m_pc~0)|))) (.cse35 (< |old(~E_2~0)| 2)) (.cse40 (= 0 |old(~E_M~0)|))) (and (let ((.cse16 (= ~t1_st~0 0)) (.cse21 (= ~t1_pc~0 0)) (.cse5 (let ((.cse27 (= eval_~tmp~0 1))) (or (and .cse26 (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse27) (and (= ~m_pc~0 1) .cse14 .cse27)))) (.cse18 (= ~E_M~0 2)) (.cse19 (= ~E_1~0 2)) (.cse20 (= ~t2_pc~0 0)) (.cse22 (= ~E_2~0 2)) (.cse4 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse9 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= ~t2_pc~0 0))) (or (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse6 .cse15 .cse8) (not (= ~T1_E~0 2)) (and .cse4 .cse14 (and .cse0 (and .cse1 .cse16 .cse17) .cse3 .cse6 .cse8 .cse9) .cse7) (and .cse18 .cse4 .cse7 (and .cse14 .cse19 .cse20 .cse16 .cse17 .cse21) .cse9) (not (= 1 ~t1_i~0)) (and .cse19 (= ~m_st~0 |old(~m_st~0)|) .cse18 .cse20 .cse16 .cse22 .cse21 .cse5) (and .cse18 (= ~t1_pc~0 1) .cse14 (= ~t1_st~0 2) .cse15 .cse19 .cse20 .cse22) (not (= ~T2_E~0 2)) (and .cse0 .cse4 .cse14 .cse2 .cse3 .cse6 .cse15 .cse7 .cse8 .cse9) .cse23 (and .cse0 .cse10 .cse12 .cse13 .cse14 .cse2 .cse3 .cse6 .cse15 .cse8) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse24 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse25 (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)))) (or (not (= 2 |old(~t2_st~0)|)) .cse28 .cse29 .cse30 .cse31 .cse32 .cse23 .cse33 (not (= |old(~t1_st~0)| 2)) .cse34 .cse25 .cse35) (or .cse36 .cse28 .cse37 (< |old(~local~0)| |old(~token~0)|) .cse29 .cse30 (< |old(~token~0)| |old(~local~0)|) .cse31 .cse32 .cse38 .cse33 .cse39 .cse34 .cse35 .cse40) (or .cse36 .cse28 .cse37 .cse41 .cse30 .cse31 .cse32 .cse38 .cse33 .cse39 .cse24 .cse34 .cse35 .cse40 (and .cse0 .cse10 .cse11 .cse15 .cse12 .cse13 .cse14 .cse2 .cse6 .cse8) .cse42) (or .cse36 .cse28 .cse37 .cse29 .cse41 .cse30 .cse31 .cse32 .cse38 .cse33 .cse39 .cse34 .cse35 .cse40 .cse42) (let ((.cse43 (+ |old(~local~0)| 1))) (or .cse36 .cse28 .cse37 .cse29 .cse30 .cse31 .cse32 .cse38 .cse33 .cse39 (< |old(~token~0)| .cse43) .cse34 .cse35 (< .cse43 |old(~token~0)|) .cse40))))) [2018-11-22 23:41:35,089 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-22 23:41:35,089 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-11-22 23:41:35,090 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0)) (.cse48 (+ ~local~0 1)) (.cse49 (+ ~local~0 2))) (let ((.cse27 (<= ~token~0 ~local~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse41 (+ |old(~local~0)| 2)) (.cse34 (<= .cse49 ~token~0)) (.cse33 (<= ~token~0 .cse49)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (<= ~token~0 .cse48)) (.cse42 (not .cse5)) (.cse43 (not (= ~M_E~0 0))) (.cse16 (not (= ~E_M~0 0))) (.cse44 (<= 2 ~t1_st~0)) (.cse45 (<= 2 ~t2_st~0)) (.cse46 (not .cse1)) (.cse47 (<= 2 ~E_2~0)) (.cse23 (<= .cse48 ~token~0)) (.cse17 (<= 2 ~E_1~0)) (.cse18 (not (= ~E_M~0 1))) (.cse19 (= 1 ~t2_pc~0)) (.cse22 (= ~m_st~0 2)) (.cse24 (= 1 ~m_pc~0)) (.cse26 (<= |old(~E_2~0)| ~E_2~0))) (let ((.cse3 (not (= 2 |old(~m_st~0)|))) (.cse20 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse21 (= ~token~0 |old(~token~0)|)) (.cse25 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (not (= 2 |old(~E_M~0)|))) (.cse29 (and (= ~t1_pc~0 1) (= ~E_1~0 2) .cse19 (= ~E_M~0 2) .cse22 (= ~t1_st~0 2) (= ~t2_st~0 2) .cse24 .cse26)) (.cse31 (not (= 2 |old(~E_1~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse38 (and .cse14 .cse15 .cse19 .cse42 .cse43 .cse22 .cse16 .cse44 .cse45 .cse46 .cse47 .cse23 .cse24 .cse17 .cse18)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse39 (and .cse14 .cse19 .cse42 (= ~m_st~0 0) .cse43 .cse16 .cse44 .cse45 .cse46 .cse47 .cse24 .cse34 .cse17 .cse18 .cse33)) (.cse32 (< .cse41 |old(~token~0)|)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse36 (and .cse14 .cse19 .cse22 .cse16 .cse44 .cse45 .cse46 .cse47 .cse24 .cse34 .cse17 .cse18 .cse33)) (.cse6 (= 0 ~M_E~0)) (.cse37 (and .cse14 .cse19 .cse42 .cse43 .cse22 .cse16 .cse44 .cse45 .cse46 .cse47 .cse24 .cse27 .cse17 .cse28 .cse18)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= 1 |old(~m_pc~0)|))) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse35 (< |old(~token~0)| .cse41))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 (< .cse10 |old(~token~0)|) .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) (or .cse0 .cse1 .cse2 (and .cse14 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse28 .cse26) (< |old(~local~0)| |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| |old(~local~0)|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (or (not (= 2 |old(~t2_st~0)|)) .cse1 .cse3 .cse4 .cse29 .cse5 .cse6 .cse30 .cse8 (not (= |old(~t1_st~0)| 2)) .cse11 .cse31 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (and .cse14 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse21 .cse22 .cse24 .cse34 .cse25 .cse26) .cse12 .cse13 .cse35) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse36 .cse37 (not (= 1 ~t1_i~0)) .cse38 (not (= ~T2_E~0 2)) .cse39 .cse30 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse40 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) .cse29 .cse31 (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (or .cse0 .cse38 .cse1 .cse2 .cse39 .cse32 .cse4 .cse36 .cse5 .cse6 .cse37 .cse7 .cse8 .cse9 .cse40 .cse11 .cse12 .cse13 .cse35))))) [2018-11-22 23:41:35,093 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-11-22 23:41:35,093 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-11-22 23:41:35,094 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse33 (+ ~local~0 2)) (.cse21 (= 1 ~E_M~0)) (.cse16 (= 0 ~m_st~0)) (.cse34 (+ ~local~0 1))) (let ((.cse23 (< ~token~0 .cse34)) (.cse24 (< .cse34 ~token~0)) (.cse28 (< 0 ~t2_pc~0)) (.cse11 (< ~local~0 ~token~0)) (.cse26 (= 0 ~E_1~0)) (.cse12 (< ~token~0 ~local~0)) (.cse20 (< ~t2_st~0 2)) (.cse25 (= 0 ~E_M~0)) (.cse5 (not (= 2 ~E_M~0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse31 (not .cse16)) (.cse18 (not (= 0 ~m_pc~0))) (.cse13 (not (= ~t1_st~0 0))) (.cse15 (not (= 0 ~t2_st~0))) (.cse8 (not (= 2 ~E_1~0))) (.cse17 (not (= 0 ~t2_pc~0))) (.cse19 (< ~E_1~0 2)) (.cse32 (not .cse21)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (= 2 ~m_st~0))) (.cse29 (< .cse33 ~token~0)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse6 (not (= 1 ~t2_pc~0))) (.cse22 (< ~t1_st~0 2)) (.cse10 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse7 (not .cse27)) (.cse9 (< ~E_2~0 2)) (.cse30 (< ~token~0 .cse33))) (and (or (not (= 2 ~t2_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 2)) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse3 .cse4 .cse5 .cse10 .cse13 .cse14 (not (= 1 ~E_1~0)) .cse15 .cse9 .cse16 .cse17 .cse18) (or .cse19 .cse10 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse22 .cse23 .cse7 .cse9 .cse24 .cse25) (or .cse21 .cse6 .cse20 .cse11 (or .cse0 .cse7 .cse26 .cse25 .cse3 .cse4 .cse13) .cse2 .cse12 .cse9 .cse10) (or .cse0 .cse20 .cse11 .cse12 .cse10 .cse3 .cse4 .cse13 .cse21 .cse6 .cse26 .cse9 .cse25 .cse16 .cse27) (or .cse0 .cse28 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse21 .cse15 .cse26 .cse10 .cse9 .cse25 .cse16 .cse27) (or (or .cse19 .cse0 .cse28 .cse2 .cse3 .cse4 .cse21 .cse25 (= 0 ~E_2~0)) .cse10 .cse23 .cse15 .cse7 .cse1 .cse24) (or .cse0 .cse10 .cse28 .cse11 .cse2 .cse12 .cse3 .cse4 .cse21 .cse22 .cse15 .cse26 .cse9 .cse25 .cse16 .cse27) (or .cse21 .cse6 .cse22 .cse20 .cse10 .cse11 (and (or .cse0 .cse26 .cse25 .cse16 .cse3 .cse4) (or .cse0 .cse7 .cse26 .cse25 .cse3 .cse4)) .cse2 .cse12 .cse9) (or .cse19 .cse0 .cse20 .cse1 .cse29 .cse2 .cse3 .cse4 .cse6 .cse22 .cse10 .cse7 .cse9 .cse25 .cse30) (or .cse19 .cse0 .cse20 .cse10 .cse29 .cse2 .cse3 .cse4 .cse6 .cse22 .cse31 .cse7 .cse9 .cse25 .cse30) (or .cse19 .cse32 .cse0 .cse10 .cse29 .cse2 .cse3 .cse4 .cse6 .cse22 .cse31 .cse7 .cse9 .cse30) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse10 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) .cse5 (or (not (= ~token~0 0)) .cse14 .cse31 (not (= 0 ~local~0)) .cse18 .cse13) (not (= ~m_i~0 1)) .cse15 .cse8 (not (= 1 ~t2_i~0)) .cse17 (not (= 2 ~M_E~0))) (or .cse19 .cse32 .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse6 .cse22 .cse10 .cse7 .cse9 .cse30)))) [2018-11-22 23:41:35,098 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-11-22 23:41:35,098 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-11-22 23:41:35,098 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-11-22 23:41:35,098 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-11-22 23:41:35,098 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse26 (+ ~local~0 2)) (.cse24 (= |old(~T2_E~0)| ~T2_E~0)) (.cse25 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse10 (not (= 0 ~m_st~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< ~t2_st~0 2)) (.cse14 (and (= |old(~E_1~0)| ~E_1~0) .cse24 (= |old(~E_M~0)| ~E_M~0) .cse25 .cse19 .cse20)) (.cse3 (< .cse26 ~token~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse15 (< ~token~0 .cse26)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse16 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse21 (not (= 2 |old(~E_M~0)|))) (.cse8 (not (= 1 ~t2_pc~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse22 (not (= 2 |old(~E_1~0)|))) (.cse12 (< |old(~E_2~0)| 2)) (.cse17 (= ~E_1~0 2)) (.cse18 (= ~E_M~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse14 .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse16 .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and .cse17 .cse18 (= ~T2_E~0 2) .cse19 (= ~E_2~0 2) .cse20) .cse21 (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse10 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) .cse22 (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse16 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse23) .cse11 .cse12 (< .cse23 ~token~0) .cse13)) (or .cse0 .cse1 .cse2 .cse14 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or (not (= 2 ~t2_st~0)) .cse1 .cse16 .cse4 .cse5 .cse6 .cse21 .cse8 (not (= ~t1_st~0 2)) .cse11 .cse22 .cse12 (and .cse24 .cse17 .cse18 .cse25 .cse19 .cse20))))) [2018-11-22 23:41:35,103 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-11-22 23:41:35,103 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-11-22 23:41:35,104 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse16 (+ ~local~0 2))) (let ((.cse5 (<= .cse16 ~token~0)) (.cse6 (<= ~token~0 .cse16)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~E_M~0 2)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) .cse14 (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) .cse15 (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (and .cse14 (= ~t2_st~0 2) .cse15 .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,105 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,105 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-11-22 23:41:35,105 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,105 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse6 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse8 (= 1 ~m_pc~0)) (.cse10 (<= 2 ~E_1~0)) (.cse9 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse11 (not (= ~E_M~0 1))) (.cse13 (+ ~local~0 2))) (let ((.cse4 (<= .cse13 ~token~0)) (.cse5 (<= ~token~0 .cse13)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (and .cse6 .cse7 (<= 2 ~E_2~0) .cse8 .cse10 .cse9 .cse11)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (and .cse0 (and .cse6 .cse7 (and (= ~m_st~0 0) .cse8 .cse9) .cse10 .cse11 (<= |old(~E_2~0)| ~E_2~0)) .cse3 .cse4 .cse5) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) .cse1 (= ~E_M~0 2) .cse2 (= ~t1_st~0 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) (<= .cse12 ~token~0) .cse2 .cse3)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,107 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-11-22 23:41:35,107 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,107 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-22 23:41:35,108 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,108 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (not (= ~M_E~0 0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,108 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,108 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-22 23:41:35,108 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-22 23:41:35,109 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-11-22 23:41:35,109 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,110 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,110 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-22 23:41:35,110 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,111 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse6 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~t2_pc~0)) (.cse8 (= 1 ~m_pc~0)) (.cse10 (<= 2 ~E_1~0)) (.cse9 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse11 (not (= ~E_M~0 1))) (.cse13 (+ ~local~0 2))) (let ((.cse4 (<= .cse13 ~token~0)) (.cse5 (<= ~token~0 .cse13)) (.cse0 (<= 2 ~t2_st~0)) (.cse1 (and .cse6 .cse7 (<= 2 ~E_2~0) .cse8 .cse10 .cse9 .cse11)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0)) (not (= 1 ~t1_i~0)) (and .cse0 (and .cse6 .cse7 (and (= ~m_st~0 0) .cse8 .cse9) .cse10 .cse11 (<= |old(~E_2~0)| ~E_2~0)) .cse3 .cse4 .cse5) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) .cse1 (= ~E_M~0 2) .cse2 (= ~t1_st~0 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (let ((.cse12 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse12) (<= .cse12 ~token~0) .cse2 .cse3)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,113 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,113 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,117 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,117 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 2))) (let ((.cse5 (<= .cse14 ~token~0)) (.cse6 (<= ~token~0 .cse14)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (and (= ~E_1~0 2) (= ~t2_st~0 2) (= ~E_M~0 2) .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,119 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-11-22 23:41:35,120 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (<= 2 ~E_1~0)) (.cse9 (= ~m_st~0 0)) (.cse13 (not (= ~E_M~0 1))) (.cse16 (+ ~local~0 2))) (let ((.cse5 (<= .cse16 ~token~0)) (.cse6 (<= ~token~0 .cse16)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~E_M~0 2)) (.cse0 (<= 2 ~t2_st~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (and .cse7 .cse8 (<= 2 ~E_2~0) .cse10 .cse11 .cse12 (not .cse9) .cse13))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4)) (not (= 2 |old(~E_2~0)|)) (and .cse0 .cse2 .cse3 .cse5 .cse4 .cse6) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse3 .cse5 (and .cse7 .cse8 (and .cse9 .cse10 .cse11) .cse12 .cse13 (<= |old(~E_2~0)| ~E_2~0)) .cse6) (not (= 1 ~t1_i~0)) (and (= ~m_pc~0 0) .cse14 (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) .cse15 (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= |old(~T2_E~0)| 2)) (and .cse14 (= ~t2_st~0 2) .cse15 .cse2 (= ~t1_st~0 2) .cse4) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and .cse0 (<= ~token~0 ~local~0) .cse2 .cse3 (<= ~local~0 ~token~0) .cse4) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-11-22 23:41:35,120 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-22 23:41:35,120 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-11-22 23:41:35,120 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-11-22 23:41:35,120 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-11-22 23:41:35,120 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-11-22 23:41:35,120 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-11-22 23:41:35,121 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse15 (= 1 ~m_pc~0)) (.cse4 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 2)) (.cse36 (+ ~local~0 1)) (.cse14 (= 0 ~m_st~0))) (let ((.cse26 (< 0 ~t2_pc~0)) (.cse28 (= is_master_triggered_~__retres1~0 0)) (.cse18 (not (= 2 ~E_M~0))) (.cse29 (not (= ~t1_pc~0 0))) (.cse24 (not .cse14)) (.cse31 (not (= 0 ~m_pc~0))) (.cse7 (not (= ~t1_st~0 0))) (.cse27 (not (= 0 ~t2_st~0))) (.cse20 (not (= 2 ~E_1~0))) (.cse30 (not (= 0 ~t2_pc~0))) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse11 (= 0 ~E_1~0)) (.cse32 (< ~token~0 .cse36)) (.cse33 (< .cse36 ~token~0)) (.cse34 (= 0 ~E_2~0)) (.cse21 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~t2_st~0 2)) (.cse16 (not (= 2 ~m_st~0))) (.cse22 (< .cse35 ~token~0)) (.cse17 (not .cse4)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse23 (< ~t1_st~0 2)) (.cse19 (not .cse15)) (.cse10 (= 0 is_master_triggered_~__retres1~0)) (.cse12 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0)) (.cse25 (< ~token~0 .cse35))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (not (= 2 ~t2_st~0)) .cse0 .cse10 .cse16 .cse17 .cse5 .cse6 .cse18 .cse9 (not (= ~t1_st~0 2)) .cse19 .cse20 .cse12) (or .cse21 .cse0 .cse1 .cse22 .cse17 .cse5 .cse6 .cse8 .cse9 .cse23 .cse24 .cse10 .cse19 .cse12 .cse13 .cse25) (or .cse0 .cse26 .cse2 .cse17 .cse3 .cse5 .cse6 .cse8 .cse23 .cse27 .cse11 .cse12 .cse13 .cse14 .cse10 .cse15) (or .cse0 .cse28 .cse2 .cse3 .cse5 .cse6 .cse18 .cse7 .cse29 (not (= 1 ~E_1~0)) .cse27 .cse12 .cse14 .cse30 .cse31) (or .cse21 .cse0 .cse26 .cse16 .cse17 .cse5 .cse6 .cse10 .cse8 .cse32 .cse27 .cse19 .cse33 .cse13 .cse34) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse28 (not (= ~T2_E~0 2)) .cse18 (or (not (= ~token~0 0)) .cse29 .cse24 (not (= 0 ~local~0)) .cse31 .cse7) (not (= ~m_i~0 1)) .cse27 .cse20 (not (= 1 ~t2_i~0)) .cse30 (not (= 2 ~M_E~0))) (or .cse10 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14) (or .cse21 .cse10 .cse0 .cse1 .cse16 .cse17 .cse5 .cse6 .cse8 .cse9 .cse32 .cse19 .cse33 .cse13 .cse34) (or .cse21 .cse0 .cse1 .cse16 .cse22 .cse17 .cse5 .cse6 .cse8 .cse9 .cse23 .cse19 .cse10 .cse12 .cse13 .cse25)))) [2018-11-22 23:41:35,122 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~T1_E~0 2) (= ~E_M~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~M_E~0 2) (= ~E_1~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) [2018-11-22 23:41:35,122 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-11-22 23:41:35,122 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse21 (+ ~local~0 2)) (.cse17 (= |old(~T2_E~0)| ~T2_E~0)) (.cse18 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< ~t2_st~0 2)) (.cse13 (and (= |old(~E_1~0)| ~E_1~0) .cse17 (= |old(~E_M~0)| ~E_M~0) .cse18 .cse19 .cse20)) (.cse3 (< .cse21 ~token~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse14 (< ~token~0 .cse21)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse15 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse13 .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse15 .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse16 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse16) .cse10 .cse11 (< .cse16 ~token~0) .cse12)) (or .cse0 .cse1 .cse2 .cse13 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (or (not (= 2 ~t2_st~0)) .cse1 .cse15 .cse4 .cse5 .cse6 (not (= 2 |old(~E_M~0)|)) .cse8 (not (= ~t1_st~0 2)) .cse10 (not (= 2 |old(~E_1~0)|)) .cse11 (and .cse17 (= ~E_1~0 2) (= ~E_M~0 2) .cse18 .cse19 .cse20))))) [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-11-22 23:41:35,124 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-11-22 23:41:35,125 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: true [2018-11-22 23:41:35,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:41:35 BoogieIcfgContainer [2018-11-22 23:41:35,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:41:35,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:41:35,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:41:35,207 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:41:35,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:47" (3/4) ... [2018-11-22 23:41:35,211 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-22 23:41:35,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-22 23:41:35,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-22 23:41:35,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-22 23:41:35,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-22 23:41:35,224 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-22 23:41:35,225 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-22 23:41:35,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((2 <= t2_st && token <= local + 1) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1)) || !(2 == \old(E_2))) || (((((2 <= t2_st && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1)) && token <= local + 2)) || !(\old(T1_E) == 2)) || ((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && ((((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local + 2)) || !(1 == t1_i)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(\old(T2_E) == 2)) || (((((E_1 == 2 && t2_st == 2) && E_M == 2) && m_st == 2) && t1_st == 2) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1))) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || (((((2 <= t2_st && token <= local) && m_st == 2) && 2 <= t1_st) && local <= token) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-11-22 23:41:35,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(M_E == 0) || !(2 == \old(E_2))) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-11-22 23:41:35,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || ((((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && token <= local + 2) && \old(E_2) <= E_2)) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || ((((((((((2 <= t2_st && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || \old(E_1) < 2) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && 0 == t2_st) && 2 <= t1_st)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((2 <= t2_st && token <= local) && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && token <= local) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && local <= token) && !(E_M == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((!(2 == \old(t2_st)) || T1_E == 0) || (((((((t2_pc == 1 && E_M == 2) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && t1_pc == 1) && t1_st == 2) && t2_st == 2) && E_1 == 2) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || !(1 == \old(m_pc))) || !(2 == \old(E_1))) || \old(E_2) < 2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && token <= local) && 2 <= E_1) && \old(t1_st) <= t1_st) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && local + 1 <= token) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t2_st) && 2 <= t1_st)) || ((((((((t2_pc == 1 && E_M == 2) && t1_pc == 1) && m_st == 2) && t1_st == 2) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && t2_st == 2) && E_1 == 2) && \old(E_2) <= E_2)) || ((((((((((2 <= t2_st && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && token <= local) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && local <= token) && !(E_M == 1))) || !(m_i == 1)) || ((((((((((1 == t1_pc && m_st == 2) && 2 <= t1_st) && t2_pc <= 0) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && 0 == t2_st) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == M_E)) || (((((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local) && local <= token) && 0 == t2_st)) || !(1 == t1_i)) || ((((((((((1 == t2_pc && !(1 == t1_pc)) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && token <= local) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((E_M == 2 && (E_1 == 2 && m_st == 0) && m_pc == 0) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && token <= local) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((E_M == 2 && t1_pc == 1) && (m_pc == 1 && t2_st == 0) && m_st == 2) && t1_st == 2) && E_1 == 2) && t2_pc == 0) && E_2 == 2)) || (((((((E_M == 2 && t1_st == 0) && t2_st == 0) && ((m_st == 2 && E_1 == 2) && t2_pc == 0) && 1 == m_pc) && token <= local) && E_2 == 2) && t1_pc == 0) && local <= token)) || ((((((((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && 0 == t2_st) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || (((((((((t1_pc == 1 && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && m_st == \old(m_st)) && t1_st == 2) && 0 == t2_st) && t2_pc == 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)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(2 == \old(E_1))) || !(1 == t2_i)) [2018-11-22 23:41:35,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((((((((1 == t1_pc && token <= local + 1) && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && local + 1 <= token) && 1 == m_pc) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((1 == t1_pc && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(local) < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((!(2 == \old(t2_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || ((((((((t1_pc == 1 && E_1 == 2) && 1 == t2_pc) && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2) && 1 == m_pc) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || !(1 == \old(m_pc))) || !(2 == \old(E_1))) || \old(E_2) < 2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || ((((((((((((1 == t1_pc && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((((t1_pc == 1 && E_1 == 2) && 1 == t2_pc) && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2) && 1 == m_pc) && \old(E_2) <= E_2)) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((((((((((((\old(E_1) < 2 || ((((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || T2_E == 0) || 0 == M_E) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) [2018-11-22 23:41:35,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || ((((((\old(E_1) == E_1 && m_pc == 0) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && token == 0) && local == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || ((token == \old(token) && \old(t2_st) <= t2_st && ((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || ((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && m_pc == 0) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && token == \old(token)) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || E_2 < 2) || \old(token) < \old(local) + 2) [2018-11-22 23:41:35,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || ((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || \old(token) < \old(local) + 2) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || ((((((token <= local && 2 <= E_1) && m_st == 2) && 0 == t2_st) && t1_st == 0) && 1 == m_pc) && local <= token)) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || ((((((token <= local && 2 <= E_1) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token)) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((E_1 == 2 && token <= local) && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && local <= token)) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E)) [2018-11-22 23:41:35,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(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) || 0 < t2_pc) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && token == \old(token)) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || E_2 < 2) || \old(token) < \old(local) + 2) [2018-11-22 23:41:35,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(2 == \old(E_2)) || !(2 == E_M)) || (((t2_st == 0 && E_2 == 2) && t1_pc == 0) && m_st == 2)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || (((((!(1 == t1_pc) && \old(t2_st) <= t2_st) && m_st == 0) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || (((((token <= \old(token) + 1 && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 0 == t2_st)) || 0 == E_M)) && ((((((((((((((((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st) || !(2 == \old(E_2))) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || (((((\old(t2_st) <= t2_st && token <= local) && \old(t1_st) <= t1_st) && local <= token) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((token <= \old(token) + 1 && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && 0 == t2_st)) || T2_E == 0) || 0 == M_E) || (((((token <= \old(token) + 1 && \old(t2_st) <= t2_st) && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) [2018-11-22 23:41:35,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2) && local + 1 <= token)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || (((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((!(2 == \old(E_2)) || !(2 == E_M)) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && E_2 == 2)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || 0 == E_M) [2018-11-22 23:41:35,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || (((((1 == t1_pc && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) && ((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((!(2 == \old(E_2)) || !(2 == E_M)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) [2018-11-22 23:41:35,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || \old(token) < local + 1) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((E_1 < 2 || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && \old(t2_st) <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == 2) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || (((((\old(t2_st) <= t2_st && E_M == 2) && token == \old(token)) && m_st == 2) && t2_pc == 0) && t1_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || (((((\old(t2_st) <= t2_st && E_M == 2) && t2_pc == 0) && t1_st == 0 && m_st == 0) && token <= local) && local <= token)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(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)) || (((((\old(t2_st) <= t2_st && token <= local) && !(E_M == 0) && t1_st == 0) && m_st == 2) && local <= token) && !(E_M == 1))) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || ((((\old(t2_st) <= t2_st && E_M == 2) && m_st == 2) && t1_st == 2) && t2_pc == 0)) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || ((((((\old(t2_st) <= t2_st && m_st == 0) && t2_pc <= 0) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || 0 == \old(E_M)) || !(0 == m_pc)) [2018-11-22 23:41:35,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((((!(E_M == 0) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((T1_E == 0 || ((((1 == t2_pc && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == m_pc)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(0 == local)) || !(t1_pc == 1)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E)) [2018-11-22 23:41:35,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(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)) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc))) [2018-11-22 23:41:35,286 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fcedcc7f-60b3-4ba5-94fe-6da5ec0a07e4/bin-2019/utaipan/witness.graphml [2018-11-22 23:41:35,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:41:35,287 INFO L168 Benchmark]: Toolchain (without parser) took 108066.05 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 963.0 MB in the beginning and 1.9 GB in the end (delta: -940.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,288 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:41:35,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.43 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,288 INFO L168 Benchmark]: Boogie Preprocessor took 27.03 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-22 23:41:35,288 INFO L168 Benchmark]: RCFGBuilder took 373.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,289 INFO L168 Benchmark]: TraceAbstraction took 107281.81 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -853.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,289 INFO L168 Benchmark]: Witness Printer took 79.67 ms. Allocated memory is still 3.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:41:35,290 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.43 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 946.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.03 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 373.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107281.81 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -853.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.67 ms. Allocated memory is still 3.3 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || \old(token) < local + 1) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((E_1 < 2 || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && \old(t2_st) <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == 2) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || (((((\old(t2_st) <= t2_st && E_M == 2) && token == \old(token)) && m_st == 2) && t2_pc == 0) && t1_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || (((((\old(t2_st) <= t2_st && E_M == 2) && t2_pc == 0) && t1_st == 0 && m_st == 0) && token <= local) && local <= token)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(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)) || (((((\old(t2_st) <= t2_st && token <= local) && !(E_M == 0) && t1_st == 0) && m_st == 2) && local <= token) && !(E_M == 1))) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || ((((\old(t2_st) <= t2_st && E_M == 2) && m_st == 2) && t1_st == 2) && t2_pc == 0)) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || ((((((\old(t2_st) <= t2_st && m_st == 0) && t2_pc <= 0) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || 0 == \old(E_M)) || !(0 == m_pc)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 == t2_st) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(1 == t2_pc)) || !(t1_st == 2)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || 0 == __retres1) && ((((((((((((((T1_E == 0 || local < token) || token < local) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || 0 == __retres1) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && (((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M)) && ((((((((1 == E_M || !(1 == t2_pc)) || t2_st < 2) || local < token) || (((((T1_E == 0 || !(1 == m_pc)) || 0 == E_1) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1)) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == t2_st)) || 0 == E_1) || 0 == __retres1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || token < local + 1) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || local + 1 < token)) && (((((((((((((((T1_E == 0 || 0 == __retres1) || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((1 == E_M || !(1 == t2_pc)) || t1_st < 2) || t2_st < 2) || 0 == __retres1) || local < token) || ((((((T1_E == 0 || 0 == E_1) || 0 == E_M) || 0 == m_st) || T2_E == 0) || 0 == M_E) && (((((T1_E == 0 || !(1 == m_pc)) || 0 == E_1) || 0 == E_M) || T2_E == 0) || 0 == M_E))) || !(t1_pc == 1)) || token < local) || E_2 < 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || 0 == __retres1) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || token < local + 2) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && \old(t2_st) <= t2_st) && m_st == 2) && local + 1 <= token)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || (((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((!(2 == \old(E_2)) || !(2 == E_M)) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && E_2 == 2)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || ((((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && 0 == t2_st) && local + 1 <= token)) || 0 == E_M) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || (((((1 == t1_pc && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && 0 == t2_st) && \old(t1_st) <= t1_st)) && ((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((!(2 == \old(E_2)) || !(2 == E_M)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(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) || 0 < t2_pc) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && token == \old(token)) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || E_2 < 2) || \old(token) < \old(local) + 2) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((!(2 == \old(E_2)) || !(2 == E_M)) || (((t2_st == 0 && E_2 == 2) && t1_pc == 0) && m_st == 2)) || ((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_pc) == 0)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == t2_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || (((((!(1 == t1_pc) && \old(t2_st) <= t2_st) && m_st == 0) && token == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == \old(t2_st))) || !(1 == m_pc)) || \old(E_2) < 2) || (((((token <= \old(token) + 1 && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 0 == t2_st)) || 0 == E_M)) && ((((((((((((((((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st) || !(2 == \old(E_2))) || !(T1_E == 2)) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(T2_E == 2)) || ((!(\old(token) == 0) || !(0 == \old(m_st))) || !(0 == local)) || !(0 == m_pc)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || (((((\old(t2_st) <= t2_st && token <= local) && \old(t1_st) <= t1_st) && local <= token) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((token <= \old(token) + 1 && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1) && 0 == t2_st)) || T2_E == 0) || 0 == M_E) || (((((token <= \old(token) + 1 && \old(t2_st) <= t2_st) && 2 <= E_2) && local + 1 <= token) && \old(t1_st) <= t1_st) && 1 == t2_pc && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && m_st == \old(m_st)) && m_st == 2) && 2 <= E_1)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((!(M_E == 0) || !(2 == \old(E_2))) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc) && ((((((((((((!(2 == t2_st) || T1_E == 0) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(1 == t2_pc)) || !(t1_st == 2)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((T1_E == 0 || __retres1 == 0) || local < token) || token < local) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || token < local + 1) || !(0 == t2_st)) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || __retres1 == 0) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || 0 == __retres1) || E_2 < 2) || 0 == E_M) || token < local + 2) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || ((((((\old(E_1) == E_1 && m_pc == 0) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && token == 0) && local == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || ((token == \old(token) && \old(t2_st) <= t2_st && ((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || ((((((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && m_pc == 0) && 0 == t2_st) && token == 0) && local == 0) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || (((((((\old(E_1) == E_1 && token <= local + 2) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && token == \old(token)) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || E_2 < 2) || \old(token) < \old(local) + 2) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((((((((1 == t1_pc && token <= local + 1) && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && local + 1 <= token) && 1 == m_pc) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((1 == t1_pc && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token) && \old(E_2) <= E_2)) || \old(local) < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((!(2 == \old(t2_st)) || T1_E == 0) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || ((((((((t1_pc == 1 && E_1 == 2) && 1 == t2_pc) && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2) && 1 == m_pc) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || !(1 == \old(m_pc))) || !(2 == \old(E_1))) || \old(E_2) < 2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || ((((((((((((1 == t1_pc && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && 1 == m_pc) && local + 2 <= token) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((((t1_pc == 1 && E_1 == 2) && 1 == t2_pc) && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2) && 1 == m_pc) && \old(E_2) <= E_2)) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((((((((((((\old(E_1) < 2 || ((((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || T2_E == 0) || 0 == M_E) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || \old(t1_st) < 2) || ((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || ((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || \old(token) < \old(local) + 2) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < t2_pc) || ((((((token <= local && 2 <= E_1) && m_st == 2) && 0 == t2_st) && t1_st == 0) && 1 == m_pc) && local <= token)) || !(0 == \old(local))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(t2_st))) || E_2 < 2) || 0 == E_M) || ((((((token <= local && 2 <= E_1) && m_st == 2) && 0 == t2_st) && 1 == m_pc) && \old(t1_st) <= t1_st) && local <= token)) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((((((((((((!(2 == E_2) || \old(local) < \old(token)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || \old(token) < \old(local)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((E_1 == 2 && token <= local) && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && local <= token)) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || 0 == __retres1) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) && ((((((((((((((T1_E == 0 || local < token) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2) || 0 == __retres1)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || 0 == __retres1) || token < local + 2)) && ((((((((((((!(2 == t2_st) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(1 == t2_pc)) || !(t1_st == 2)) || 0 == __retres1) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || 0 == __retres1) || !(2 == m_st)) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || token < local + 2)) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || token < local + 1) || !(0 == t2_st)) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || 0 == E_1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || __retres1 == 1) || token < local + 1) || !(0 == t2_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local < token) || !(2 == m_st)) || token < local) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || __retres1 == 1)) && (((((((((((((((E_1 < 2 || __retres1 == 1) || T1_E == 0) || t2_st < 2) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || t1_st < 2) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || __retres1 == 1) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(0 == t2_st)) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M)) && ((((((((((T1_E == 0 || !(2 == E_2)) || local < token) || T2_E == 0) || 0 == M_E) || token < local) || __retres1 == 1) || !(2 == E_M)) || (((!(t1_pc == 0) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(t1_st == 0)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((__retres1 == 1 || T1_E == 0) || !(2 == E_2)) || ((((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) && (!(1 == m_pc) || !(2 == m_st)))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == E_M)) || !(t1_st == 2)) || !(0 == t2_st)) || !(2 == E_1)) || !(0 == t2_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == t2_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || __retres1 == 1) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || __retres1 == 1) || !(0 == local)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(0 == t2_st)) || !(1 == m_pc)) || E_2 < 2) || __retres1 == 1) || 0 == E_M)) && ((((((((((((E_1 < 2 || !(t1_st == 2) || !(0 == t2_pc)) || T1_E == 0) || __retres1 == 1) || ((((!(token == 0) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) && (!(1 == m_pc) || !(2 == m_st)))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((((!(E_M == 0) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((T1_E == 0 || ((((1 == t2_pc && E_M == 2) && m_st == 2) && t1_st == 2) && t2_st == 2)) || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == m_pc)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && \old(t1_st) <= t1_st)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(0 == local)) || !(t1_pc == 1)) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(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)) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || !(2 == E_2)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || !(1 == m_pc)) || !(2 == E_1)) || !(0 == \old(t2_pc))) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || ((((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && token <= local + 2) && \old(E_2) <= E_2)) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || ((((((((((2 <= t2_st && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || \old(E_1) < 2) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && 0 == t2_st) && 2 <= t1_st)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || (((2 <= t2_st && token <= local) && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && local <= token)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && token <= local) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && local <= token) && !(E_M == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((!(2 == \old(t2_st)) || T1_E == 0) || (((((((t2_pc == 1 && E_M == 2) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && t1_pc == 1) && t1_st == 2) && t2_st == 2) && E_1 == 2) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || !(2 == \old(E_M))) || !(1 == \old(t2_pc))) || !(\old(t1_st) == 2)) || !(1 == \old(m_pc))) || !(2 == \old(E_1))) || \old(E_2) < 2)) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || \old(local) < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && token <= local) && 2 <= E_1) && \old(t1_st) <= t1_st) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && local + 1 <= token) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 0 == t2_st) && 2 <= t1_st)) || ((((((((t2_pc == 1 && E_M == 2) && t1_pc == 1) && m_st == 2) && t1_st == 2) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && t2_st == 2) && E_1 == 2) && \old(E_2) <= E_2)) || ((((((((((2 <= t2_st && 1 == t1_pc) && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1))) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && !(E_M == 1)) && token <= local + 2)) || ((((((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && token <= local) && m_st == 2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && local <= token) && !(E_M == 1))) || !(m_i == 1)) || ((((((((((1 == t1_pc && m_st == 2) && 2 <= t1_st) && t2_pc <= 0) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && 0 == t2_st) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == M_E)) || (((((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && token <= local) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local) && local <= token) && 0 == t2_st)) || !(1 == t1_i)) || ((((((((((1 == t2_pc && !(1 == t1_pc)) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && token <= local) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((E_M == 2 && (E_1 == 2 && m_st == 0) && m_pc == 0) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || ((((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && token <= local) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && local <= token) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((E_M == 2 && t1_pc == 1) && (m_pc == 1 && t2_st == 0) && m_st == 2) && t1_st == 2) && E_1 == 2) && t2_pc == 0) && E_2 == 2)) || (((((((E_M == 2 && t1_st == 0) && t2_st == 0) && ((m_st == 2 && E_1 == 2) && t2_pc == 0) && 1 == m_pc) && token <= local) && E_2 == 2) && t1_pc == 0) && local <= token)) || ((((((((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_1) && ((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 0)) && !(m_st == 0)) && !(E_2 == 0)) && 0 == t2_st) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || (((((((((t1_pc == 1 && !(E_M == 0)) && 2 <= E_1) && !(E_M == 1)) && m_st == \old(m_st)) && t1_st == 2) && 0 == t2_st) && t2_pc == 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)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(2 == \old(E_1))) || !(1 == t2_i)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= t2_st && token <= local + 1) && local + 1 <= token) && m_st == 2) && 2 <= t1_st) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1)) || !(2 == \old(E_2))) || (((((2 <= t2_st && m_st == 2) && 2 <= t1_st) && local + 2 <= token) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1)) && token <= local + 2)) || !(\old(T1_E) == 2)) || ((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && ((((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local + 2)) || !(1 == t1_i)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(\old(T2_E) == 2)) || (((((E_1 == 2 && t2_st == 2) && E_M == 2) && m_st == 2) && t1_st == 2) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1))) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || (((((2 <= t2_st && token <= local) && m_st == 2) && 2 <= t1_st) && local <= token) && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(m_st == 0)) && !(E_M == 1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 107.1s OverallTime, 31 OverallIterations, 4 TraceHistogramMax, 57.5s AutomataDifference, 0.0s DeadEndRemovalTime, 34.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 9137 SDtfs, 14389 SDslu, 37418 SDs, 0 SdLazy, 18906 SolverSat, 4909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 6673 GetRequests, 5771 SyntacticMatches, 45 SemanticMatches, 857 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35016 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8710occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 18 AbstIntIterations, 8 AbstIntStrong, 0.9906767517684625 AbsIntWeakeningRatio, 0.5923694779116466 AbsIntAvgWeakeningVarsNumRemoved, 14.674029451137885 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 1765 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 19035 PreInvPairs, 19647 NumberOfFragments, 28532 HoareAnnotationTreeSize, 19035 FomulaSimplifications, 333381 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 71 FomulaSimplificationsInter, 124549 FormulaSimplificationTreeSizeReductionInter, 31.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 7863 NumberOfCodeBlocks, 7863 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 10112 ConstructedInterpolants, 0 QuantifiedInterpolants, 2876571 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9898 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 51 InterpolantComputations, 26 PerfectInterpolantSequences, 6232/6533 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...