./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d58fadf54daed6107b58402b79d250d23d0301 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:38:18,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:38:18,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:38:18,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:38:18,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:38:18,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:38:18,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:38:18,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:38:18,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:38:18,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:38:18,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:38:18,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:38:18,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:38:18,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:38:18,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:38:18,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:38:18,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:38:18,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:38:18,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:38:18,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:38:18,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:38:18,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:38:18,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:38:18,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:38:18,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:38:18,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:38:18,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:38:18,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:38:18,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:38:18,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:38:18,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:38:18,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:38:18,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:38:18,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:38:18,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:38:18,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:38:18,349 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:38:18,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:38:18,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:38:18,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:38:18,357 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:38:18,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:38:18,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:38:18,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:38:18,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:38:18,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:38:18,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:38:18,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:38:18,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:38:18,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:38:18,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:38:18,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:38:18,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:18,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:38:18,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:38:18,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:38:18,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-11-28 11:38:18,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:38:18,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:38:18,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:38:18,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:38:18,400 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:38:18,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-28 11:38:18,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/data/12540d626/07a4e1be5e254e4abd5a83e4f6de5e8a/FLAGc52faa461 [2018-11-28 11:38:18,753 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:38:18,754 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-28 11:38:18,760 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/data/12540d626/07a4e1be5e254e4abd5a83e4f6de5e8a/FLAGc52faa461 [2018-11-28 11:38:18,771 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/data/12540d626/07a4e1be5e254e4abd5a83e4f6de5e8a [2018-11-28 11:38:18,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:38:18,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:38:18,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:18,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:38:18,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:38:18,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:18,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7436133b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18, skipping insertion in model container [2018-11-28 11:38:18,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:18,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:38:18,806 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:38:18,921 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:18,925 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:38:18,948 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:18,959 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:38:18,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18 WrapperNode [2018-11-28 11:38:18,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:18,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:38:18,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:38:18,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:38:19,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:38:19,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:38:19,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:38:19,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:38:19,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... [2018-11-28 11:38:19,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:38:19,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:38:19,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:38:19,036 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:38:19,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-28 11:38:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-28 11:38:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-28 11:38:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-28 11:38:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:38:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:38:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-28 11:38:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-28 11:38:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-28 11:38:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-28 11:38:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-28 11:38:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-28 11:38:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-28 11:38:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-28 11:38:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-28 11:38:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-28 11:38:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-28 11:38:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-28 11:38:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-28 11:38:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-28 11:38:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-28 11:38:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-28 11:38:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-28 11:38:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-28 11:38:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-28 11:38:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-28 11:38:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-28 11:38:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-28 11:38:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-28 11:38:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-28 11:38:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-28 11:38:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-28 11:38:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-28 11:38:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-28 11:38:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:38:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:38:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-28 11:38:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-28 11:38:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-28 11:38:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-28 11:38:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-28 11:38:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-28 11:38:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:38:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:38:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-28 11:38:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-28 11:38:19,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:38:19,523 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:38:19,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:19 BoogieIcfgContainer [2018-11-28 11:38:19,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:38:19,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:38:19,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:38:19,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:38:19,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:38:18" (1/3) ... [2018-11-28 11:38:19,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456ff8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:19, skipping insertion in model container [2018-11-28 11:38:19,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:18" (2/3) ... [2018-11-28 11:38:19,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456ff8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:19, skipping insertion in model container [2018-11-28 11:38:19,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:19" (3/3) ... [2018-11-28 11:38:19,530 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-28 11:38:19,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:38:19,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:38:19,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:38:19,587 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:38:19,588 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:38:19,588 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:38:19,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:38:19,588 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:38:19,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:38:19,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:38:19,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:38:19,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:38:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-11-28 11:38:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:19,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:19,611 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-28 11:38:19,613 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:19,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-11-28 11:38:19,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:19,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:19,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:19,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:19,860 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-28 11:38:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:19,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:19,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:19,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:19,880 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-11-28 11:38:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:20,309 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-11-28 11:38:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:20,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:20,321 INFO L225 Difference]: With dead ends: 361 [2018-11-28 11:38:20,321 INFO L226 Difference]: Without dead ends: 195 [2018-11-28 11:38:20,324 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-28 11:38:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-28 11:38:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-28 11:38:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-11-28 11:38:20,365 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-11-28 11:38:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:20,366 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-11-28 11:38:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-11-28 11:38:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:20,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:20,368 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-28 11:38:20,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:20,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-11-28 11:38:20,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:20,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:20,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:20,463 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-28 11:38:20,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:20,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:20,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:20,465 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-11-28 11:38:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:20,732 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-11-28 11:38:20,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:20,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:20,736 INFO L225 Difference]: With dead ends: 340 [2018-11-28 11:38:20,736 INFO L226 Difference]: Without dead ends: 195 [2018-11-28 11:38:20,738 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-28 11:38:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-28 11:38:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-11-28 11:38:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-11-28 11:38:20,756 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-11-28 11:38:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:20,756 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-11-28 11:38:20,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-11-28 11:38:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:20,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:20,758 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-28 11:38:20,759 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:20,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:20,759 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-11-28 11:38:20,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:20,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:20,833 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-28 11:38:20,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:20,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:20,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:20,834 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-11-28 11:38:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:21,071 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-11-28 11:38:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:21,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:21,073 INFO L225 Difference]: With dead ends: 338 [2018-11-28 11:38:21,074 INFO L226 Difference]: Without dead ends: 193 [2018-11-28 11:38:21,074 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-28 11:38:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-28 11:38:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-11-28 11:38:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-11-28 11:38:21,092 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-11-28 11:38:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:21,092 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-11-28 11:38:21,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-11-28 11:38:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:21,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:21,096 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-28 11:38:21,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:21,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-11-28 11:38:21,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:21,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:21,163 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-28 11:38:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:21,165 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-11-28 11:38:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:21,398 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-11-28 11:38:21,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:21,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:21,400 INFO L225 Difference]: With dead ends: 355 [2018-11-28 11:38:21,400 INFO L226 Difference]: Without dead ends: 210 [2018-11-28 11:38:21,401 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-28 11:38:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-28 11:38:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-11-28 11:38:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-11-28 11:38:21,417 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-11-28 11:38:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:21,417 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-11-28 11:38:21,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-11-28 11:38:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:21,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:21,418 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-28 11:38:21,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:21,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-11-28 11:38:21,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:21,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:21,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:21,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:21,471 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-28 11:38:21,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:21,472 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-11-28 11:38:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:21,678 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-11-28 11:38:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:21,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:21,680 INFO L225 Difference]: With dead ends: 349 [2018-11-28 11:38:21,680 INFO L226 Difference]: Without dead ends: 204 [2018-11-28 11:38:21,680 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-28 11:38:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-28 11:38:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-11-28 11:38:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-11-28 11:38:21,695 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-11-28 11:38:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:21,696 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-11-28 11:38:21,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-11-28 11:38:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:21,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:21,697 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-28 11:38:21,697 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:21,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-11-28 11:38:21,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:21,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:21,755 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-28 11:38:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:21,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:21,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:21,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:21,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:21,756 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-11-28 11:38:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:21,962 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-11-28 11:38:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:21,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:38:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:21,964 INFO L225 Difference]: With dead ends: 351 [2018-11-28 11:38:21,964 INFO L226 Difference]: Without dead ends: 206 [2018-11-28 11:38:21,964 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-28 11:38:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-28 11:38:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-11-28 11:38:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-28 11:38:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-11-28 11:38:21,977 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-11-28 11:38:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:21,977 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-11-28 11:38:21,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-11-28 11:38:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:38:21,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:21,978 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-28 11:38:21,978 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:21,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-11-28 11:38:21,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:22,019 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-28 11:38:22,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:22,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:22,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:38:22,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:38:22,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:22,020 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-11-28 11:38:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:22,219 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-11-28 11:38:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:38:22,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 11:38:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:22,223 INFO L225 Difference]: With dead ends: 445 [2018-11-28 11:38:22,225 INFO L226 Difference]: Without dead ends: 301 [2018-11-28 11:38:22,226 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-28 11:38:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-28 11:38:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-11-28 11:38:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-28 11:38:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-11-28 11:38:22,259 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-11-28 11:38:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:22,260 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-11-28 11:38:22,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:38:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-11-28 11:38:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-28 11:38:22,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:22,263 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-28 11:38:22,263 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:22,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-11-28 11:38:22,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:22,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:22,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:22,350 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-28 11:38:22,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:22,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:22,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:22,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:38:22,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:22,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:38:22,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:22,503 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 7 states. [2018-11-28 11:38:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:22,660 INFO L93 Difference]: Finished difference Result 871 states and 1227 transitions. [2018-11-28 11:38:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:38:22,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-11-28 11:38:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:22,664 INFO L225 Difference]: With dead ends: 871 [2018-11-28 11:38:22,664 INFO L226 Difference]: Without dead ends: 592 [2018-11-28 11:38:22,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:38:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-11-28 11:38:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 567. [2018-11-28 11:38:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-11-28 11:38:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 766 transitions. [2018-11-28 11:38:22,718 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 766 transitions. Word has length 145 [2018-11-28 11:38:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:22,718 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 766 transitions. [2018-11-28 11:38:22,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 766 transitions. [2018-11-28 11:38:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-28 11:38:22,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:22,721 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, 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-28 11:38:22,721 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2045120242, now seen corresponding path program 1 times [2018-11-28 11:38:22,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 11:38:22,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:22,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:22,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:38:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:38:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:22,761 INFO L87 Difference]: Start difference. First operand 567 states and 766 transitions. Second operand 4 states. [2018-11-28 11:38:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:22,899 INFO L93 Difference]: Finished difference Result 1107 states and 1494 transitions. [2018-11-28 11:38:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:38:22,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-11-28 11:38:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:22,903 INFO L225 Difference]: With dead ends: 1107 [2018-11-28 11:38:22,903 INFO L226 Difference]: Without dead ends: 561 [2018-11-28 11:38:22,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-28 11:38:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-11-28 11:38:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-28 11:38:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 754 transitions. [2018-11-28 11:38:22,959 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 754 transitions. Word has length 164 [2018-11-28 11:38:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:22,960 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 754 transitions. [2018-11-28 11:38:22,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:38:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 754 transitions. [2018-11-28 11:38:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-28 11:38:22,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:22,962 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] [2018-11-28 11:38:22,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:22,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2046681584, now seen corresponding path program 1 times [2018-11-28 11:38:22,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:22,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:22,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 11:38:23,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:23,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:23,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:23,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:38:23,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:23,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-28 11:38:23,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:23,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:23,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:23,137 INFO L87 Difference]: Start difference. First operand 561 states and 754 transitions. Second operand 5 states. [2018-11-28 11:38:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:23,480 INFO L93 Difference]: Finished difference Result 2135 states and 3119 transitions. [2018-11-28 11:38:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:23,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-11-28 11:38:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:23,487 INFO L225 Difference]: With dead ends: 2135 [2018-11-28 11:38:23,487 INFO L226 Difference]: Without dead ends: 1595 [2018-11-28 11:38:23,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-28 11:38:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1560. [2018-11-28 11:38:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-11-28 11:38:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2157 transitions. [2018-11-28 11:38:23,595 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2157 transitions. Word has length 146 [2018-11-28 11:38:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:23,595 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 2157 transitions. [2018-11-28 11:38:23,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2157 transitions. [2018-11-28 11:38:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-28 11:38:23,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:23,598 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, 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-28 11:38:23,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:23,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1779269911, now seen corresponding path program 1 times [2018-11-28 11:38:23,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:23,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:23,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:23,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:23,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-28 11:38:23,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:23,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:23,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:23,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:38:23,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:23,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:38:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:23,769 INFO L87 Difference]: Start difference. First operand 1560 states and 2157 transitions. Second operand 7 states. [2018-11-28 11:38:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:23,977 INFO L93 Difference]: Finished difference Result 4635 states and 7087 transitions. [2018-11-28 11:38:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:38:23,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2018-11-28 11:38:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:23,988 INFO L225 Difference]: With dead ends: 4635 [2018-11-28 11:38:23,989 INFO L226 Difference]: Without dead ends: 3100 [2018-11-28 11:38:23,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:38:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-28 11:38:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3092. [2018-11-28 11:38:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2018-11-28 11:38:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4461 transitions. [2018-11-28 11:38:24,152 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4461 transitions. Word has length 166 [2018-11-28 11:38:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:24,153 INFO L480 AbstractCegarLoop]: Abstraction has 3092 states and 4461 transitions. [2018-11-28 11:38:24,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4461 transitions. [2018-11-28 11:38:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-28 11:38:24,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:24,156 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] [2018-11-28 11:38:24,156 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2137289136, now seen corresponding path program 1 times [2018-11-28 11:38:24,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-28 11:38:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:38:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:38:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:24,194 INFO L87 Difference]: Start difference. First operand 3092 states and 4461 transitions. Second operand 4 states. [2018-11-28 11:38:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:24,431 INFO L93 Difference]: Finished difference Result 6147 states and 8869 transitions. [2018-11-28 11:38:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:38:24,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-11-28 11:38:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:24,442 INFO L225 Difference]: With dead ends: 6147 [2018-11-28 11:38:24,442 INFO L226 Difference]: Without dead ends: 3082 [2018-11-28 11:38:24,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2018-11-28 11:38:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2018-11-28 11:38:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-11-28 11:38:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4441 transitions. [2018-11-28 11:38:24,605 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4441 transitions. Word has length 146 [2018-11-28 11:38:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:24,605 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 4441 transitions. [2018-11-28 11:38:24,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:38:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4441 transitions. [2018-11-28 11:38:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-28 11:38:24,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:24,608 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] [2018-11-28 11:38:24,608 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:24,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1156086387, now seen corresponding path program 1 times [2018-11-28 11:38:24,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:24,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:24,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-28 11:38:24,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:24,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:24,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:38:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:38:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:24,655 INFO L87 Difference]: Start difference. First operand 3082 states and 4441 transitions. Second operand 4 states. [2018-11-28 11:38:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:24,846 INFO L93 Difference]: Finished difference Result 5650 states and 8033 transitions. [2018-11-28 11:38:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:38:24,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-11-28 11:38:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:24,854 INFO L225 Difference]: With dead ends: 5650 [2018-11-28 11:38:24,855 INFO L226 Difference]: Without dead ends: 2590 [2018-11-28 11:38:24,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:38:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-11-28 11:38:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2018-11-28 11:38:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2018-11-28 11:38:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3618 transitions. [2018-11-28 11:38:25,009 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3618 transitions. Word has length 147 [2018-11-28 11:38:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 2590 states and 3618 transitions. [2018-11-28 11:38:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:38:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3618 transitions. [2018-11-28 11:38:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-28 11:38:25,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:25,012 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] [2018-11-28 11:38:25,012 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:25,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash -611213813, now seen corresponding path program 1 times [2018-11-28 11:38:25,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:25,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:25,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:25,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:25,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-28 11:38:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:25,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:25,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:25,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:38:25,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:25,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:38:25,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:25,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:25,186 INFO L87 Difference]: Start difference. First operand 2590 states and 3618 transitions. Second operand 7 states. [2018-11-28 11:38:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:25,378 INFO L93 Difference]: Finished difference Result 5641 states and 8271 transitions. [2018-11-28 11:38:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:38:25,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2018-11-28 11:38:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:25,388 INFO L225 Difference]: With dead ends: 5641 [2018-11-28 11:38:25,388 INFO L226 Difference]: Without dead ends: 3072 [2018-11-28 11:38:25,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:38:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-11-28 11:38:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3070. [2018-11-28 11:38:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-11-28 11:38:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4168 transitions. [2018-11-28 11:38:25,531 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4168 transitions. Word has length 147 [2018-11-28 11:38:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:25,531 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 4168 transitions. [2018-11-28 11:38:25,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4168 transitions. [2018-11-28 11:38:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:25,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:25,536 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, 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-28 11:38:25,536 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:25,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1841736258, now seen corresponding path program 1 times [2018-11-28 11:38:25,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:25,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:25,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:25,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:25,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:25,608 INFO L87 Difference]: Start difference. First operand 3070 states and 4168 transitions. Second operand 5 states. [2018-11-28 11:38:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:26,037 INFO L93 Difference]: Finished difference Result 7390 states and 10200 transitions. [2018-11-28 11:38:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:26,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:26,048 INFO L225 Difference]: With dead ends: 7390 [2018-11-28 11:38:26,048 INFO L226 Difference]: Without dead ends: 4342 [2018-11-28 11:38:26,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2018-11-28 11:38:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3928. [2018-11-28 11:38:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-28 11:38:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5092 transitions. [2018-11-28 11:38:26,222 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5092 transitions. Word has length 190 [2018-11-28 11:38:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:26,222 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5092 transitions. [2018-11-28 11:38:26,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5092 transitions. [2018-11-28 11:38:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:26,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:26,227 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, 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-28 11:38:26,227 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:26,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1256964608, now seen corresponding path program 1 times [2018-11-28 11:38:26,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:26,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:26,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:26,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:26,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:26,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:26,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:26,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:26,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:26,282 INFO L87 Difference]: Start difference. First operand 3928 states and 5092 transitions. Second operand 5 states. [2018-11-28 11:38:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:26,611 INFO L93 Difference]: Finished difference Result 7834 states and 10194 transitions. [2018-11-28 11:38:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:26,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:26,621 INFO L225 Difference]: With dead ends: 7834 [2018-11-28 11:38:26,621 INFO L226 Difference]: Without dead ends: 3928 [2018-11-28 11:38:26,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-11-28 11:38:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2018-11-28 11:38:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-28 11:38:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5056 transitions. [2018-11-28 11:38:26,823 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5056 transitions. Word has length 190 [2018-11-28 11:38:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:26,823 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5056 transitions. [2018-11-28 11:38:26,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5056 transitions. [2018-11-28 11:38:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:26,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:26,829 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, 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-28 11:38:26,829 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:26,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash 822459010, now seen corresponding path program 1 times [2018-11-28 11:38:26,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:26,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:26,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:26,934 INFO L87 Difference]: Start difference. First operand 3928 states and 5056 transitions. Second operand 5 states. [2018-11-28 11:38:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:27,283 INFO L93 Difference]: Finished difference Result 7834 states and 10122 transitions. [2018-11-28 11:38:27,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:27,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:27,295 INFO L225 Difference]: With dead ends: 7834 [2018-11-28 11:38:27,295 INFO L226 Difference]: Without dead ends: 3928 [2018-11-28 11:38:27,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-11-28 11:38:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2018-11-28 11:38:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2018-11-28 11:38:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5020 transitions. [2018-11-28 11:38:27,463 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5020 transitions. Word has length 190 [2018-11-28 11:38:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:27,464 INFO L480 AbstractCegarLoop]: Abstraction has 3928 states and 5020 transitions. [2018-11-28 11:38:27,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5020 transitions. [2018-11-28 11:38:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:27,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:27,469 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, 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-28 11:38:27,469 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:27,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 392800704, now seen corresponding path program 1 times [2018-11-28 11:38:27,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:27,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:27,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:27,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:27,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:27,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:27,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:27,531 INFO L87 Difference]: Start difference. First operand 3928 states and 5020 transitions. Second operand 5 states. [2018-11-28 11:38:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:28,034 INFO L93 Difference]: Finished difference Result 8608 states and 12144 transitions. [2018-11-28 11:38:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:28,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:28,049 INFO L225 Difference]: With dead ends: 8608 [2018-11-28 11:38:28,049 INFO L226 Difference]: Without dead ends: 4702 [2018-11-28 11:38:28,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2018-11-28 11:38:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 4264. [2018-11-28 11:38:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4264 states. [2018-11-28 11:38:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 5297 transitions. [2018-11-28 11:38:28,352 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 5297 transitions. Word has length 190 [2018-11-28 11:38:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:28,352 INFO L480 AbstractCegarLoop]: Abstraction has 4264 states and 5297 transitions. [2018-11-28 11:38:28,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 5297 transitions. [2018-11-28 11:38:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:28,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:28,356 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, 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-28 11:38:28,357 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:28,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:28,357 INFO L82 PathProgramCache]: Analyzing trace with hash -313795902, now seen corresponding path program 1 times [2018-11-28 11:38:28,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:28,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:28,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:28,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:28,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:28,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:28,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:28,419 INFO L87 Difference]: Start difference. First operand 4264 states and 5297 transitions. Second operand 5 states. [2018-11-28 11:38:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:28,816 INFO L93 Difference]: Finished difference Result 8551 states and 11151 transitions. [2018-11-28 11:38:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:28,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:28,827 INFO L225 Difference]: With dead ends: 8551 [2018-11-28 11:38:28,827 INFO L226 Difference]: Without dead ends: 4309 [2018-11-28 11:38:28,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2018-11-28 11:38:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4205. [2018-11-28 11:38:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2018-11-28 11:38:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5190 transitions. [2018-11-28 11:38:29,120 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5190 transitions. Word has length 190 [2018-11-28 11:38:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:29,121 INFO L480 AbstractCegarLoop]: Abstraction has 4205 states and 5190 transitions. [2018-11-28 11:38:29,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5190 transitions. [2018-11-28 11:38:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:29,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:29,126 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, 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-28 11:38:29,126 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:29,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 633241984, now seen corresponding path program 1 times [2018-11-28 11:38:29,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:29,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:29,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-28 11:38:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:29,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:29,214 INFO L87 Difference]: Start difference. First operand 4205 states and 5190 transitions. Second operand 5 states. [2018-11-28 11:38:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:29,823 INFO L93 Difference]: Finished difference Result 8822 states and 12365 transitions. [2018-11-28 11:38:29,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:29,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2018-11-28 11:38:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:29,836 INFO L225 Difference]: With dead ends: 8822 [2018-11-28 11:38:29,837 INFO L226 Difference]: Without dead ends: 4638 [2018-11-28 11:38:29,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2018-11-28 11:38:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4240. [2018-11-28 11:38:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4240 states. [2018-11-28 11:38:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5172 transitions. [2018-11-28 11:38:30,195 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5172 transitions. Word has length 190 [2018-11-28 11:38:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:30,195 INFO L480 AbstractCegarLoop]: Abstraction has 4240 states and 5172 transitions. [2018-11-28 11:38:30,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5172 transitions. [2018-11-28 11:38:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-28 11:38:30,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:30,200 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, 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-28 11:38:30,200 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:30,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:30,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1495075586, now seen corresponding path program 1 times [2018-11-28 11:38:30,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-28 11:38:30,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:30,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:30,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:38:30,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:30,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-28 11:38:30,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:30,408 INFO L87 Difference]: Start difference. First operand 4240 states and 5172 transitions. Second operand 7 states. [2018-11-28 11:38:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:31,394 INFO L93 Difference]: Finished difference Result 10063 states and 13370 transitions. [2018-11-28 11:38:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:31,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2018-11-28 11:38:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:31,407 INFO L225 Difference]: With dead ends: 10063 [2018-11-28 11:38:31,407 INFO L226 Difference]: Without dead ends: 5844 [2018-11-28 11:38:31,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2018-11-28 11:38:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5840. [2018-11-28 11:38:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5840 states. [2018-11-28 11:38:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5840 states to 5840 states and 7152 transitions. [2018-11-28 11:38:31,714 INFO L78 Accepts]: Start accepts. Automaton has 5840 states and 7152 transitions. Word has length 190 [2018-11-28 11:38:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:31,714 INFO L480 AbstractCegarLoop]: Abstraction has 5840 states and 7152 transitions. [2018-11-28 11:38:31,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5840 states and 7152 transitions. [2018-11-28 11:38:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-28 11:38:31,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:31,718 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, 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-28 11:38:31,718 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:31,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1598654101, now seen corresponding path program 1 times [2018-11-28 11:38:31,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:31,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:31,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-28 11:38:31,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:31,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:31,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:38:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-28 11:38:31,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:31,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:31,874 INFO L87 Difference]: Start difference. First operand 5840 states and 7152 transitions. Second operand 3 states. [2018-11-28 11:38:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:32,201 INFO L93 Difference]: Finished difference Result 9506 states and 11882 transitions. [2018-11-28 11:38:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:32,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-28 11:38:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:32,219 INFO L225 Difference]: With dead ends: 9506 [2018-11-28 11:38:32,220 INFO L226 Difference]: Without dead ends: 4866 [2018-11-28 11:38:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 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-28 11:38:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2018-11-28 11:38:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 4813. [2018-11-28 11:38:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4813 states. [2018-11-28 11:38:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 5700 transitions. [2018-11-28 11:38:32,651 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 5700 transitions. Word has length 212 [2018-11-28 11:38:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:32,651 INFO L480 AbstractCegarLoop]: Abstraction has 4813 states and 5700 transitions. [2018-11-28 11:38:32,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 5700 transitions. [2018-11-28 11:38:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-11-28 11:38:32,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:32,660 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:32,660 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:32,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash -763815358, now seen corresponding path program 1 times [2018-11-28 11:38:32,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:32,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:32,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:32,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:32,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 43 proven. 32 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-28 11:38:32,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:32,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:32,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-28 11:38:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-28 11:38:32,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:38:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:38:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:38:32,955 INFO L87 Difference]: Start difference. First operand 4813 states and 5700 transitions. Second operand 12 states. [2018-11-28 11:38:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:33,174 INFO L93 Difference]: Finished difference Result 7108 states and 8398 transitions. [2018-11-28 11:38:33,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:38:33,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 372 [2018-11-28 11:38:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:33,180 INFO L225 Difference]: With dead ends: 7108 [2018-11-28 11:38:33,181 INFO L226 Difference]: Without dead ends: 2317 [2018-11-28 11:38:33,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:38:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2018-11-28 11:38:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2121. [2018-11-28 11:38:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-11-28 11:38:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2336 transitions. [2018-11-28 11:38:33,309 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2336 transitions. Word has length 372 [2018-11-28 11:38:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:33,310 INFO L480 AbstractCegarLoop]: Abstraction has 2121 states and 2336 transitions. [2018-11-28 11:38:33,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:38:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2336 transitions. [2018-11-28 11:38:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-28 11:38:33,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:33,313 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:33,313 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:33,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash 79500943, now seen corresponding path program 1 times [2018-11-28 11:38:33,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:33,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:33,374 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-28 11:38:33,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:33,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/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-28 11:38:33,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:33,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-28 11:38:33,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:38:33,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-28 11:38:33,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:33,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:33,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:33,527 INFO L87 Difference]: Start difference. First operand 2121 states and 2336 transitions. Second operand 7 states. [2018-11-28 11:38:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:33,927 INFO L93 Difference]: Finished difference Result 2769 states and 3036 transitions. [2018-11-28 11:38:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:38:33,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2018-11-28 11:38:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:33,929 INFO L225 Difference]: With dead ends: 2769 [2018-11-28 11:38:33,930 INFO L226 Difference]: Without dead ends: 442 [2018-11-28 11:38:33,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:38:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-11-28 11:38:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2018-11-28 11:38:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-28 11:38:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 460 transitions. [2018-11-28 11:38:33,957 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 460 transitions. Word has length 264 [2018-11-28 11:38:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:33,957 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 460 transitions. [2018-11-28 11:38:33,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 460 transitions. [2018-11-28 11:38:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-28 11:38:33,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:33,959 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-28 11:38:33,959 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:38:33,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 1 times [2018-11-28 11:38:33,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:33,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:34,076 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-28 11:38:34,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:34,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:34,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:34,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:34,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:34,077 INFO L87 Difference]: Start difference. First operand 442 states and 460 transitions. Second operand 7 states. [2018-11-28 11:38:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:34,437 INFO L93 Difference]: Finished difference Result 442 states and 460 transitions. [2018-11-28 11:38:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:38:34,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-11-28 11:38:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:34,439 INFO L225 Difference]: With dead ends: 442 [2018-11-28 11:38:34,439 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:38:34,440 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-28 11:38:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:38:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:38:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:38:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:38:34,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-11-28 11:38:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:34,440 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:38:34,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:38:34,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:38:34,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:38:34,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:35,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:36,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:38:37,328 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:38,499 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 167 DAG size of output: 89 [2018-11-28 11:38:38,698 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:39,106 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2018-11-28 11:38:39,865 WARN L180 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 96 [2018-11-28 11:38:40,337 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-11-28 11:38:40,441 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2018-11-28 11:38:40,732 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2018-11-28 11:38:40,834 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-11-28 11:38:40,937 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-28 11:38:41,298 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-11-28 11:38:41,800 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2018-11-28 11:38:41,999 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:42,323 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-28 11:38:42,620 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2018-11-28 11:38:43,195 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-28 11:38:43,659 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2018-11-28 11:38:44,504 WARN L180 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 91 [2018-11-28 11:38:45,292 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 100 [2018-11-28 11:38:45,680 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2018-11-28 11:38:46,569 WARN L180 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 106 [2018-11-28 11:38:47,319 WARN L180 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2018-11-28 11:38:47,595 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:47,804 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2018-11-28 11:38:48,565 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 94 [2018-11-28 11:38:48,883 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 80 [2018-11-28 11:38:49,026 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-28 11:38:49,654 WARN L180 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 125 [2018-11-28 11:38:50,235 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 79 [2018-11-28 11:38:50,444 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-11-28 11:38:51,031 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 132 [2018-11-28 11:38:51,139 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2018-11-28 11:38:51,343 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:52,506 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 134 DAG size of output: 84 [2018-11-28 11:38:52,707 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2018-11-28 11:38:53,163 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-11-28 11:38:53,757 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 91 [2018-11-28 11:38:53,969 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 96 [2018-11-28 11:38:54,325 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2018-11-28 11:38:55,004 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2018-11-28 11:38:55,347 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-28 11:38:55,548 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-11-28 11:38:56,583 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 204 DAG size of output: 158 [2018-11-28 11:38:57,073 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2018-11-28 11:38:57,333 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:58,007 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2018-11-28 11:38:58,166 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2018-11-28 11:38:58,357 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-28 11:38:58,891 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2018-11-28 11:38:59,407 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 121 [2018-11-28 11:39:00,486 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 204 DAG size of output: 158 [2018-11-28 11:39:00,489 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 0)) (.cse37 (= 1 ~m_pc~0))) (let ((.cse27 (= 1 ~t2_pc~0)) (.cse31 (and (not .cse0) (not .cse9) .cse37 (not (= ~M_E~0 0)) (not (= ~E_2~0 0)))) (.cse34 (= 0 ~t2_st~0))) (let ((.cse4 (< |old(~m_st~0)| 2)) (.cse26 (and .cse31 .cse34)) (.cse18 (not .cse37)) (.cse5 (<= 2 ~m_st~0)) (.cse25 (not (= ~E_2~0 1))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse29 (< ~local~0 |old(~token~0)|)) (.cse30 (< |old(~token~0)| ~local~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse32 (= ~m_st~0 0)) (.cse6 (= |old(~E_2~0)| ~E_2~0)) (.cse7 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse8 (<= 2 ~t2_st~0)) (.cse33 (<= ~token~0 ~local~0)) (.cse35 (<= ~local~0 ~token~0)) (.cse12 (= 1 ~E_M~0)) (.cse13 (not .cse27)) (.cse14 (= ~T1_E~0 1)) (.cse36 (not (= 0 |old(~m_st~0)|))) (.cse15 (not (= ~m_i~0 1))) (.cse16 (= 1 ~E_1~0)) (.cse17 (= 1 |old(~E_2~0)|)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse23 (= 0 |old(~E_2~0)|)) (.cse24 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 (and .cse5 .cse7 .cse25 .cse26) .cse2 .cse4 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse27 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10 .cse11 .cse12 .cse14 .cse15 .cse27 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse2 .cse29 .cse4 (and .cse5 .cse7 .cse25 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse26) .cse9 .cse10 .cse11 .cse16 .cse17 .cse20 .cse23 .cse24 .cse1 .cse30 .cse12 .cse13 .cse14 .cse15 .cse18 (and .cse31 .cse5 .cse7 .cse8 .cse25) .cse19 .cse21 .cse22) (or .cse0 .cse2 .cse29 .cse30 .cse3 .cse9 .cse10 (and .cse32 .cse6 .cse7 .cse33 .cse34 .cse35) .cse11 .cse12 .cse14 .cse36 .cse15 .cse27 .cse16 .cse28 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse37) (or .cse0 .cse1 .cse2 .cse29 .cse30 .cse3 .cse9 .cse10 .cse11 (and .cse32 .cse6 .cse7 .cse8 .cse33 .cse35) .cse12 .cse13 .cse14 .cse36 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse37))))) [2018-11-28 11:39:00,489 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-11-28 11:39:00,490 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse30 (= 1 ~t2_pc~0)) (.cse11 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse18 (not (= 0 |old(~m_st~0)|))) (.cse7 (< |old(~t2_st~0)| 2)) (.cse36 (= 1 ~t1_pc~0)) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse5 (<= 2 ~t2_st~0)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse35 (not .cse11)) (.cse10 (< |old(~token~0)| ~local~0)) (.cse16 (not .cse30)) (.cse6 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 1)) (.cse32 (< |old(~m_st~0)| 2)) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 ~E_1~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse21 (= 1 |old(~E_2~0)|)) (.cse33 (not .cse28)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 |old(~E_2~0)|)) (.cse27 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~t1_pc~0 1))) (.cse34 (<= 2 ~m_st~0)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (= 0 ~t2_st~0))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse6 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse30 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse6 .cse7 .cse8 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 (and .cse0 .cse34 .cse3 .cse4 .cse5) .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse8 .cse35 (and .cse36 .cse34 .cse3 .cse4 .cse29) .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse30 .cse20 .cse31 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse7 (and .cse36 .cse34 .cse2 .cse3 .cse4 .cse5) .cse8 .cse9 .cse35 .cse10 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse8 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse30 .cse20 .cse31 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse0 .cse34 .cse3 .cse4 .cse29))))) [2018-11-28 11:39:00,490 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-28 11:39:00,490 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse10 (not (= 0 |old(~m_st~0)|))) (.cse23 (< |old(~t2_st~0)| 2)) (.cse29 (not .cse12)) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse24 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= |old(~E_2~0)| ~E_2~0)) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse15 (= 1 |old(~E_2~0)|)) (.cse30 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 (and .cse24 .cse25 (= ~token~0 |old(~token~0)|) .cse26 .cse27 (<= 2 ~t2_st~0)) .cse1 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse11 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse11 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse4 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 (and .cse24 .cse25 .cse26 .cse27 (= 0 ~t2_st~0)) .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-28 11:39:00,490 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-11-28 11:39:00,490 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse30 (= 1 ~t2_pc~0)) (.cse36 (= 1 ~m_pc~0))) (let ((.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~E_2~0 0))) (.cse3 (< |old(~m_st~0)| 2)) (.cse24 (not .cse36)) (.cse13 (<= 2 ~m_st~0)) (.cse17 (= 0 ~t2_st~0)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse18 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse12 (= 1 ~t1_pc~0)) (.cse34 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse32 (= |old(~E_2~0)| ~E_2~0)) (.cse28 (<= 2 ~t2_st~0)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse19 (< |old(~token~0)| ~local~0)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse20 (= 1 ~E_M~0)) (.cse21 (not .cse30)) (.cse22 (= ~T1_E~0 1)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse23 (not (= ~m_i~0 1))) (.cse7 (= 1 ~E_1~0)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse25 (= 0 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~E_M~0)) (.cse10 (= 0 |old(~E_2~0)|)) (.cse11 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 (<= ~token~0 (+ |old(~token~0)| 1)) .cse16 .cse17 (<= (+ ~local~0 1) ~token~0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse28)) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse20 .cse22 .cse23 .cse30 .cse7 .cse31 .cse8 .cse24 .cse32 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse22 .cse23 .cse30 .cse7 .cse31 .cse8 .cse24 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse25 .cse9 .cse26 .cse27 .cse10 .cse11) (or .cse0 .cse18 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse23 .cse7 .cse8 .cse24 .cse25 .cse9 .cse26 .cse27 .cse10 (and .cse12 .cse13 .cse14 .cse32 .cse28) .cse11) (or .cse0 .cse1 .cse2 .cse19 .cse29 .cse4 .cse5 .cse6 .cse20 .cse22 .cse33 (and .cse12 .cse34 .cse14 .cse35 .cse32 .cse17) .cse23 .cse30 .cse7 .cse31 .cse8 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11 .cse36) (or .cse0 .cse18 .cse1 (and .cse12 .cse34 .cse14 .cse35 .cse32 .cse28) .cse2 .cse19 .cse29 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse33 .cse23 .cse7 .cse8 .cse25 .cse9 .cse26 .cse27 .cse10 .cse11 .cse36)))) [2018-11-28 11:39:00,490 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse10 (not (= 0 |old(~m_st~0)|))) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse25 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse24 (not .cse12)) (.cse9 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse26 (not .cse22)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse21 (= |old(~t1_st~0)| 0)) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (not (= ~E_2~0 0))) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse23 .cse1 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse27 .cse28 .cse29 .cse30 (= 0 ~t2_st~0))) (or .cse0 .cse1 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse25 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse27 .cse28 (<= ~token~0 (+ |old(~token~0)| 1)) .cse29 .cse30 (<= 2 ~t2_st~0) (<= (+ ~local~0 1) ~token~0)))))) [2018-11-28 11:39:00,490 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-11-28 11:39:00,490 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse33 (= |old(~t1_st~0)| 0)) (.cse20 (= 1 ~m_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse31 (<= 2 ~m_st~0)) (.cse28 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse1 (<= 2 ~t2_st~0))) (let ((.cse21 (< ~local~0 ~token~0)) (.cse22 (< ~token~0 ~local~0)) (.cse34 (and .cse31 .cse28 .cse1)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse26 (not .cse5)) (.cse30 (< |old(~m_st~0)| 2)) (.cse11 (not .cse23)) (.cse27 (< |old(~t1_st~0)| 2)) (.cse24 (= 1 ~E_1~0)) (.cse32 (not .cse20)) (.cse2 (= ~T1_E~0 0)) (.cse0 (= 0 ~t1_st~0)) (.cse29 (= 0 ~t2_st~0)) (.cse4 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not .cse33)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse23 .cse24 (= ~m_st~0 0) .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse26 .cse22 .cse6 .cse7 .cse8 .cse10 .cse27 .cse12 .cse13 .cse23 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse29) .cse20) (or .cse2 .cse3 .cse4 .cse21 .cse26 .cse22 .cse6 .cse7 .cse8 .cse10 .cse11 .cse27 .cse12 (and .cse28 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse2 .cse4 .cse26 .cse30 .cse6 .cse7 .cse8 (and .cse31 .cse28 .cse29) .cse10 .cse12 .cse13 .cse23 .cse24 .cse25 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33) (or .cse2 .cse3 .cse4 .cse26 .cse30 .cse6 .cse7 .cse10 .cse11 .cse27 .cse12 .cse13 .cse24 .cse14 .cse32 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19) (let ((.cse35 (+ ~local~0 1))) (or .cse2 .cse34 .cse3 .cse4 .cse26 .cse30 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (< ~token~0 .cse35) .cse13 .cse24 .cse32 .cse15 .cse16 .cse17 (< .cse35 ~token~0) .cse18 .cse19 .cse33)) (let ((.cse36 (+ ~local~0 2))) (or .cse2 .cse4 (< .cse36 ~token~0) .cse26 .cse30 .cse6 .cse7 .cse8 .cse11 .cse27 .cse12 .cse13 .cse24 .cse14 .cse32 (and .cse31 .cse28) .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse36))) (or .cse2 (and .cse0 .cse29) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse23 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-28 11:39:00,491 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse19 (= |old(~t1_st~0)| 0)) (.cse37 (= ~t1_pc~0 1)) (.cse33 (= 1 ~m_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse27 (<= 2 ~t2_st~0)) (.cse10 (= 1 ~t2_pc~0))) (let ((.cse24 (< |old(~t2_st~0)| 2)) (.cse3 (< |old(~m_st~0)| 2)) (.cse25 (not .cse10)) (.cse23 (and .cse20 .cse21 .cse27)) (.cse13 (not .cse33)) (.cse2 (not .cse37)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse36 (= 0 ~t1_st~0)) (.cse32 (= activate_threads_~tmp~1 0)) (.cse22 (= 0 ~t2_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 ~token~0)) (.cse29 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse38 (not .cse19)) (.cse7 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse31 (= 1 ~E_2~0)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse35 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21 .cse22)) (let ((.cse26 (+ ~local~0 1))) (or .cse23 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 (< ~token~0 .cse26) .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 (< .cse26 ~token~0) .cse17 .cse18 .cse19)) (or .cse0 .cse24 .cse1 (and .cse21 .cse27) .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse25 .cse30 .cse8 .cse9 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse24 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse25 .cse30 .cse8 .cse9 .cse31 .cse32 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33) (let ((.cse34 (+ ~local~0 2))) (or .cse0 .cse1 (< .cse34 ~token~0) .cse2 (and .cse20 .cse21) .cse3 .cse4 .cse5 (and .cse35 .cse21 .cse7) .cse6 .cse25 .cse30 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~token~0 .cse34))) (or (and .cse36 .cse32 .cse27) .cse0 .cse24 .cse1 .cse37 .cse4 .cse5 .cse6 .cse38 .cse7 .cse25 .cse8 .cse9 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33) (or .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 .cse23 .cse30 .cse8 .cse9 .cse11 .cse31 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse21 .cse32 .cse22) .cse33) (or .cse0 .cse1 .cse37 .cse4 .cse5 .cse6 .cse38 (and .cse36 .cse32 .cse22) .cse7 .cse8 .cse9 .cse10 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33) (or .cse0 .cse1 .cse28 .cse29 .cse37 .cse4 .cse5 .cse6 .cse38 .cse7 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 .cse10 .cse11 .cse12 .cse31 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse35)))) [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse33 (= |old(~t1_st~0)| 0)) (.cse20 (= 1 ~m_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse5 (= ~t1_pc~0 1)) (.cse31 (<= 2 ~m_st~0)) (.cse28 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse1 (<= 2 ~t2_st~0))) (let ((.cse21 (< ~local~0 ~token~0)) (.cse22 (< ~token~0 ~local~0)) (.cse34 (and .cse31 .cse28 .cse1)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse26 (not .cse5)) (.cse30 (< |old(~m_st~0)| 2)) (.cse11 (not .cse23)) (.cse27 (< |old(~t1_st~0)| 2)) (.cse24 (= 1 ~E_1~0)) (.cse32 (not .cse20)) (.cse2 (= ~T1_E~0 0)) (.cse0 (= 0 ~t1_st~0)) (.cse29 (= 0 ~t2_st~0)) (.cse4 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not .cse33)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse23 .cse24 (= ~m_st~0 0) .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse26 .cse22 .cse6 .cse7 .cse8 .cse10 .cse27 .cse12 .cse13 .cse23 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse29) .cse20) (or .cse2 .cse3 .cse4 .cse21 .cse26 .cse22 .cse6 .cse7 .cse8 .cse10 .cse11 .cse27 .cse12 (and .cse28 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse2 .cse4 .cse26 .cse30 .cse6 .cse7 .cse8 (and .cse31 .cse28 .cse29) .cse10 .cse12 .cse13 .cse23 .cse24 .cse25 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33) (or .cse2 .cse3 .cse4 .cse26 .cse30 .cse6 .cse7 .cse10 .cse11 .cse27 .cse12 .cse13 .cse24 .cse14 .cse32 .cse15 .cse34 .cse16 .cse17 .cse18 .cse19) (let ((.cse35 (+ ~local~0 1))) (or .cse2 .cse34 .cse3 .cse4 .cse26 .cse30 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (< ~token~0 .cse35) .cse13 .cse24 .cse32 .cse15 .cse16 .cse17 (< .cse35 ~token~0) .cse18 .cse19 .cse33)) (let ((.cse36 (+ ~local~0 2))) (or .cse2 .cse4 (< .cse36 ~token~0) .cse26 .cse30 .cse6 .cse7 .cse8 .cse11 .cse27 .cse12 .cse13 .cse24 .cse14 .cse32 (and .cse31 .cse28) .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse36))) (or .cse2 (and .cse0 .cse29) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse23 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-11-28 11:39:00,491 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-28 11:39:00,492 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse24 (= 1 ~t2_pc~0)) (.cse35 (= ~t1_pc~0 1)) (.cse31 (= 1 ~m_pc~0)) (.cse32 (<= 2 ~m_st~0)) (.cse30 (= activate_threads_~tmp___0~0 0)) (.cse29 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (<= 2 ~t2_st~0)) (.cse33 (= |old(~t1_st~0)| 0))) (let ((.cse28 (= 0 ~t2_st~0)) (.cse27 (= activate_threads_~tmp~1 0)) (.cse36 (not .cse33)) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse37 (= ~m_st~0 0)) (.cse4 (< |old(~m_st~0)| 2)) (.cse11 (and .cse32 .cse30 .cse29 .cse34)) (.cse15 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse21 (< ~local~0 ~token~0)) (.cse3 (not .cse35)) (.cse22 (< ~token~0 ~local~0)) (.cse13 (= 1 ~E_1~0)) (.cse26 (= 0 ~t1_st~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse23 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not .cse24)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse21 .cse3 .cse22 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse12 .cse24 .cse25 .cse14 (and .cse13 .cse26 .cse27 .cse28) (and .cse29 (and .cse30 .cse27 .cse28)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse2 .cse3 (and .cse32 .cse30 .cse29 .cse28) .cse4 .cse5 .cse6 .cse23 .cse7 .cse10 .cse12 .cse24 .cse13 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33) (or (and .cse30 .cse26 .cse27 .cse34) .cse0 .cse1 .cse2 .cse35 .cse5 .cse6 .cse23 .cse36 .cse7 .cse8 .cse10 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 (and .cse30 .cse26 .cse27 .cse28) .cse2 .cse35 .cse5 .cse6 .cse23 .cse36 .cse7 .cse10 .cse12 .cse24 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse27 .cse0 .cse1 .cse2 .cse21 .cse3 .cse22 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse2 .cse37 .cse21 .cse22 .cse35 .cse5 .cse6 .cse23 .cse36 .cse7 .cse10 (not (= 0 |old(~m_st~0)|)) .cse12 .cse24 .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (let ((.cse38 (+ ~local~0 2))) (or (and (and .cse32 .cse30) .cse29) .cse0 .cse2 (and .cse37 .cse30 .cse29 .cse7) (< .cse38 ~token~0) .cse3 .cse4 .cse5 .cse6 .cse23 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse38))) (let ((.cse39 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse11 .cse10 (< ~token~0 .cse39) .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (< .cse39 ~token~0) .cse19 .cse20 .cse33)) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse22 (and .cse13 .cse26 .cse34) .cse5 .cse6 .cse23 (and .cse34 .cse30 .cse29) .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-28 11:39:00,492 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-11-28 11:39:00,492 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse33 (= |old(~t1_st~0)| 0)) (.cse20 (= 1 ~m_pc~0)) (.cse25 (= 1 ~t2_pc~0)) (.cse5 (= ~t1_pc~0 1))) (let ((.cse21 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse1 (<= 2 ~t2_st~0)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse22 (not .cse5)) (.cse29 (< |old(~m_st~0)| 2)) (.cse11 (not .cse25)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse31 (= 1 ~E_1~0)) (.cse32 (not .cse20)) (.cse30 (<= 2 ~m_st~0)) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse2 (= ~T1_E~0 0)) (.cse0 (= 0 ~t1_st~0)) (.cse28 (= 0 ~t2_st~0)) (.cse4 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (not .cse33)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse4 .cse21 .cse22 .cse23 .cse6 .cse7 .cse8 .cse10 .cse24 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse27 .cse28) .cse20) (or .cse2 .cse3 .cse4 .cse21 .cse22 .cse23 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse12 (and .cse27 .cse1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse2 .cse4 .cse22 .cse29 .cse6 .cse7 .cse8 (and .cse30 .cse27 .cse28) .cse10 .cse12 .cse13 .cse25 .cse31 .cse26 .cse32 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33) (let ((.cse34 (+ ~local~0 1))) (or .cse2 (and .cse30 .cse27 .cse1) .cse3 .cse4 .cse22 .cse29 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (< ~token~0 .cse34) .cse13 .cse31 .cse32 .cse15 .cse16 .cse17 (< .cse34 ~token~0) .cse18 .cse19 .cse33)) (let ((.cse35 (+ ~local~0 2))) (or .cse2 .cse4 (< .cse35 ~token~0) .cse22 .cse29 .cse6 .cse7 .cse8 .cse11 .cse24 .cse12 .cse13 .cse31 .cse14 .cse32 (and .cse30 .cse27) .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse35))) (or .cse2 (and .cse0 .cse28) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-28 11:39:00,492 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-11-28 11:39:00,492 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse21 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse22 (< |old(~m_st~0)| 2)) (.cse23 (not .cse21)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse24 (not .cse4)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse20 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 (and (= ~t2_pc~0 1) (<= 2 ~m_st~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|)) .cse9 .cse25 .cse10 (< |old(~token~0)| .cse26) .cse12 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 (< .cse26 |old(~token~0)|) .cse19 .cse20)) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-28 11:39:00,493 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse18 (not (= 0 |old(~m_st~0)|))) (.cse1 (= ~m_st~0 0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse6 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 1)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse10 (not .cse29)) (.cse11 (< |old(~token~0)| ~local~0)) (.cse30 (< |old(~m_st~0)| 2)) (.cse12 (= ~T2_E~0 0)) (.cse33 (<= 2 ~m_st~0)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (= 1 ~t2_pc~0)) (.cse5 (= ~token~0 |old(~token~0)|)) (.cse34 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~t2_st~0)) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse17 (= ~T1_E~0 1)) (.cse19 (not (= ~m_i~0 1))) (.cse20 (= 1 |old(~t2_pc~0)|)) (.cse21 (= 1 ~E_1~0)) (.cse22 (= 1 ~E_2~0)) (.cse32 (not .cse28)) (.cse23 (= 0 ~E_1~0)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 |old(~E_M~0)|)) (.cse27 (= 0 ~E_2~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse8 .cse29 .cse30 .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 (and .cse33 .cse2 .cse3 .cse4 .cse34 .cse7) .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse8 .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse33 .cse2 .cse3 .cse4 .cse6 .cse7)) (or .cse0 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse34 .cse7) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse35 (= ~t2_pc~0 1)) (.cse37 (+ ~local~0 1))) (or .cse0 .cse8 (let ((.cse36 (+ ~local~0 2))) (and .cse35 .cse1 .cse2 .cse3 (<= ~token~0 .cse36) .cse6 .cse7 (<= .cse36 ~token~0))) .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~token~0)| .cse37) .cse19 .cse21 .cse22 .cse32 (and .cse35 .cse33 .cse2 .cse3 .cse6 .cse7) .cse23 .cse24 .cse25 (< .cse37 |old(~token~0)|) .cse26 .cse27)) (or .cse0 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 (and .cse33 .cse2 .cse3 .cse4 .cse5 .cse34 .cse7) .cse13 .cse14 .cse31 .cse15 .cse17 .cse19 .cse20 .cse21 .cse22 .cse32 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2018-11-28 11:39:00,493 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-11-28 11:39:00,493 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse21 (= 1 ~m_pc~0))) (let ((.cse8 (not (= |old(~t1_st~0)| 0))) (.cse22 (< |old(~m_st~0)| 2)) (.cse23 (not .cse21)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse24 (not .cse4)) (.cse3 (< |old(~token~0)| ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse20 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse26 (+ ~local~0 1))) (or .cse0 .cse1 .cse24 .cse22 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 (< |old(~token~0)| .cse26) .cse12 .cse14 .cse15 .cse23 (let ((.cse27 (+ ~local~0 2))) (and (= ~t2_pc~0 1) (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse27) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse27 ~token~0))) .cse16 .cse17 .cse18 (< .cse26 |old(~token~0)|) .cse19 .cse20)) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-11-28 11:39:00,493 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse34 (= ~t1_pc~0 1)) (.cse36 (= 1 ~m_pc~0))) (let ((.cse3 (< |old(~m_st~0)| 2)) (.cse21 (not .cse36)) (.cse23 (<= 2 ~m_st~0)) (.cse2 (not .cse34)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse12 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse13 (= 1 |old(~E_M~0)|)) (.cse16 (= ~T1_E~0 1)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse18 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~t2_pc~0)|)) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 1 ~E_2~0)) (.cse22 (= 0 ~E_1~0)) (.cse8 (= ~m_st~0 0)) (.cse9 (not (= ~E_M~0 0))) (.cse30 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse10 (not (= ~E_M~0 1))) (.cse31 (= ~token~0 |old(~token~0)|)) (.cse32 (= 0 ~t1_st~0)) (.cse24 (not (= 1 ~t1_i~0))) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 |old(~E_M~0)|)) (.cse27 (= 0 ~E_2~0))) (and (let ((.cse7 (= ~t2_pc~0 1)) (.cse17 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse11 (+ ~local~0 2))) (and .cse7 .cse8 .cse9 .cse10 (<= ~token~0 .cse11) .cse12 (<= .cse11 ~token~0))) .cse13 (not .cse14) .cse15 .cse16 (< |old(~token~0)| .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse7 .cse23 .cse9 .cse10 .cse12) .cse24 .cse25 (< .cse17 |old(~token~0)|) .cse26 .cse27)) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse3 .cse4 .cse5 (and .cse23 .cse9 .cse30 .cse10 .cse31 .cse32) .cse6 .cse33 .cse13 .cse16 .cse18 .cse14 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse23 .cse9 .cse30 .cse10 .cse12) .cse5 .cse6 .cse13 .cse15 .cse16 .cse18 .cse14 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse34 .cse3 .cse4 .cse5 .cse6 .cse33 .cse13 .cse16 .cse18 .cse14 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 (and .cse23 .cse9 .cse30 .cse10 .cse32)) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse13 .cse15 .cse16 .cse35 .cse18 .cse14 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 (and .cse8 .cse9 .cse30 .cse10 .cse31 .cse12) .cse36) (or .cse0 .cse1 .cse28 .cse29 .cse34 .cse4 .cse5 .cse6 .cse33 .cse13 .cse16 .cse35 .cse18 .cse14 .cse19 .cse20 .cse22 (and .cse8 .cse9 .cse30 .cse10 .cse31 .cse32) .cse24 .cse25 .cse26 .cse27 .cse36)))) [2018-11-28 11:39:00,494 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse30 (= ~t1_pc~0 1)) (.cse33 (= 1 ~m_pc~0))) (let ((.cse31 (not (= |old(~t1_st~0)| 0))) (.cse27 (= 0 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse3 (< |old(~m_st~0)| 2)) (.cse19 (not .cse33)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 |old(~token~0)|)) (.cse2 (not .cse30)) (.cse29 (< |old(~token~0)| ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse14 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse16 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~t2_pc~0)|)) (.cse17 (= 1 ~E_1~0)) (.cse18 (= 1 ~E_2~0)) (.cse20 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse25 (= ~m_st~0 0)) (.cse26 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~0)|)) (.cse24 (= 0 ~E_2~0))) (and (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10) .cse11 (not .cse12) .cse13 .cse14 (< |old(~token~0)| .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (< .cse15 |old(~token~0)|) .cse23 .cse24)) (or (and .cse25 .cse26 .cse8 .cse9 .cse27) .cse0 .cse1 .cse28 .cse29 .cse30 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse32 .cse16 .cse12 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse33) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse7 .cse26 .cse8 .cse27)) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse31 .cse11 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse7 .cse26 .cse8 .cse9 .cse27)) (or (and .cse7 .cse26 .cse8 .cse10) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse13 .cse14 .cse16 .cse12 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse28 .cse2 .cse29 .cse4 .cse5 .cse6 .cse11 .cse13 .cse14 .cse32 .cse16 .cse12 .cse17 .cse18 .cse20 .cse21 (and .cse25 .cse26 .cse8 .cse9 .cse10) .cse22 .cse23 .cse24 .cse33)))) [2018-11-28 11:39:00,494 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-11-28 11:39:00,494 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-11-28 11:39:00,495 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-11-28 11:39:00,495 INFO L444 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse24 (not .cse2)) (.cse26 (< ~t1_st~0 2)) (.cse22 (< ~t2_st~0 2)) (.cse3 (< ~m_st~0 2)) (.cse25 (not .cse11)) (.cse15 (not .cse30)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse28 (< ~local~0 ~token~0)) (.cse16 (= exists_runnable_thread_~__retres1~3 1)) (.cse29 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= ~t1_st~0 0))) (.cse8 (= 1 ~E_M~0)) (.cse9 (= ~T1_E~0 1)) (.cse27 (not (= 0 ~m_st~0))) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (not (= 0 ~t2_st~0))) (.cse14 (= 1 ~E_2~0)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse23 (+ ~local~0 2))) (or .cse0 .cse22 .cse1 (< .cse23 ~token~0) .cse24 .cse4 .cse5 .cse6 .cse8 .cse25 .cse26 .cse9 .cse27 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse23))) (or .cse0 .cse22 .cse1 .cse28 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse16) (or .cse0 .cse1 .cse28 .cse29 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse28 .cse24 .cse29 .cse16 .cse4 .cse5 .cse6 .cse8 .cse26 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse8 .cse26 .cse9 (< ~token~0 .cse31) .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse16 .cse19 (< .cse31 ~token~0) .cse20 .cse21)) (or .cse0 .cse22 .cse1 .cse28 .cse24 .cse29 .cse4 .cse5 .cse6 .cse8 .cse25 .cse26 .cse9 .cse27 .cse10 .cse12 .cse14 .cse17 .cse18 .cse16 .cse19 .cse20 .cse21 .cse30) (or .cse0 .cse1 .cse24 .cse3 .cse4 .cse5 .cse6 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse16) (or .cse0 .cse22 .cse1 .cse28 .cse29 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse27 .cse10 .cse12 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse16 .cse30) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse25 .cse9 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse28 .cse16 .cse29 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30)))) [2018-11-28 11:39:00,495 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-11-28 11:39:00,495 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-11-28 11:39:00,495 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse11 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse9 (= 1 ~t2_pc~0)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse18 (= 1 ~m_pc~0)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11 (not (= 0 ~t2_st~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse11 (< ~t2_st~0 2) .cse1 (not .cse2) (< ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 (not .cse9) (< ~t1_st~0 2) .cse7 .cse8 .cse10 .cse12 (not .cse18) .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-11-28 11:39:00,495 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-11-28 11:39:00,496 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse31 (= 1 ~m_pc~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse26 (= ~t1_st~0 0))) (let ((.cse1 (< ~t2_st~0 2)) (.cse30 (not .cse26)) (.cse22 (< ~m_st~0 2)) (.cse10 (not .cse23)) (.cse25 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse21 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 ~token~0)) (.cse4 (not .cse29)) (.cse5 (< ~token~0 ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (< ~t1_st~0 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse24 (not (= 0 ~t2_st~0))) (.cse15 (= 1 ~E_2~0)) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0)) (.cse14 (= 1 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse23 .cse14 .cse21 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26) (let ((.cse27 (+ ~local~0 2))) (or (not .cse9) .cse0 .cse2 .cse21 (< .cse27 ~token~0) .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (not (= 0 ~m_st~0)) .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse20 (< ~token~0 .cse27))) (let ((.cse28 (+ ~local~0 1))) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (< ~token~0 .cse28) .cse13 .cse14 .cse25 .cse16 .cse17 .cse18 (< .cse28 ~token~0) .cse19 .cse20 .cse26)) (or .cse0 .cse1 .cse2 .cse29 .cse21 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse1 .cse2 .cse4 .cse22 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse2 .cse29 .cse6 .cse7 .cse8 .cse30 .cse9 .cse12 .cse13 .cse23 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse11 (or .cse0 .cse2 .cse4 .cse22 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21) (or .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse14 .cse31)))) [2018-11-28 11:39:00,496 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-11-28 11:39:00,496 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 ~E_2~0) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-11-28 11:39:00,497 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,498 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= ~t1_i~0 1) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,498 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,498 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-11-28 11:39:00,498 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-11-28 11:39:00,498 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-28 11:39:00,498 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-28 11:39:00,498 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-28 11:39:00,498 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-28 11:39:00,499 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-11-28 11:39:00,499 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-28 11:39:00,499 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse10 (= 1 ~t2_pc~0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse26 (< |old(~local~0)| |old(~token~0)|)) (.cse22 (not .cse2)) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse23 (not .cse10)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse21 (+ |old(~local~0)| 2))) (or .cse0 .cse20 .cse1 (< .cse21 |old(~token~0)|) .cse22 .cse3 .cse4 .cse5 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse13 (not .cse19) .cse14 .cse15 (let ((.cse25 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse25) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse25 ~token~0))) .cse16 .cse17 .cse18 (< |old(~token~0)| .cse21))) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse26 .cse22 .cse27 .cse3 .cse4 .cse5 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse26 .cse22 .cse27 .cse3 .cse4 .cse5 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-11-28 11:39:00,499 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0))) (let ((.cse12 (= 1 ~t2_pc~0)) (.cse27 (<= ~token~0 ~local~0)) (.cse28 (= 0 ~t1_st~0)) (.cse29 (<= ~local~0 ~token~0)) (.cse39 (= 1 ~t1_pc~0)) (.cse40 (not .cse5)) (.cse41 (not .cse1)) (.cse16 (<= 2 ~m_st~0)) (.cse17 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse18 (not (= ~E_1~0 1))) (.cse35 (<= 2 ~t2_st~0)) (.cse42 (not .cse0)) (.cse20 (= 1 ~m_pc~0)) (.cse21 (not (= ~E_1~0 0))) (.cse32 (= ~t1_pc~0 1))) (let ((.cse33 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse19 (= 0 ~t2_st~0)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (< |old(~token~0)| |old(~local~0)|)) (.cse31 (< |old(~t2_st~0)| 2)) (.cse3 (not .cse32)) (.cse36 (and .cse39 .cse40 .cse41 .cse16 .cse17 .cse18 .cse35 .cse42 .cse20 .cse21)) (.cse37 (and .cse39 .cse40 .cse41 .cse16 .cse27 .cse28 .cse18 .cse35 .cse42 .cse20 .cse21 .cse29)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse34 (not .cse12)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse15 (= 1 ~E_2~0)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse16 .cse27 .cse28 .cse18 .cse19 .cse20 .cse21 .cse29) .cse30) (or .cse0 .cse31 .cse1 .cse32 .cse5 .cse6 .cse7 .cse33 .cse8 .cse34 .cse10 .cse11 .cse13 (and .cse16 .cse28 .cse18 .cse35 .cse20 .cse21) .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse30) (or .cse0 .cse1 .cse32 .cse5 .cse6 .cse7 .cse33 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse16 .cse28 .cse18 .cse19 .cse20 .cse21) .cse30) (or .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse36 .cse37 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse13 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse30) (let ((.cse38 (+ |old(~local~0)| 2))) (or .cse0 .cse31 .cse1 (< .cse38 |old(~token~0)|) .cse3 .cse5 .cse36 .cse37 .cse6 .cse7 .cse8 .cse34 .cse9 .cse10 .cse11 .cse13 .cse15 (not .cse30) .cse22 .cse23 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse38))))))) [2018-11-28 11:39:00,500 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse10 (= 1 ~t2_pc~0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse6 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= 0 |old(~t2_st~0)|))) (.cse22 (< |old(~local~0)| |old(~token~0)|)) (.cse24 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse23 (not .cse2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse21 (not .cse10)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse5 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse22 .cse23 .cse24 .cse3 .cse4 .cse5 .cse7 .cse21 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse26 (+ |old(~local~0)| 2))) (or .cse0 .cse20 .cse1 (< .cse26 |old(~token~0)|) .cse23 .cse3 .cse4 .cse5 .cse7 .cse21 .cse25 .cse8 .cse9 .cse11 .cse13 (not .cse19) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse26)))))) [2018-11-28 11:39:00,500 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse31 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t1_st~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse9 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse33 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse29)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse26 (not (= ~m_pc~0 1))) (.cse35 (<= ~token~0 ~local~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (= 0 ~t2_st~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 (let ((.cse19 (+ ~local~0 2))) (and .cse18 (<= ~token~0 .cse19) .cse20 .cse21 .cse22 (= 1 ~m_pc~0) (<= .cse19 ~token~0))) .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or .cse0 .cse2 (and .cse18 .cse26 .cse27 .cse28) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 (and .cse18 .cse26 .cse27 .cse22) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 .cse33 .cse4 .cse34 .cse5 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse22 .cse36) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse2 .cse33 .cse4 .cse34 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse28 .cse36) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15)))) [2018-11-28 11:39:00,500 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse30 (= 1 ~t2_pc~0)) (.cse33 (= ~t1_pc~0 1))) (let ((.cse28 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse33)) (.cse29 (< |old(~token~0)| |old(~local~0)|)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse16 (<= ~local~0 ~token~0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (not .cse30)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse31 (not (= 0 |old(~t2_st~0)|))) (.cse26 (not (= ~m_pc~0 1))) (.cse32 (= 0 ~t1_st~0)) (.cse27 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_1~0 0))) (.cse19 (= 1 ~E_2~0)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse20 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 (= 1 ~m_pc~0) .cse15 .cse16) .cse17 .cse18 .cse19 (not .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or (and .cse26 .cse12 .cse13 .cse27 .cse15 .cse16) .cse0 .cse2 .cse28 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse17 .cse30 .cse18 .cse31 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse1 .cse2 .cse28 .cse4 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18 .cse19 (and .cse26 .cse12 .cse13 .cse14 .cse15 .cse16) .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse1 .cse2 (and .cse26 .cse32 .cse14 .cse15) .cse33 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse11 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20) (or .cse0 .cse2 .cse33 .cse5 .cse6 .cse7 .cse34 .cse8 .cse11 .cse17 .cse30 .cse18 .cse31 (and .cse26 .cse32 .cse27 .cse15) .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse20)))) [2018-11-28 11:39:00,500 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-28 11:39:00,501 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-28 11:39:00,501 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse29 (= ~t1_pc~0 1)) (.cse31 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t1_st~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse1 (< |old(~t2_st~0)| 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse9 (not .cse31)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse33 (< |old(~local~0)| |old(~token~0)|)) (.cse4 (not .cse29)) (.cse34 (< |old(~token~0)| |old(~local~0)|)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse26 (not (= ~m_pc~0 1))) (.cse35 (<= ~token~0 ~local~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (= 0 ~t2_st~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse14 (= 1 ~E_2~0)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse3 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 (let ((.cse19 (+ ~local~0 2))) (and .cse18 (<= ~token~0 .cse19) .cse20 .cse21 .cse22 (= 1 ~m_pc~0) (<= .cse19 ~token~0))) .cse23 .cse24 .cse25 (< |old(~token~0)| .cse3))) (or .cse0 .cse2 (and .cse18 .cse26 .cse27 .cse28) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 (and .cse18 .cse26 .cse27 .cse22) .cse29 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse1 .cse2 .cse33 .cse4 .cse34 .cse5 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse22 .cse36) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse2 .cse33 .cse4 .cse34 (and .cse18 .cse26 .cse35 .cse20 .cse21 .cse28 .cse36) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse31 .cse13 .cse32 .cse14 .cse16 .cse17 .cse23 .cse24 .cse25 .cse15)))) [2018-11-28 11:39:00,503 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-11-28 11:39:00,503 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (or (= ~T1_E~0 0) (= |old(~M_E~0)| ~M_E~0) (< ~t2_st~0 2) (= ~T2_E~0 1) (not (= ~t1_pc~0 1)) (< ~m_st~0 2) (= ~T2_E~0 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= 1 ~E_M~0) (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) (= ~T1_E~0 1) (not (= ~m_i~0 1)) (= 1 ~E_1~0) (= 1 ~E_2~0) (not (= 1 ~m_pc~0)) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0)) [2018-11-28 11:39:00,503 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-11-28 11:39:00,503 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:39:00,503 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) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-28 11:39:00,503 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:39:00,503 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-11-28 11:39:00,504 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-11-28 11:39:00,504 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-28 11:39:00,505 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-11-28 11:39:00,505 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-11-28 11:39:00,505 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-11-28 11:39:00,505 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-11-28 11:39:00,506 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse17 (= 0 |old(~E_2~0)|)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse12 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse2) (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 (not .cse7) (< |old(~t1_st~0)| 2) .cse8 .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse23 (not (= ~E_2~0 1))) (.cse27 (= 1 ~t1_pc~0)) (.cse30 (not (= ~E_2~0 0))) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= 2 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (<= 2 ~t2_st~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse25 (= |old(~E_1~0)| ~E_1~0)) (.cse36 (not (= ~t1_pc~0 1))) (.cse28 (not (= ~E_M~0 0))) (.cse29 (not (= ~m_pc~0 1))) (.cse33 (= 0 ~t2_st~0)) (.cse31 (not (= ~E_M~0 1))) (.cse35 (= |old(~E_2~0)| ~E_2~0)) (.cse26 (= eval_~tmp~0 1)) (.cse34 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (and .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse27 .cse28 .cse29 .cse30 .cse31))) .cse0 .cse1 (< |old(~local~0)| |old(~token~0)|) .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse7 .cse10 .cse11 .cse14 .cse17 (< |old(~token~0)| |old(~local~0)|) .cse2 (let ((.cse32 (+ ~local~0 2))) (and .cse22 .cse23 .cse24 .cse20 (<= .cse32 ~token~0) .cse26 (and (and .cse27 .cse28 (= 1 ~m_pc~0) (not (= ~E_1~0 0)) .cse30 .cse31) (not (= ~E_1~0 1))) (<= ~token~0 .cse32))) .cse6 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 (and (and .cse23 .cse25 (and .cse27 .cse28 .cse29 .cse33 .cse30 .cse31) .cse26 .cse34) .cse18 .cse19 .cse20 .cse21) (not (= 0 |old(~t2_st~0)|)) (and .cse22 .cse24 .cse25 .cse35 (= 0 ~t1_st~0) .cse26 (and .cse36 .cse28 .cse29 .cse31)) .cse13 .cse15 .cse16 (and .cse25 (and .cse36 .cse28 .cse29 .cse33 .cse31) .cse35 (= ~t1_st~0 |old(~t1_st~0)|) .cse26 .cse34) .cse12)))) [2018-11-28 11:39:00,506 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-11-28 11:39:00,506 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-11-28 11:39:00,506 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-11-28 11:39:00,506 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse14 (= ~T1_E~0 0)) (.cse19 (= ~T2_E~0 1)) (.cse26 (= ~T2_E~0 0))) (let ((.cse20 (= 1 ~t1_pc~0)) (.cse42 (= ~T1_E~0 1)) (.cse48 (not .cse26)) (.cse49 (not .cse19)) (.cse34 (<= 2 ~m_st~0)) (.cse50 (not (= ~M_E~0 0))) (.cse51 (= ~t1_i~0 1)) (.cse8 (not (= ~E_M~0 0))) (.cse52 (not .cse14)) (.cse53 (not (= ~M_E~0 1))) (.cse21 (= 1 ~m_pc~0)) (.cse22 (not (= ~E_1~0 0))) (.cse23 (not (= ~E_2~0 0))) (.cse10 (not (= ~E_M~0 1))) (.cse54 (= ~m_i~0 1))) (let ((.cse39 (= |old(~t1_pc~0)| 1)) (.cse27 (= 0 ~M_E~0)) (.cse28 (= 1 ~M_E~0)) (.cse41 (= 1 |old(~E_M~0)|)) (.cse29 (= 1 |old(~t2_pc~0)|)) (.cse43 (not .cse54)) (.cse30 (= 1 |old(~E_1~0)|)) (.cse31 (= 1 |old(~E_2~0)|)) (.cse47 (= 1 |old(~m_pc~0)|)) (.cse44 (= 0 |old(~E_1~0)|)) (.cse32 (not (= 1 ~t1_i~0))) (.cse5 (<= 2 ~t2_st~0)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse17 (and .cse20 (not .cse42) .cse48 .cse49 .cse54 .cse34 .cse50 .cse51 .cse8 .cse52 .cse53 .cse21 .cse22 .cse23 .cse10)) (.cse40 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse45 (not (= 1 ~t2_i~0))) (.cse46 (= 0 |old(~E_M~0)|)) (.cse33 (= 0 |old(~E_2~0)|))) (and (let ((.cse37 (= 0 ~t2_st~0))) (let ((.cse0 (= 1 ~t2_pc~0)) (.cse18 (not (= 0 eval_~tmp~0))) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (= ~m_st~0 0)) (.cse9 (not (= ~m_pc~0 1))) (.cse24 (<= 2 ~t1_st~0)) (.cse15 (not (= ~E_2~0 1))) (.cse36 (and .cse20 .cse48 .cse49 .cse34 .cse50 .cse51 .cse8 .cse37 .cse52 .cse53 .cse21 .cse22 .cse23 .cse10)) (.cse16 (not (= ~E_1~0 1))) (.cse11 (<= ~token~0 ~local~0)) (.cse4 (= 0 ~t1_st~0)) (.cse12 (= eval_~tmp~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse38 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) .cse14 (and .cse11 .cse4 (and .cse5 .cse0 (and .cse15 .cse16 .cse17) .cse18) .cse13) .cse19 (< |old(~local~0)| |old(~token~0)|) (let ((.cse25 (+ ~local~0 2))) (and (and .cse20 .cse0 .cse7 .cse8 .cse16 .cse5 .cse15 .cse21 .cse22 .cse18 .cse23 .cse10) .cse24 (<= .cse25 ~token~0) (<= ~token~0 .cse25))) .cse26 (and (and .cse5 .cse15 .cse0 .cse16 .cse18 .cse17) .cse24) .cse27 .cse28 (not (= |old(~t1_st~0)| 0)) (and .cse2 .cse11 .cse24 .cse13 (and .cse5 .cse15 .cse0 .cse1 (and .cse20 .cse7 .cse8 .cse9 .cse23 .cse10) .cse12)) .cse29 .cse30 .cse31 .cse32 .cse33 (and .cse5 .cse0 .cse3 .cse4 .cse12 .cse16 (and .cse6 .cse34 .cse8 .cse21 .cse22 .cse10)) (let ((.cse35 (+ ~local~0 1))) (and (<= ~token~0 .cse35) (and .cse15 .cse0 .cse36 .cse16 .cse18) (<= .cse35 ~token~0) .cse24)) (and .cse2 .cse11 .cse24 (and .cse15 .cse1 (and .cse20 .cse7 .cse8 .cse9 .cse37 .cse23 .cse10) .cse12 .cse38) .cse13) (< |old(~token~0)| |old(~local~0)|) .cse39 (and (and .cse6 .cse34 .cse8 .cse37 .cse21 .cse22 .cse10) .cse3 .cse40 .cse12 .cse16 .cse38) (and .cse2 .cse11 .cse4 (and .cse1 .cse3 (and .cse6 .cse7 .cse8 .cse9 .cse37 .cse10) .cse38) .cse13) (and (and .cse15 .cse36 .cse12 .cse16 .cse38) .cse24) (and (and .cse15 .cse36 .cse16) .cse11 .cse4 .cse12 .cse13 .cse38) .cse41 .cse42 (not (= 0 |old(~m_st~0)|)) .cse43 (not (= 0 |old(~t2_st~0)|)) .cse44 .cse45 .cse46 .cse47))) (or .cse14 (< |old(~t2_st~0)| 2) .cse19 (not .cse39) (< |old(~m_st~0)| 2) .cse26 .cse27 .cse28 .cse41 (not .cse29) (< |old(~t1_st~0)| 2) .cse42 .cse43 .cse30 .cse31 (not .cse47) .cse44 .cse32 (and (and .cse5 .cse1 (= ~t2_pc~0 1) .cse3 .cse17) .cse40) .cse45 .cse46 .cse33))))) [2018-11-28 11:39:00,507 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-28 11:39:00,507 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-11-28 11:39:00,507 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse14 (= ~T1_E~0 0)) (.cse19 (= ~T2_E~0 1)) (.cse26 (= ~T2_E~0 0))) (let ((.cse20 (= 1 ~t1_pc~0)) (.cse42 (= ~T1_E~0 1)) (.cse48 (not .cse26)) (.cse49 (not .cse19)) (.cse34 (<= 2 ~m_st~0)) (.cse50 (not (= ~M_E~0 0))) (.cse51 (= ~t1_i~0 1)) (.cse8 (not (= ~E_M~0 0))) (.cse52 (not .cse14)) (.cse53 (not (= ~M_E~0 1))) (.cse21 (= 1 ~m_pc~0)) (.cse22 (not (= ~E_1~0 0))) (.cse23 (not (= ~E_2~0 0))) (.cse10 (not (= ~E_M~0 1))) (.cse54 (= ~m_i~0 1))) (let ((.cse39 (= |old(~t1_pc~0)| 1)) (.cse27 (= 0 ~M_E~0)) (.cse28 (= 1 ~M_E~0)) (.cse41 (= 1 |old(~E_M~0)|)) (.cse29 (= 1 |old(~t2_pc~0)|)) (.cse43 (not .cse54)) (.cse30 (= 1 |old(~E_1~0)|)) (.cse31 (= 1 |old(~E_2~0)|)) (.cse47 (= 1 |old(~m_pc~0)|)) (.cse44 (= 0 |old(~E_1~0)|)) (.cse32 (not (= 1 ~t1_i~0))) (.cse5 (<= 2 ~t2_st~0)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse17 (and .cse20 (not .cse42) .cse48 .cse49 .cse54 .cse34 .cse50 .cse51 .cse8 .cse52 .cse53 .cse21 .cse22 .cse23 .cse10)) (.cse40 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse45 (not (= 1 ~t2_i~0))) (.cse46 (= 0 |old(~E_M~0)|)) (.cse33 (= 0 |old(~E_2~0)|))) (and (let ((.cse37 (= 0 ~t2_st~0))) (let ((.cse0 (= 1 ~t2_pc~0)) (.cse18 (not (= 0 eval_~tmp~0))) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (= ~m_st~0 0)) (.cse9 (not (= ~m_pc~0 1))) (.cse24 (<= 2 ~t1_st~0)) (.cse15 (not (= ~E_2~0 1))) (.cse36 (and .cse20 .cse48 .cse49 .cse34 .cse50 .cse51 .cse8 .cse37 .cse52 .cse53 .cse21 .cse22 .cse23 .cse10)) (.cse16 (not (= ~E_1~0 1))) (.cse11 (<= ~token~0 ~local~0)) (.cse4 (= 0 ~t1_st~0)) (.cse12 (= eval_~tmp~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse38 (= |old(~t2_pc~0)| ~t2_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) .cse14 (and .cse11 .cse4 (and .cse5 .cse0 (and .cse15 .cse16 .cse17) .cse18) .cse13) .cse19 (< |old(~local~0)| |old(~token~0)|) (let ((.cse25 (+ ~local~0 2))) (and (and .cse20 .cse0 .cse7 .cse8 .cse16 .cse5 .cse15 .cse21 .cse22 .cse18 .cse23 .cse10) .cse24 (<= .cse25 ~token~0) (<= ~token~0 .cse25))) .cse26 (and (and .cse5 .cse15 .cse0 .cse16 .cse18 .cse17) .cse24) .cse27 .cse28 (not (= |old(~t1_st~0)| 0)) (and .cse2 .cse11 .cse24 .cse13 (and .cse5 .cse15 .cse0 .cse1 (and .cse20 .cse7 .cse8 .cse9 .cse23 .cse10) .cse12)) .cse29 .cse30 .cse31 .cse32 .cse33 (and .cse5 .cse0 .cse3 .cse4 .cse12 .cse16 (and .cse6 .cse34 .cse8 .cse21 .cse22 .cse10)) (let ((.cse35 (+ ~local~0 1))) (and (<= ~token~0 .cse35) (and .cse15 .cse0 .cse36 .cse16 .cse18) (<= .cse35 ~token~0) .cse24)) (and .cse2 .cse11 .cse24 (and .cse15 .cse1 (and .cse20 .cse7 .cse8 .cse9 .cse37 .cse23 .cse10) .cse12 .cse38) .cse13) (< |old(~token~0)| |old(~local~0)|) .cse39 (and (and .cse6 .cse34 .cse8 .cse37 .cse21 .cse22 .cse10) .cse3 .cse40 .cse12 .cse16 .cse38) (and .cse2 .cse11 .cse4 (and .cse1 .cse3 (and .cse6 .cse7 .cse8 .cse9 .cse37 .cse10) .cse38) .cse13) (and (and .cse15 .cse36 .cse12 .cse16 .cse38) .cse24) (and (and .cse15 .cse36 .cse16) .cse11 .cse4 .cse12 .cse13 .cse38) .cse41 .cse42 (not (= 0 |old(~m_st~0)|)) .cse43 (not (= 0 |old(~t2_st~0)|)) .cse44 .cse45 .cse46 .cse47))) (or .cse14 (< |old(~t2_st~0)| 2) .cse19 (not .cse39) (< |old(~m_st~0)| 2) .cse26 .cse27 .cse28 .cse41 (not .cse29) (< |old(~t1_st~0)| 2) .cse42 .cse43 .cse30 .cse31 (not .cse47) .cse44 .cse32 (and (and .cse5 .cse1 (= ~t2_pc~0 1) .cse3 .cse17) .cse40) .cse45 .cse46 .cse33))))) [2018-11-28 11:39:00,509 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse17 (= 0 |old(~E_2~0)|)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (= ~T1_E~0 1)) (.cse9 (not (= ~m_i~0 1))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse12 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse2) (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 (not .cse7) (< |old(~t1_st~0)| 2) .cse8 .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse33 (not (= ~E_2~0 1))) (.cse34 (= 1 ~t1_pc~0)) (.cse19 (<= 2 ~m_st~0)) (.cse22 (= 1 ~m_pc~0)) (.cse23 (not (= ~E_1~0 0))) (.cse35 (not (= ~E_2~0 0))) (.cse26 (not (= ~E_1~0 1))) (.cse31 (= 1 ~t2_pc~0)) (.cse30 (<= 2 ~t2_st~0)) (.cse38 (= |old(~E_1~0)| ~E_1~0)) (.cse39 (= ~token~0 |old(~token~0)|)) (.cse18 (= |old(~E_2~0)| ~E_2~0)) (.cse32 (not (= ~t1_pc~0 1))) (.cse40 (= ~m_st~0 0)) (.cse20 (not (= ~E_M~0 0))) (.cse41 (not (= ~m_pc~0 1))) (.cse21 (= 0 ~t2_st~0)) (.cse24 (not (= ~E_M~0 1))) (.cse36 (<= ~token~0 ~local~0)) (.cse25 (= eval_~tmp~0 1)) (.cse27 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse37 (<= ~local~0 ~token~0)) (.cse28 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse29 (not (= ~t1_st~0 0)))) (or .cse0 (and .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse31 .cse18 .cse25 .cse26 .cse27 (and .cse32 .cse19 .cse20 .cse22 .cse23 .cse24) .cse29) (and (and .cse30 .cse31 (not (= 0 eval_~tmp~0)) (and .cse33 .cse26 (and .cse34 .cse19 .cse20 .cse22 .cse23 .cse35 .cse24))) .cse36 .cse37 .cse29) .cse1 (< |old(~local~0)| |old(~token~0)|) (and (and .cse33 (and .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse35 .cse24) .cse26) .cse25 .cse28 .cse29) .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse7 .cse10 .cse11 .cse14 .cse17 (< |old(~token~0)| |old(~local~0)|) (and .cse31 .cse38 .cse39 .cse18 .cse30 (and .cse32 .cse40 .cse20 .cse41 .cse24) .cse36 .cse25 .cse27 .cse37 .cse29) .cse2 .cse6 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 (not (= 0 |old(~t2_st~0)|)) (and .cse38 .cse39 .cse18 (and .cse32 .cse40 .cse20 .cse41 .cse21 .cse24) .cse36 .cse25 .cse27 .cse37 .cse28 .cse29) .cse13 .cse15 .cse16 .cse12)))) [2018-11-28 11:39:00,511 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 1)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse13 (= 1 |old(~E_1~0)|)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (= |old(~E_M~0)| ~E_M~0)) (.cse3 (= |old(~E_2~0)| ~E_2~0)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|)) (.cse20 (= 0 |old(~E_2~0)|)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and (= 1 ~t1_pc~0) .cse1 (= ~t2_pc~0 1) (<= 2 ~m_st~0) .cse2 .cse3 (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0)) (< |old(~t2_st~0)| 2) .cse4 (not .cse5) (< |old(~m_st~0)| 2) .cse6 .cse7 .cse8 .cse9 (not .cse10) (< |old(~t1_st~0)| 2) .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse4 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse5 .cse6 .cse7 .cse8 (not (= |old(~t1_st~0)| 0)) .cse9 .cse11 (not (= 0 |old(~m_st~0)|)) .cse12 .cse10 .cse13 (and (not (= ~t1_pc~0 1)) .cse1 (= ~m_st~0 0) (not (= ~m_pc~0 1)) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) .cse2 (= ~token~0 |old(~token~0)|) .cse3 (= 0 ~t1_st~0) (= 0 ~t2_st~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse15))) [2018-11-28 11:39:00,511 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-11-28 11:39:00,512 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-11-28 11:39:00,512 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse41 (= ~m_i~0 1))) (let ((.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse17 (= 0 |old(~E_2~0)|)) (.cse2 (= |old(~t1_pc~0)| 1)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse9 (not .cse41)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse12 (= 1 |old(~m_pc~0)|)) (.cse8 (= ~T1_E~0 1)) (.cse3 (= ~T2_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse0 (= ~T1_E~0 0))) (and (or .cse0 (< |old(~t2_st~0)| 2) .cse1 (not .cse2) (< |old(~m_st~0)| 2) .cse3 .cse4 .cse5 .cse6 (not .cse7) (< |old(~t1_st~0)| 2) .cse8 .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse34 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~m_st~0)) (.cse24 (not (= ~E_M~0 0))) (.cse25 (= 1 ~m_pc~0)) (.cse26 (not (= ~E_1~0 0))) (.cse37 (not (= ~E_2~0 0))) (.cse27 (not (= ~E_M~0 1)))) (let ((.cse33 (= |old(~E_1~0)| ~E_1~0)) (.cse38 (= ~token~0 |old(~token~0)|)) (.cse18 (= |old(~E_2~0)| ~E_2~0)) (.cse19 (= 0 ~t1_st~0)) (.cse22 (not (= ~t1_pc~0 1))) (.cse35 (= ~m_st~0 0)) (.cse36 (not (= ~m_pc~0 1))) (.cse31 (<= ~token~0 ~local~0)) (.cse32 (<= ~local~0 ~token~0)) (.cse20 (= eval_~tmp~0 1)) (.cse28 (= |old(~t2_pc~0)| ~t2_pc~0)) (.cse39 (<= 2 ~t1_st~0)) (.cse29 (not (= ~E_2~0 1))) (.cse21 (not (= ~E_1~0 1))) (.cse30 (and .cse34 (not .cse8) (not .cse3) (not .cse1) .cse41 .cse23 (not (= ~M_E~0 0)) (= ~t1_i~0 1) .cse24 (not .cse0) (not (= ~M_E~0 1)) .cse25 .cse26 .cse37 .cse27))) (or .cse0 (and .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28) .cse1 (< |old(~local~0)| |old(~token~0)|) (and (and .cse29 .cse21 .cse30) .cse31 .cse19 .cse20 .cse32 .cse28) .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse7 .cse10 .cse11 .cse14 .cse17 (and (and .cse29 .cse33 (and .cse34 .cse35 .cse24 .cse36 .cse37 .cse27) .cse20 .cse28) .cse38 .cse31 .cse39 .cse32) (and .cse33 .cse38 .cse18 .cse19 (and .cse22 .cse35 .cse24 .cse36 .cse27) .cse31 .cse20 .cse32 .cse28) (< |old(~token~0)| |old(~local~0)|) .cse2 (and (and .cse29 .cse20 .cse21 .cse28 .cse30) .cse39) .cse6 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 (not (= 0 |old(~t2_st~0)|)) (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) (<= .cse40 ~token~0) .cse39 (and .cse29 (= 1 ~t2_pc~0) .cse21 (not (= 0 eval_~tmp~0)) .cse30))) .cse13 .cse15 .cse16 .cse12)))))) [2018-11-28 11:39:00,512 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-28 11:39:00,513 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-11-28 11:39:00,513 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse3 (= ~T2_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse1 (<= 2 ~t2_st~0)) (.cse2 (and (= 1 ~t1_pc~0) (not .cse3) (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (not .cse0) (= 1 ~m_pc~0) (not (= ~E_1~0 0)) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)))) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 |old(~E_2~0)|)) (.cse14 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (< |old(~t2_st~0)| 2) (and .cse1 (= |old(~E_1~0)| ~E_1~0) (= ~t2_pc~0 1) (= |old(~E_2~0)| ~E_2~0) (= ~t1_st~0 |old(~t1_st~0)|) .cse2) .cse3 (not .cse4) (< |old(~m_st~0)| 2) .cse5 .cse6 .cse7 .cse8 (not .cse9) (< |old(~t1_st~0)| 2) .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse3 (< |old(~local~0)| |old(~token~0)|) (and (and .cse1 (not (= ~E_2~0 1)) (= 1 ~t2_pc~0) (not (= ~E_1~0 1)) .cse2) (<= 2 ~t1_st~0)) (< |old(~token~0)| |old(~local~0)|) .cse4 .cse5 .cse6 .cse7 (not (= |old(~t1_st~0)| 0)) .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse11 .cse9 .cse12 (not (= 0 |old(~t2_st~0)|)) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse14)))) [2018-11-28 11:39:00,514 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-11-28 11:39:00,514 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-11-28 11:39:00,514 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse26 (= 1 ~E_1~0)) (.cse30 (= ~t1_st~0 0)) (.cse3 (= ~t1_pc~0 1)) (.cse28 (= 1 ~t2_pc~0)) (.cse19 (= 1 ~m_pc~0))) (let ((.cse24 (< ~m_st~0 2)) (.cse27 (not .cse19)) (.cse10 (not .cse28)) (.cse25 (< ~t1_st~0 2)) (.cse21 (not .cse3)) (.cse14 (= 0 ~E_1~0)) (.cse1 (< ~t2_st~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< ~local~0 ~token~0)) (.cse22 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (not .cse30)) (.cse9 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse23 (not .cse26)) (.cse6 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse12 (not (= ~m_i~0 1))) (.cse29 (not (= 0 ~t2_st~0))) (.cse13 (= 1 ~E_2~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse22 .cse4 .cse5 .cse7 .cse8 .cse6 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse6 .cse2 .cse21 .cse24 .cse4 .cse5 .cse9 .cse10 .cse25 .cse11 .cse12 .cse26 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse25 (or .cse0 .cse2 .cse21 .cse24 .cse4 .cse5 .cse7 .cse10 .cse11 .cse12 .cse26 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18) .cse6) (or .cse0 .cse2 .cse21 .cse24 .cse4 .cse5 .cse7 .cse9 .cse11 .cse12 .cse28 .cse26 .cse29 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse30 .cse6) (or .cse25 .cse28 .cse13 .cse6 (or .cse0 .cse2 .cse21 .cse4 .cse5 .cse7 .cse9 .cse11 .cse12 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse21 .cse24 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 (< ~token~0 .cse31) .cse12 .cse26 .cse27 .cse14 .cse6 .cse15 .cse16 (< .cse31 ~token~0) .cse17 .cse18 .cse13 .cse30)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse28 .cse29 .cse13 .cse6 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse32 (+ ~local~0 2))) (or (not .cse9) .cse0 .cse6 .cse2 (< .cse32 ~token~0) .cse21 .cse4 .cse5 .cse7 .cse10 .cse25 .cse11 (not (= 0 ~m_st~0)) .cse12 .cse26 .cse13 .cse27 .cse14 .cse15 .cse16 .cse18 (< ~token~0 .cse32))) (or .cse10 .cse25 (or .cse0 .cse2 .cse21 .cse4 .cse5 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) .cse1 .cse13 .cse6) (or .cse0 .cse2 .cse20 .cse22 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse23 .cse6 .cse12 .cse28 .cse29 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2018-11-28 11:39:00,517 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-11-28 11:39:00,517 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-11-28 11:39:00,517 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-11-28 11:39:00,517 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-11-28 11:39:00,518 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse11 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse9 (= 1 ~t2_pc~0)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse18 (= 1 ~m_pc~0)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11 (not (= 0 ~t2_st~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse11 (< ~t2_st~0 2) .cse1 (not .cse2) (< ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 (not .cse9) (< ~t1_st~0 2) .cse7 .cse8 .cse10 .cse12 (not .cse18) .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-11-28 11:39:00,520 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-11-28 11:39:00,520 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-11-28 11:39:00,520 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-11-28 11:39:00,520 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-11-28 11:39:00,520 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-11-28 11:39:00,521 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-11-28 11:39:00,521 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-11-28 11:39:00,521 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse0 (= |old(~T2_E~0)| ~T2_E~0)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~M_E~0 1))) (.cse3 (and (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_1~0 0))) (not (= ~E_2~0 0)))) (.cse4 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse3) .cse4) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (and .cse0 .cse1 (and (not (= ~t1_pc~0 1)) (= ~m_st~0 0) .cse2 .cse3 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) .cse4) (<= ~token~0 ~local~0) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= |old(~t2_pc~0)| ~t2_pc~0)) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-28 11:39:00,521 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,524 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-11-28 11:39:00,524 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,525 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (<= 2 ~t1_st~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,525 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-11-28 11:39:00,525 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,529 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-28 11:39:00,529 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,529 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (= ~M_E~0 0)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,529 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,529 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-28 11:39:00,529 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-28 11:39:00,529 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-11-28 11:39:00,533 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,533 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,533 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~t2_pc~0)| ~t2_pc~0) (= |old(~E_M~0)| ~E_M~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (= 0 ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,533 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,535 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))) (<= 2 ~t1_st~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,535 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,535 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,535 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,536 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (and (= 1 ~t1_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (and (and (not (= ~E_M~0 0)) (not (= ~M_E~0 0))) (not (= ~E_1~0 0))) (not (= ~E_2~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 0 |old(~t2_st~0)|)) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-28 11:39:00,536 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-11-28 11:39:00,536 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= |old(~T2_E~0)| ~T2_E~0)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~M_E~0 1))) (.cse3 (and (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_1~0 0))) (not (= ~E_2~0 0)))) (.cse4 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (<= 2 ~t2_st~0) (= 1 ~t2_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse3) .cse4) (not (= ~E_1~0 1)))) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (and .cse0 .cse1 (and (not (= ~t1_pc~0 1)) (= ~m_st~0 0) .cse2 .cse3 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) .cse4) (<= ~token~0 ~local~0) (= |old(~E_2~0)| ~E_2~0) (= 0 ~t1_st~0) (<= ~local~0 ~token~0) (= |old(~t2_pc~0)| ~t2_pc~0)) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-28 11:39:00,536 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-28 11:39:00,536 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-11-28 11:39:00,536 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-11-28 11:39:00,536 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-11-28 11:39:00,537 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-11-28 11:39:00,538 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-11-28 11:39:00,538 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-11-28 11:39:00,538 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-11-28 11:39:00,538 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0)) (.cse25 (= ~t1_pc~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse24 (= ~t1_st~0 0))) (let ((.cse26 (not .cse24)) (.cse22 (< ~t2_st~0 2)) (.cse10 (not .cse27)) (.cse30 (< ~local~0 ~token~0)) (.cse31 (< ~token~0 ~local~0)) (.cse11 (< ~t1_st~0 2)) (.cse15 (= 1 ~E_2~0)) (.cse1 (= ~T1_E~0 0)) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse2 (= ~T2_E~0 1)) (.cse5 (not .cse25)) (.cse6 (< ~m_st~0 2)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse3 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse28 (not (= 0 ~t2_st~0))) (.cse16 (not .cse29)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (let ((.cse4 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 (< .cse4 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse4))) (let ((.cse23 (+ ~local~0 1))) (or .cse1 .cse22 .cse2 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse3 .cse10 .cse12 (< ~token~0 .cse23) .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 (< .cse23 ~token~0) .cse20 .cse21 .cse24)) (or .cse1 .cse22 .cse2 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse2 .cse25 .cse7 .cse8 .cse9 .cse26 .cse3 .cse12 .cse13 .cse27 .cse28 .cse15 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29) (or .cse1 .cse22 .cse2 .cse25 .cse7 .cse8 .cse9 .cse26 .cse3 .cse10 .cse0 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29) (or .cse1 .cse22 .cse2 .cse30 .cse5 .cse31 .cse0 .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse2 .cse30 .cse5 .cse31 .cse7 .cse8 .cse9 .cse3 .cse11 .cse12 .cse13 .cse27 .cse28 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse29) (or .cse1 .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse3 .cse12 .cse13 .cse27 .cse14 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24)))) [2018-11-28 11:39:00,538 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-11-28 11:39:00,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:39:00,538 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~T2_E~0 1)) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (= 0 ~t2_st~0) (not (= ~E_2~0 1)) (not (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (not (= 1 ~t2_pc~0)) (not (= ~t2_i~0 1)) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2018-11-28 11:39:00,538 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-11-28 11:39:00,539 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-11-28 11:39:00,540 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< ~t2_st~0 2) (= |old(~T2_E~0)| 1) (not (= ~t1_pc~0 1)) (< ~m_st~0 2) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~E_M~0)|) (not (= 1 ~t2_pc~0)) (< ~t1_st~0 2) (= |old(~T1_E~0)| 1) (not (= ~m_i~0 1)) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~m_pc~0)) (= 0 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|)) [2018-11-28 11:39:00,540 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-11-28 11:39:00,540 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-11-28 11:39:00,540 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-11-28 11:39:00,540 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-11-28 11:39:00,540 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (not (= 0 ~t2_st~0)) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0)) [2018-11-28 11:39:00,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:39:00 BoogieIcfgContainer [2018-11-28 11:39:00,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:39:00,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:39:00,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:39:00,627 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:39:00,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:19" (3/4) ... [2018-11-28 11:39:00,634 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:39:00,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:39:00,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-28 11:39:00,641 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-28 11:39:00,649 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-28 11:39:00,649 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 11:39:00,675 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T2_E) == 0) || 0 == \old(M_E)) || (((2 <= t2_st && 1 == t2_pc) && 2 <= t1_st) && (!(E_2 == 1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && (((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || (((((((\old(E_1) == E_1 && token == \old(token)) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) [2018-11-28 11:39:00,675 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) [2018-11-28 11:39:00,675 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((1 == t2_pc && \old(E_1) == E_1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token) || T1_E == 0) || (((token <= local && 0 == t1_st) && ((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(0 == tmp)) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || T2_E == 0) || ((((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && !(E_1 == 1)) && !(0 == tmp)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && local <= token) && ((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && \old(E_1) == E_1) && ((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && tmp == 1) && !(E_1 == 1)) && ((((!(t1_pc == 1) && 2 <= m_st) && !(E_M == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_M == 1))) || (((token <= local + 1 && (((!(E_2 == 1) && 1 == t2_pc) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && local + 1 <= token) && 2 <= t1_st)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && (((!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_pc) == t2_pc) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((!(t1_pc == 1) && 2 <= m_st) && !(E_M == 0)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && tmp == 1) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || ((((token == \old(token) && token <= local) && 0 == t1_st) && ((\old(E_1) == E_1 && \old(E_2) == E_2) && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && \old(t2_pc) == t2_pc) && local <= token)) || (((((!(E_2 == 1) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && !(E_1 == 1)) && \old(t2_pc) == t2_pc) && 2 <= t1_st)) || (((((((!(E_2 == 1) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && tmp == 1) && local <= token) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) [2018-11-28 11:39:00,676 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && !(E_1 == 1)) && (((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc)) [2018-11-28 11:39:00,678 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-28 11:39:00,678 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) [2018-11-28 11:39:00,678 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) [2018-11-28 11:39:00,678 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && ((((((((((((((((((((T1_E == 0 || (((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 0 == t2_st)) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || \old(E_2) == E_2) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 0 == t2_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || ((((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && token <= local) && 0 == t2_st) && local <= token)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-11-28 11:39:00,678 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || \old(E_2) == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) [2018-11-28 11:39:00,679 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) [2018-11-28 11:39:00,679 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && local + 2 <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || ((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || (((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && t1_st == \old(t1_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && 0 == t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-11-28 11:39:00,679 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) [2018-11-28 11:39:00,679 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((t2_pc == 1 && 2 <= m_st) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) [2018-11-28 11:39:00,717 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d445a9b8-d38b-4692-994e-3dab1b6d04d5/bin-2019/uautomizer/witness.graphml [2018-11-28 11:39:00,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:39:00,718 INFO L168 Benchmark]: Toolchain (without parser) took 41944.27 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 954.4 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,718 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:39:00,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 938.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 938.3 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,719 INFO L168 Benchmark]: Boogie Preprocessor took 22.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,719 INFO L168 Benchmark]: RCFGBuilder took 486.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,719 INFO L168 Benchmark]: TraceAbstraction took 41102.43 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,720 INFO L168 Benchmark]: Witness Printer took 90.74 ms. Allocated memory is still 2.9 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:00,721 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 938.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 938.3 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 486.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41102.43 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 90.74 ms. Allocated memory is still 2.9 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 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: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && local + 2 <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || ((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || (((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && t1_st == \old(t1_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || ((((2 <= m_st && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && 0 == t1_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || (((((m_st == 0 && !(E_M == 0)) && \old(t2_pc) == t2_pc) && !(E_M == 1)) && token == \old(token)) && 0 == t1_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && ((((t1_st < 2 || 1 == t2_pc) || 1 == E_2) || 0 == __retres1) || ((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || 1 == E_2) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || 0 == __retres1) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || token < local + 2)) && (((((!(1 == t2_pc) || t1_st < 2) || ((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t2_st < 2) || 1 == E_2) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || 0 == __retres1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && token <= \old(token) + 1) && !(E_2 == 0)) && 0 == t2_st) && local + 1 <= token)) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 2 <= t2_st)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || \old(E_2) == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 1)) && !(E_2 == 0)) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || ((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && \old(E_2) == E_2) && 2 <= t2_st)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((1 == t1_pc && 2 <= m_st) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2)) && (((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || (((2 <= m_st && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && ((((((((((((((((((((T1_E == 0 || (((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 0 == t2_st)) || T2_E == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || \old(m_st) < 2) || T2_E == 0) || \old(E_2) == E_2) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(m_st) < 2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_2 == 1)) && token <= \old(token) + 1) && local + 1 <= token) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 0 == t2_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || ((((((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(E_2 == 1))) || 0 == E_1) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && token <= local) && 0 == t2_st) && local <= token)) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || (((((m_st == 0 && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && local <= token)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 1 == E_M) || local + 2 < token) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((\old(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 0 == t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || (((\old(E_1) == E_1 && !(m_pc == 1)) && 0 == t1_st) && 2 <= t2_st)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && (((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || (((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && !(E_1 == 1)) && (((((((1 == t1_pc && !(T2_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || !(0 == \old(t2_st))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || (((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0))) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || T2_E == 0) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || (((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0))) || (((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || \old(token) < \old(local) + 2) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 0 == __retres1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((t1_st < 2 || ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == E_1) || 1 == m_pc) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || token < local + 2)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || token < local) || __retres1 == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 1) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1)) && (((((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 1) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || t1_pc == 1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || __retres1 == 1) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || __retres1 == 1) || token < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((t2_pc == 1 && m_st == 0) && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || (((((t2_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || ((((t2_pc == 1 && 2 <= m_st) && \old(E_M) == E_M) && token == \old(token)) && t1_st == \old(t1_st))) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((1 == t2_pc && \old(E_1) == E_1) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && (((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && !(E_M == 1)) && token <= local) && tmp == 1) && local <= token) || T1_E == 0) || (((token <= local && 0 == t1_st) && ((2 <= t2_st && 1 == t2_pc) && (!(E_2 == 1) && !(E_1 == 1)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(0 == tmp)) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && m_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && 2 <= t2_st) && !(E_2 == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(0 == tmp)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || T2_E == 0) || ((((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && !(E_1 == 1)) && !(0 == tmp)) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && local <= token) && ((((2 <= t2_st && !(E_2 == 1)) && 1 == t2_pc) && \old(E_1) == E_1) && ((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((2 <= t2_st && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && tmp == 1) && !(E_1 == 1)) && ((((!(t1_pc == 1) && 2 <= m_st) && !(E_M == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_M == 1))) || (((token <= local + 1 && (((!(E_2 == 1) && 1 == t2_pc) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && local + 1 <= token) && 2 <= t1_st)) || ((((token == \old(token) && token <= local) && 2 <= t1_st) && (((!(E_2 == 1) && \old(E_1) == E_1) && (((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && \old(t2_pc) == t2_pc) && local <= token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((((((!(t1_pc == 1) && 2 <= m_st) && !(E_M == 0)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && !(E_M == 1)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && tmp == 1) && !(E_1 == 1)) && \old(t2_pc) == t2_pc)) || ((((token == \old(token) && token <= local) && 0 == t1_st) && ((\old(E_1) == E_1 && \old(E_2) == E_2) && ((((!(t1_pc == 1) && m_st == 0) && !(E_M == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && \old(t2_pc) == t2_pc) && local <= token)) || (((((!(E_2 == 1) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && tmp == 1) && !(E_1 == 1)) && \old(t2_pc) == t2_pc) && 2 <= t1_st)) || (((((((!(E_2 == 1) && ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && 0 == t1_st) && tmp == 1) && local <= token) && \old(t2_pc) == t2_pc)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || (((((2 <= t2_st && \old(E_1) == E_1) && t2_pc == 1) && \old(E_2) == E_2) && (((((((((((((1 == t1_pc && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && m_i == 1) && 2 <= m_st) && !(M_E == 0)) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && t1_st == \old(t1_st))) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || \old(local) < \old(token)) || \old(T2_E) == 0) || 0 == \old(M_E)) || (((2 <= t2_st && 1 == t2_pc) && 2 <= t1_st) && (!(E_2 == 1) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && (((1 == t1_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || (((((((\old(E_1) == E_1 && token == \old(token)) && ((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && ((((!(t1_pc == 1) && m_st == 0) && !(M_E == 1)) && ((!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && 0 == t2_st) && !(E_M == 1)) && token <= local) && \old(E_2) == E_2) && 0 == t1_st) && local <= token) && \old(t2_pc) == t2_pc)) || !(1 == t1_i)) || 0 == \old(E_2)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == \old(m_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 40.9s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 26.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6271 SDtfs, 7981 SDslu, 8797 SDs, 0 SdLazy, 5552 SolverSat, 2192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1886 GetRequests, 1712 SyntacticMatches, 39 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5840occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 1891 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 17976 PreInvPairs, 18171 NumberOfFragments, 22240 HoareAnnotationTreeSize, 17976 FomulaSimplifications, 89586 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 71 FomulaSimplificationsInter, 74219 FormulaSimplificationTreeSizeReductionInter, 23.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5783 NumberOfCodeBlocks, 5783 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5750 ConstructedInterpolants, 0 QuantifiedInterpolants, 1455800 SizeOfPredicates, 3 NumberOfNonLiveVariables, 7278 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 3268/3369 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...