./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-5842f4b [2018-11-18 09:15:58,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:15:58,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:15:58,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:15:58,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:15:58,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:15:58,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:15:58,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:15:58,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:15:58,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:15:58,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:15:58,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:15:58,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:15:58,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:15:58,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:15:58,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:15:58,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:15:58,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:15:58,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:15:58,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:15:58,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:15:58,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:15:58,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:15:58,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:15:58,187 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:15:58,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:15:58,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:15:58,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:15:58,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:15:58,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:15:58,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:15:58,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:15:58,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:15:58,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:15:58,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:15:58,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:15:58,192 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 09:15:58,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:15:58,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:15:58,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:15:58,203 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:15:58,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:15:58,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:15:58,203 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:15:58,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:15:58,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:15:58,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:15:58,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:15:58,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:15:58,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:15:58,207 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_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:15:58,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:15:58,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:15:58,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:15:58,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:15:58,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:15:58,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-18 09:15:58,275 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/data/7233990ef/c79a767e8f664582bdd054c265593487/FLAG1330f1a1a [2018-11-18 09:15:58,699 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:15:58,700 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-18 09:15:58,707 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/data/7233990ef/c79a767e8f664582bdd054c265593487/FLAG1330f1a1a [2018-11-18 09:15:58,715 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/data/7233990ef/c79a767e8f664582bdd054c265593487 [2018-11-18 09:15:58,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:15:58,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 09:15:58,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:15:58,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:15:58,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:15:58,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ae4871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58, skipping insertion in model container [2018-11-18 09:15:58,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:15:58,757 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:15:58,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:15:58,907 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:15:58,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:15:58,940 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:15:58,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58 WrapperNode [2018-11-18 09:15:58,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:15:58,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:15:58,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:15:58,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:15:58,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:58,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:59,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:59,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... [2018-11-18 09:15:59,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:15:59,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:15:59,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:15:59,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:15:59,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-18 09:15:59,039 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 09:15:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 09:15:59,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:15:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 09:15:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 09:15:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 09:15:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:15:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:15:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:15:59,395 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:15:59,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:59 BoogieIcfgContainer [2018-11-18 09:15:59,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:15:59,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:15:59,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:15:59,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:15:59,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:15:58" (1/3) ... [2018-11-18 09:15:59,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463a941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:15:59, skipping insertion in model container [2018-11-18 09:15:59,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:58" (2/3) ... [2018-11-18 09:15:59,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463a941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:15:59, skipping insertion in model container [2018-11-18 09:15:59,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:59" (3/3) ... [2018-11-18 09:15:59,400 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-18 09:15:59,405 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:15:59,410 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:15:59,418 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:15:59,438 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:15:59,439 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:15:59,439 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:15:59,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:15:59,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:15:59,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:15:59,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:15:59,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:15:59,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:15:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-11-18 09:15:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:15:59,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:59,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:59,463 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:59,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1391083364, now seen corresponding path program 1 times [2018-11-18 09:15:59,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:15:59,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:15:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:15:59,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:15:59,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:15:59,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:15:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:15:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:15:59,652 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2018-11-18 09:15:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:59,808 INFO L93 Difference]: Finished difference Result 341 states and 482 transitions. [2018-11-18 09:15:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:15:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-18 09:15:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:59,818 INFO L225 Difference]: With dead ends: 341 [2018-11-18 09:15:59,818 INFO L226 Difference]: Without dead ends: 170 [2018-11-18 09:15:59,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:15:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-18 09:15:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-11-18 09:15:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:15:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 227 transitions. [2018-11-18 09:15:59,862 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 227 transitions. Word has length 93 [2018-11-18 09:15:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:59,863 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 227 transitions. [2018-11-18 09:15:59,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:15:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 227 transitions. [2018-11-18 09:15:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:15:59,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:59,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:59,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:59,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1364017762, now seen corresponding path program 1 times [2018-11-18 09:15:59,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:15:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:15:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:15:59,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:15:59,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:15:59,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:15:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:15:59,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:15:59,988 INFO L87 Difference]: Start difference. First operand 170 states and 227 transitions. Second operand 5 states. [2018-11-18 09:16:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:00,342 INFO L93 Difference]: Finished difference Result 351 states and 485 transitions. [2018-11-18 09:16:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:00,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-18 09:16:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:00,346 INFO L225 Difference]: With dead ends: 351 [2018-11-18 09:16:00,347 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 09:16:00,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:16:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 09:16:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2018-11-18 09:16:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:16:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2018-11-18 09:16:00,366 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 93 [2018-11-18 09:16:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:00,367 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2018-11-18 09:16:00,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2018-11-18 09:16:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:16:00,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:00,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:00,369 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:00,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:00,369 INFO L82 PathProgramCache]: Analyzing trace with hash 396667108, now seen corresponding path program 1 times [2018-11-18 09:16:00,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:00,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:00,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:00,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:00,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:00,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:00,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:00,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:00,440 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand 5 states. [2018-11-18 09:16:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:00,701 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2018-11-18 09:16:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:00,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-18 09:16:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:00,703 INFO L225 Difference]: With dead ends: 351 [2018-11-18 09:16:00,703 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 09:16:00,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:16:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 09:16:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2018-11-18 09:16:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:16:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2018-11-18 09:16:00,722 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 93 [2018-11-18 09:16:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2018-11-18 09:16:00,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2018-11-18 09:16:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:16:00,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:00,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:00,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:00,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1989842398, now seen corresponding path program 1 times [2018-11-18 09:16:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:00,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:00,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:00,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:00,795 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand 5 states. [2018-11-18 09:16:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:01,028 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2018-11-18 09:16:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:01,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-18 09:16:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:01,030 INFO L225 Difference]: With dead ends: 349 [2018-11-18 09:16:01,030 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 09:16:01,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:16:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 09:16:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 170. [2018-11-18 09:16:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:16:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2018-11-18 09:16:01,045 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 93 [2018-11-18 09:16:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:01,045 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2018-11-18 09:16:01,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2018-11-18 09:16:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:16:01,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:01,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:01,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1812498724, now seen corresponding path program 1 times [2018-11-18 09:16:01,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:01,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:01,116 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand 5 states. [2018-11-18 09:16:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:01,316 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2018-11-18 09:16:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:01,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-18 09:16:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:01,318 INFO L225 Difference]: With dead ends: 368 [2018-11-18 09:16:01,318 INFO L226 Difference]: Without dead ends: 218 [2018-11-18 09:16:01,318 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:16:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-18 09:16:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 170. [2018-11-18 09:16:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:16:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2018-11-18 09:16:01,332 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 223 transitions. Word has length 93 [2018-11-18 09:16:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:01,332 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 223 transitions. [2018-11-18 09:16:01,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 223 transitions. [2018-11-18 09:16:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:16:01,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:01,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:01,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1528528414, now seen corresponding path program 1 times [2018-11-18 09:16:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:01,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:01,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:01,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:01,382 INFO L87 Difference]: Start difference. First operand 170 states and 223 transitions. Second operand 5 states. [2018-11-18 09:16:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:01,574 INFO L93 Difference]: Finished difference Result 361 states and 494 transitions. [2018-11-18 09:16:01,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:01,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-18 09:16:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:01,576 INFO L225 Difference]: With dead ends: 361 [2018-11-18 09:16:01,576 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 09:16:01,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:16:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 09:16:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2018-11-18 09:16:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 09:16:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2018-11-18 09:16:01,590 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 93 [2018-11-18 09:16:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:01,591 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2018-11-18 09:16:01,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-18 09:16:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 09:16:01,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:01,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:01,592 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:01,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1550285156, now seen corresponding path program 1 times [2018-11-18 09:16:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:01,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:16:01,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:16:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:16:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:01,633 INFO L87 Difference]: Start difference. First operand 170 states and 222 transitions. Second operand 4 states. [2018-11-18 09:16:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:01,751 INFO L93 Difference]: Finished difference Result 460 states and 629 transitions. [2018-11-18 09:16:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:16:01,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-18 09:16:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:01,753 INFO L225 Difference]: With dead ends: 460 [2018-11-18 09:16:01,753 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 09:16:01,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 09:16:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2018-11-18 09:16:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-18 09:16:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 404 transitions. [2018-11-18 09:16:01,775 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 404 transitions. Word has length 93 [2018-11-18 09:16:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:01,775 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 404 transitions. [2018-11-18 09:16:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:16:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 404 transitions. [2018-11-18 09:16:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 09:16:01,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:01,777 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:01,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:01,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1511392395, now seen corresponding path program 1 times [2018-11-18 09:16:01,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:01,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 09:16:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:01,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:01,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 09:16:01,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:01,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 09:16:01,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:16:01,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:16:01,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:16:01,985 INFO L87 Difference]: Start difference. First operand 310 states and 404 transitions. Second operand 7 states. [2018-11-18 09:16:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:02,114 INFO L93 Difference]: Finished difference Result 901 states and 1262 transitions. [2018-11-18 09:16:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:16:02,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2018-11-18 09:16:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:02,118 INFO L225 Difference]: With dead ends: 901 [2018-11-18 09:16:02,118 INFO L226 Difference]: Without dead ends: 612 [2018-11-18 09:16:02,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 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-18 09:16:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-18 09:16:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 585. [2018-11-18 09:16:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-18 09:16:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 787 transitions. [2018-11-18 09:16:02,157 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 787 transitions. Word has length 149 [2018-11-18 09:16:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:02,157 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 787 transitions. [2018-11-18 09:16:02,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:16:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 787 transitions. [2018-11-18 09:16:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 09:16:02,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:02,160 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:02,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:02,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash -62092307, now seen corresponding path program 1 times [2018-11-18 09:16:02,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:02,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:02,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:02,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-18 09:16:02,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:02,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:02,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:02,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 09:16:02,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:02,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 09:16:02,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:16:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:16:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:16:02,331 INFO L87 Difference]: Start difference. First operand 585 states and 787 transitions. Second operand 7 states. [2018-11-18 09:16:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:02,438 INFO L93 Difference]: Finished difference Result 1532 states and 2167 transitions. [2018-11-18 09:16:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:16:02,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2018-11-18 09:16:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:02,443 INFO L225 Difference]: With dead ends: 1532 [2018-11-18 09:16:02,443 INFO L226 Difference]: Without dead ends: 974 [2018-11-18 09:16:02,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 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-18 09:16:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-18 09:16:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2018-11-18 09:16:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2018-11-18 09:16:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1311 transitions. [2018-11-18 09:16:02,495 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1311 transitions. Word has length 170 [2018-11-18 09:16:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:02,496 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1311 transitions. [2018-11-18 09:16:02,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:16:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1311 transitions. [2018-11-18 09:16:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 09:16:02,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:02,499 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:02,499 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:02,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 328202712, now seen corresponding path program 1 times [2018-11-18 09:16:02,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:02,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:02,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 09:16:02,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:02,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:02,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:16:02,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:02,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-18 09:16:02,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:02,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:02,688 INFO L87 Difference]: Start difference. First operand 972 states and 1311 transitions. Second operand 5 states. [2018-11-18 09:16:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:03,271 INFO L93 Difference]: Finished difference Result 4500 states and 6820 transitions. [2018-11-18 09:16:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:16:03,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2018-11-18 09:16:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:03,288 INFO L225 Difference]: With dead ends: 4500 [2018-11-18 09:16:03,288 INFO L226 Difference]: Without dead ends: 3554 [2018-11-18 09:16:03,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 173 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-18 09:16:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-11-18 09:16:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3485. [2018-11-18 09:16:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2018-11-18 09:16:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4851 transitions. [2018-11-18 09:16:03,572 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4851 transitions. Word has length 171 [2018-11-18 09:16:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:03,573 INFO L480 AbstractCegarLoop]: Abstraction has 3485 states and 4851 transitions. [2018-11-18 09:16:03,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4851 transitions. [2018-11-18 09:16:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 09:16:03,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:03,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:03,579 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:03,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1265918893, now seen corresponding path program 1 times [2018-11-18 09:16:03,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:03,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:16:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:16:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:16:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:03,631 INFO L87 Difference]: Start difference. First operand 3485 states and 4851 transitions. Second operand 4 states. [2018-11-18 09:16:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:03,928 INFO L93 Difference]: Finished difference Result 6137 states and 8462 transitions. [2018-11-18 09:16:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:16:03,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-11-18 09:16:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:03,942 INFO L225 Difference]: With dead ends: 6137 [2018-11-18 09:16:03,942 INFO L226 Difference]: Without dead ends: 2674 [2018-11-18 09:16:03,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-11-18 09:16:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2018-11-18 09:16:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2018-11-18 09:16:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3640 transitions. [2018-11-18 09:16:04,165 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3640 transitions. Word has length 149 [2018-11-18 09:16:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 2674 states and 3640 transitions. [2018-11-18 09:16:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:16:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3640 transitions. [2018-11-18 09:16:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 09:16:04,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:04,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:04,170 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:04,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1073393537, now seen corresponding path program 1 times [2018-11-18 09:16:04,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 09:16:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:04,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:04,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 09:16:04,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-18 09:16:04,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:16:04,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:16:04,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:16:04,363 INFO L87 Difference]: Start difference. First operand 2674 states and 3640 transitions. Second operand 7 states. [2018-11-18 09:16:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:04,774 INFO L93 Difference]: Finished difference Result 8040 states and 12205 transitions. [2018-11-18 09:16:04,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:16:04,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2018-11-18 09:16:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:04,802 INFO L225 Difference]: With dead ends: 8040 [2018-11-18 09:16:04,802 INFO L226 Difference]: Without dead ends: 5387 [2018-11-18 09:16:04,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 151 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-18 09:16:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-18 09:16:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5346. [2018-11-18 09:16:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5346 states. [2018-11-18 09:16:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5346 states to 5346 states and 7626 transitions. [2018-11-18 09:16:05,212 INFO L78 Accepts]: Start accepts. Automaton has 5346 states and 7626 transitions. Word has length 150 [2018-11-18 09:16:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:05,212 INFO L480 AbstractCegarLoop]: Abstraction has 5346 states and 7626 transitions. [2018-11-18 09:16:05,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:16:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5346 states and 7626 transitions. [2018-11-18 09:16:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 09:16:05,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:05,219 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:05,219 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:05,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash 573128957, now seen corresponding path program 1 times [2018-11-18 09:16:05,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:05,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:05,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:16:05,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:16:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:16:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:05,268 INFO L87 Difference]: Start difference. First operand 5346 states and 7626 transitions. Second operand 4 states. [2018-11-18 09:16:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:05,763 INFO L93 Difference]: Finished difference Result 9422 states and 13422 transitions. [2018-11-18 09:16:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:16:05,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-18 09:16:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:05,783 INFO L225 Difference]: With dead ends: 9422 [2018-11-18 09:16:05,783 INFO L226 Difference]: Without dead ends: 4099 [2018-11-18 09:16:05,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-11-18 09:16:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4099. [2018-11-18 09:16:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2018-11-18 09:16:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5826 transitions. [2018-11-18 09:16:06,099 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5826 transitions. Word has length 150 [2018-11-18 09:16:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:06,100 INFO L480 AbstractCegarLoop]: Abstraction has 4099 states and 5826 transitions. [2018-11-18 09:16:06,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:16:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5826 transitions. [2018-11-18 09:16:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:06,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:06,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:06,104 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:06,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1676319220, now seen corresponding path program 1 times [2018-11-18 09:16:06,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:06,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:06,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:06,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:06,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:06,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:06,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:06,170 INFO L87 Difference]: Start difference. First operand 4099 states and 5826 transitions. Second operand 5 states. [2018-11-18 09:16:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:06,907 INFO L93 Difference]: Finished difference Result 10038 states and 14482 transitions. [2018-11-18 09:16:06,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:16:06,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:06,936 INFO L225 Difference]: With dead ends: 10038 [2018-11-18 09:16:06,936 INFO L226 Difference]: Without dead ends: 5962 [2018-11-18 09:16:06,952 INFO L604 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-18 09:16:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2018-11-18 09:16:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5314. [2018-11-18 09:16:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-11-18 09:16:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 7122 transitions. [2018-11-18 09:16:07,357 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 7122 transitions. Word has length 151 [2018-11-18 09:16:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:07,358 INFO L480 AbstractCegarLoop]: Abstraction has 5314 states and 7122 transitions. [2018-11-18 09:16:07,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7122 transitions. [2018-11-18 09:16:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:07,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:07,362 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:07,362 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:07,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash 905585654, now seen corresponding path program 1 times [2018-11-18 09:16:07,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:07,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:07,440 INFO L87 Difference]: Start difference. First operand 5314 states and 7122 transitions. Second operand 5 states. [2018-11-18 09:16:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:07,852 INFO L93 Difference]: Finished difference Result 10605 states and 14270 transitions. [2018-11-18 09:16:07,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:07,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:07,868 INFO L225 Difference]: With dead ends: 10605 [2018-11-18 09:16:07,868 INFO L226 Difference]: Without dead ends: 5314 [2018-11-18 09:16:07,877 INFO L604 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-18 09:16:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2018-11-18 09:16:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5314. [2018-11-18 09:16:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-11-18 09:16:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 7068 transitions. [2018-11-18 09:16:08,078 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 7068 transitions. Word has length 151 [2018-11-18 09:16:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:08,078 INFO L480 AbstractCegarLoop]: Abstraction has 5314 states and 7068 transitions. [2018-11-18 09:16:08,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7068 transitions. [2018-11-18 09:16:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:08,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:08,082 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:08,082 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:08,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -89108044, now seen corresponding path program 1 times [2018-11-18 09:16:08,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:08,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:08,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:08,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:08,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:08,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:08,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:08,153 INFO L87 Difference]: Start difference. First operand 5314 states and 7068 transitions. Second operand 5 states. [2018-11-18 09:16:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:08,619 INFO L93 Difference]: Finished difference Result 10605 states and 14162 transitions. [2018-11-18 09:16:08,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:16:08,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:08,632 INFO L225 Difference]: With dead ends: 10605 [2018-11-18 09:16:08,632 INFO L226 Difference]: Without dead ends: 5314 [2018-11-18 09:16:08,639 INFO L604 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-18 09:16:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2018-11-18 09:16:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5314. [2018-11-18 09:16:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-11-18 09:16:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 7014 transitions. [2018-11-18 09:16:08,837 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 7014 transitions. Word has length 151 [2018-11-18 09:16:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:08,837 INFO L480 AbstractCegarLoop]: Abstraction has 5314 states and 7014 transitions. [2018-11-18 09:16:08,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7014 transitions. [2018-11-18 09:16:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:08,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:08,840 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:08,840 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:08,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash -675384266, now seen corresponding path program 1 times [2018-11-18 09:16:08,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:08,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:08,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:08,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:08,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:08,898 INFO L87 Difference]: Start difference. First operand 5314 states and 7014 transitions. Second operand 5 states. [2018-11-18 09:16:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:09,401 INFO L93 Difference]: Finished difference Result 11506 states and 17079 transitions. [2018-11-18 09:16:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:16:09,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:09,419 INFO L225 Difference]: With dead ends: 11506 [2018-11-18 09:16:09,419 INFO L226 Difference]: Without dead ends: 6215 [2018-11-18 09:16:09,429 INFO L604 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-18 09:16:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2018-11-18 09:16:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5687. [2018-11-18 09:16:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5687 states. [2018-11-18 09:16:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 7365 transitions. [2018-11-18 09:16:09,741 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 7365 transitions. Word has length 151 [2018-11-18 09:16:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:09,741 INFO L480 AbstractCegarLoop]: Abstraction has 5687 states and 7365 transitions. [2018-11-18 09:16:09,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 7365 transitions. [2018-11-18 09:16:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:09,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:09,744 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:09,744 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:09,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1661008244, now seen corresponding path program 1 times [2018-11-18 09:16:09,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:09,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:09,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:09,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:09,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:09,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:09,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:09,806 INFO L87 Difference]: Start difference. First operand 5687 states and 7365 transitions. Second operand 5 states. [2018-11-18 09:16:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:10,268 INFO L93 Difference]: Finished difference Result 11788 states and 16253 transitions. [2018-11-18 09:16:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:16:10,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:10,279 INFO L225 Difference]: With dead ends: 11788 [2018-11-18 09:16:10,280 INFO L226 Difference]: Without dead ends: 6123 [2018-11-18 09:16:10,290 INFO L604 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-18 09:16:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2018-11-18 09:16:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 6046. [2018-11-18 09:16:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6046 states. [2018-11-18 09:16:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 7810 transitions. [2018-11-18 09:16:10,576 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 7810 transitions. Word has length 151 [2018-11-18 09:16:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:10,576 INFO L480 AbstractCegarLoop]: Abstraction has 6046 states and 7810 transitions. [2018-11-18 09:16:10,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 7810 transitions. [2018-11-18 09:16:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:10,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:10,580 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:10,580 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:10,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash -757476234, now seen corresponding path program 1 times [2018-11-18 09:16:10,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:10,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 09:16:10,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:10,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:16:10,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:10,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:10,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:10,665 INFO L87 Difference]: Start difference. First operand 6046 states and 7810 transitions. Second operand 5 states. [2018-11-18 09:16:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:11,408 INFO L93 Difference]: Finished difference Result 14001 states and 21359 transitions. [2018-11-18 09:16:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:16:11,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-18 09:16:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:11,425 INFO L225 Difference]: With dead ends: 14001 [2018-11-18 09:16:11,425 INFO L226 Difference]: Without dead ends: 7978 [2018-11-18 09:16:11,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:16:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2018-11-18 09:16:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 7175. [2018-11-18 09:16:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-11-18 09:16:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 9158 transitions. [2018-11-18 09:16:11,776 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 9158 transitions. Word has length 151 [2018-11-18 09:16:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:11,776 INFO L480 AbstractCegarLoop]: Abstraction has 7175 states and 9158 transitions. [2018-11-18 09:16:11,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 9158 transitions. [2018-11-18 09:16:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 09:16:11,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:11,779 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:11,779 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:11,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1658360116, now seen corresponding path program 1 times [2018-11-18 09:16:11,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:11,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 09:16:11,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:11,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:16:11,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:16:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:16:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:11,832 INFO L87 Difference]: Start difference. First operand 7175 states and 9158 transitions. Second operand 4 states. [2018-11-18 09:16:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:12,249 INFO L93 Difference]: Finished difference Result 11170 states and 14711 transitions. [2018-11-18 09:16:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:16:12,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-18 09:16:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:12,266 INFO L225 Difference]: With dead ends: 11170 [2018-11-18 09:16:12,266 INFO L226 Difference]: Without dead ends: 6414 [2018-11-18 09:16:12,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:16:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2018-11-18 09:16:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 6384. [2018-11-18 09:16:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6384 states. [2018-11-18 09:16:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6384 states to 6384 states and 7903 transitions. [2018-11-18 09:16:12,622 INFO L78 Accepts]: Start accepts. Automaton has 6384 states and 7903 transitions. Word has length 151 [2018-11-18 09:16:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:12,623 INFO L480 AbstractCegarLoop]: Abstraction has 6384 states and 7903 transitions. [2018-11-18 09:16:12,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:16:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 6384 states and 7903 transitions. [2018-11-18 09:16:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 09:16:12,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:12,628 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:12,629 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:12,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1135406973, now seen corresponding path program 1 times [2018-11-18 09:16:12,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:12,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:12,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 09:16:12,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:12,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:12,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 09:16:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-18 09:16:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:16:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:16:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:16:12,836 INFO L87 Difference]: Start difference. First operand 6384 states and 7903 transitions. Second operand 3 states. [2018-11-18 09:16:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:13,253 INFO L93 Difference]: Finished difference Result 11482 states and 14516 transitions. [2018-11-18 09:16:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:16:13,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-18 09:16:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:13,276 INFO L225 Difference]: With dead ends: 11482 [2018-11-18 09:16:13,276 INFO L226 Difference]: Without dead ends: 6529 [2018-11-18 09:16:13,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 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-18 09:16:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2018-11-18 09:16:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6455. [2018-11-18 09:16:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6455 states. [2018-11-18 09:16:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 7780 transitions. [2018-11-18 09:16:13,676 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 7780 transitions. Word has length 219 [2018-11-18 09:16:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:13,677 INFO L480 AbstractCegarLoop]: Abstraction has 6455 states and 7780 transitions. [2018-11-18 09:16:13,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:16:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 7780 transitions. [2018-11-18 09:16:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-11-18 09:16:13,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:13,687 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:13,687 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1462041425, now seen corresponding path program 1 times [2018-11-18 09:16:13,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:13,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-18 09:16:13,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:13,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:13,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:14,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-11-18 09:16:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-18 09:16:14,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:16:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:16:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:16:14,147 INFO L87 Difference]: Start difference. First operand 6455 states and 7780 transitions. Second operand 12 states. [2018-11-18 09:16:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:14,545 INFO L93 Difference]: Finished difference Result 9129 states and 10972 transitions. [2018-11-18 09:16:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:16:14,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 369 [2018-11-18 09:16:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:14,555 INFO L225 Difference]: With dead ends: 9129 [2018-11-18 09:16:14,555 INFO L226 Difference]: Without dead ends: 2700 [2018-11-18 09:16:14,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:16:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-11-18 09:16:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2534. [2018-11-18 09:16:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2018-11-18 09:16:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 2854 transitions. [2018-11-18 09:16:14,761 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 2854 transitions. Word has length 369 [2018-11-18 09:16:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:14,762 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 2854 transitions. [2018-11-18 09:16:14,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:16:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 2854 transitions. [2018-11-18 09:16:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-18 09:16:14,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:14,766 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:14,767 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:14,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1702402857, now seen corresponding path program 1 times [2018-11-18 09:16:14,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-18 09:16:14,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:14,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:14,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-11-18 09:16:15,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:15,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-18 09:16:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:16:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:16:15,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:15,035 INFO L87 Difference]: Start difference. First operand 2534 states and 2854 transitions. Second operand 5 states. [2018-11-18 09:16:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:15,467 INFO L93 Difference]: Finished difference Result 4653 states and 5219 transitions. [2018-11-18 09:16:15,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:16:15,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2018-11-18 09:16:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:15,474 INFO L225 Difference]: With dead ends: 4653 [2018-11-18 09:16:15,474 INFO L226 Difference]: Without dead ends: 2475 [2018-11-18 09:16:15,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 266 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:16:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2018-11-18 09:16:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2433. [2018-11-18 09:16:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2018-11-18 09:16:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 2698 transitions. [2018-11-18 09:16:15,655 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 2698 transitions. Word has length 267 [2018-11-18 09:16:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:15,655 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 2698 transitions. [2018-11-18 09:16:15,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:16:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2698 transitions. [2018-11-18 09:16:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 09:16:15,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:15,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:15,660 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:15,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1054270179, now seen corresponding path program 1 times [2018-11-18 09:16:15,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:15,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:15,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-18 09:16:15,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:15,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/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-18 09:16:15,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:15,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 09:16:15,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:16:15,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-18 09:16:15,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:16:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:16:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:16:15,926 INFO L87 Difference]: Start difference. First operand 2433 states and 2698 transitions. Second operand 7 states. [2018-11-18 09:16:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:16,672 INFO L93 Difference]: Finished difference Result 3315 states and 3715 transitions. [2018-11-18 09:16:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:16:16,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-11-18 09:16:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:16,677 INFO L225 Difference]: With dead ends: 3315 [2018-11-18 09:16:16,678 INFO L226 Difference]: Without dead ends: 1196 [2018-11-18 09:16:16,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 276 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-18 09:16:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-11-18 09:16:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1151. [2018-11-18 09:16:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-18 09:16:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1234 transitions. [2018-11-18 09:16:16,757 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1234 transitions. Word has length 273 [2018-11-18 09:16:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:16,758 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 1234 transitions. [2018-11-18 09:16:16,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:16:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1234 transitions. [2018-11-18 09:16:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-18 09:16:16,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:16,762 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:16,762 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:16,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1647777794, now seen corresponding path program 1 times [2018-11-18 09:16:16,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:16,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:16,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:16,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:16,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-11-18 09:16:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:16:16,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:16:16,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:16:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:16:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:16:16,896 INFO L87 Difference]: Start difference. First operand 1151 states and 1234 transitions. Second operand 7 states. [2018-11-18 09:16:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:17,945 INFO L93 Difference]: Finished difference Result 2827 states and 3050 transitions. [2018-11-18 09:16:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:16:17,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-11-18 09:16:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:17,952 INFO L225 Difference]: With dead ends: 2827 [2018-11-18 09:16:17,952 INFO L226 Difference]: Without dead ends: 2267 [2018-11-18 09:16:17,954 INFO L604 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-18 09:16:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2018-11-18 09:16:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2170. [2018-11-18 09:16:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-11-18 09:16:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2334 transitions. [2018-11-18 09:16:18,121 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2334 transitions. Word has length 274 [2018-11-18 09:16:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:18,121 INFO L480 AbstractCegarLoop]: Abstraction has 2170 states and 2334 transitions. [2018-11-18 09:16:18,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:16:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2334 transitions. [2018-11-18 09:16:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-18 09:16:18,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:16:18,127 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:16:18,127 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:16:18,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:16:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1343794107, now seen corresponding path program 1 times [2018-11-18 09:16:18,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:16:18,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:16:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:18,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:16:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-18 09:16:18,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:16:18,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:16:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:16:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:16:18,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:16:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 213 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-18 09:16:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:16:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 09:16:18,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:16:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:16:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:16:18,485 INFO L87 Difference]: Start difference. First operand 2170 states and 2334 transitions. Second operand 8 states. [2018-11-18 09:16:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:16:18,879 INFO L93 Difference]: Finished difference Result 3409 states and 3666 transitions. [2018-11-18 09:16:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:16:18,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 329 [2018-11-18 09:16:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:16:18,881 INFO L225 Difference]: With dead ends: 3409 [2018-11-18 09:16:18,881 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:16:18,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:16:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:16:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:16:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:16:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:16:18,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2018-11-18 09:16:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:16:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:16:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:16:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:16:18,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:16:18,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:16:21,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:16:21,595 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 159 [2018-11-18 09:16:21,850 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:23,322 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 181 DAG size of output: 95 [2018-11-18 09:16:23,534 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:23,944 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2018-11-18 09:16:24,412 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2018-11-18 09:16:24,519 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2018-11-18 09:16:24,910 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 131 [2018-11-18 09:16:25,112 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2018-11-18 09:16:25,263 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2018-11-18 09:16:25,860 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2018-11-18 09:16:26,169 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 111 [2018-11-18 09:16:26,837 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 89 [2018-11-18 09:16:27,111 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:27,547 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-18 09:16:27,923 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 131 [2018-11-18 09:16:28,360 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2018-11-18 09:16:29,078 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 91 [2018-11-18 09:16:30,065 WARN L180 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 105 [2018-11-18 09:16:30,488 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2018-11-18 09:16:31,457 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 98 [2018-11-18 09:16:33,269 WARN L180 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-11-18 09:16:34,135 WARN L180 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2018-11-18 09:16:34,422 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:34,795 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2018-11-18 09:16:35,487 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 97 [2018-11-18 09:16:35,867 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2018-11-18 09:16:36,171 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2018-11-18 09:16:37,041 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 137 [2018-11-18 09:16:38,159 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2018-11-18 09:16:39,173 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2018-11-18 09:16:39,275 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2018-11-18 09:16:39,481 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:40,354 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 86 [2018-11-18 09:16:40,728 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2018-11-18 09:16:41,198 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2018-11-18 09:16:41,817 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2018-11-18 09:16:42,266 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 118 [2018-11-18 09:16:42,578 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-18 09:16:42,867 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2018-11-18 09:16:43,732 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 101 [2018-11-18 09:16:44,381 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2018-11-18 09:16:46,088 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 216 DAG size of output: 168 [2018-11-18 09:16:46,345 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-11-18 09:16:46,865 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2018-11-18 09:16:47,068 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:47,940 WARN L180 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 89 [2018-11-18 09:16:48,144 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 111 [2018-11-18 09:16:48,370 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2018-11-18 09:16:49,075 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 128 [2018-11-18 09:16:49,630 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-11-18 09:16:51,135 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 216 DAG size of output: 168 [2018-11-18 09:16:51,138 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 108) no Hoare annotation was computed. [2018-11-18 09:16:51,139 INFO L421 ceAbstractionStarter]: At program point L95-2(lines 83 114) the Hoare annotation is: (let ((.cse41 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse30 (<= ~token~0 ~local~0)) (.cse31 (= ~E_2~0 |old(~E_2~0)|)) (.cse32 (<= ~local~0 ~token~0)) (.cse29 (<= ~t1_pc~0 0)) (.cse37 (= ~m_st~0 0)) (.cse38 (= ~token~0 |old(~token~0)|)) (.cse39 (= |old(~E_2~0)| ~E_2~0)) (.cse36 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (= 0 |old(~t2_st~0)|))) (.cse33 (< 0 |old(~t1_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse5 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_1~0)) (.cse24 (not (= 1 ~t1_i~0))) (.cse28 (= |old(~t1_st~0)| 0)) (.cse20 (= 0 ~t2_st~0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse15 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~m_st~0)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (<= 2 ~t2_st~0)) (.cse17 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse18 (<= 2 ~E_2~0)) (.cse21 (<= (+ ~local~0 1) ~token~0)) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse4 (< |old(~token~0)| ~local~0)) (.cse9 (= 1 ~E_M~0)) (.cse35 (not .cse12)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse22 (not .cse41)) (.cse23 (= 0 ~E_1~0)) (.cse25 (< |old(~E_2~0)| 2)) (.cse26 (not (= 1 ~t2_i~0))) (.cse27 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 (and .cse29 .cse16 .cse19 .cse20 .cse30 .cse31 .cse32) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse33) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse13 .cse24 .cse28 .cse34 .cse4 .cse9 .cse35 .cse10 .cse36 .cse11 .cse23 (and .cse29 .cse37 .cse38 .cse39 .cse19 .cse40) .cse25 .cse26 .cse27 .cse33 .cse41) (or .cse0 .cse34 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse35 .cse10 .cse11 .cse13 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse33 (and .cse29 .cse16 .cse19 .cse40 .cse30 .cse31 .cse32)) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse12 .cse13 .cse24 .cse28 .cse4 (and .cse29 .cse37 .cse38 .cse39 .cse19 .cse20) .cse9 .cse10 .cse36 .cse11 .cse14 .cse23 .cse25 .cse26 .cse27 .cse33 .cse41) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse13 .cse24 .cse28 (and .cse15 .cse16 .cse19 .cse20 .cse17 .cse18 .cse21) .cse34 (and .cse15 .cse16 .cse19 .cse40 .cse17 .cse18 .cse21) .cse3 .cse4 .cse9 .cse35 .cse10 .cse11 .cse22 .cse23 .cse25 .cse26 .cse27)))) [2018-11-18 09:16:51,139 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-11-18 09:16:51,139 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0))) (let ((.cse6 (<= ~t1_pc~0 0)) (.cse7 (= ~m_st~0 0)) (.cse35 (<= 2 ~t2_st~0)) (.cse31 (< |old(~t2_st~0)| 2)) (.cse33 (not .cse12)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse26 (< 0 |old(~t1_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse32 (not (= |old(~t1_pc~0)| 1))) (.cse16 (< |old(~token~0)| ~local~0)) (.cse28 (< |old(~m_st~0)| 2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse18 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse13 (= 1 ~E_1~0)) (.cse21 (not (= 0 |old(~t2_st~0)|))) (.cse30 (not .cse27)) (.cse22 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse23 (< |old(~E_2~0)| 2)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse15 (= |old(~t1_st~0)| 0)) (.cse34 (= 1 ~t1_pc~0)) (.cse29 (<= 2 ~m_st~0)) (.cse8 (= ~token~0 |old(~token~0)|)) (.cse9 (= |old(~E_2~0)| ~E_2~0)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (= 0 ~t2_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse16 .cse28 .cse3 (and .cse6 .cse29 .cse8 .cse9 .cse10 .cse11) .cse4 .cse5 .cse17 .cse18 .cse20 .cse12 .cse13 .cse21 .cse30 .cse22 .cse14 .cse23 .cse24 .cse25 .cse15 .cse26) (or .cse0 .cse31 .cse1 .cse2 .cse32 .cse16 .cse28 .cse3 .cse4 .cse5 .cse17 .cse33 .cse18 .cse20 .cse13 (and .cse34 .cse29 .cse8 .cse9 .cse10 .cse35) .cse30 .cse22 .cse14 .cse23 .cse24 .cse25 .cse15) (or .cse0 .cse31 .cse1 .cse2 .cse16 .cse28 .cse3 .cse4 .cse5 .cse17 .cse33 .cse18 .cse20 .cse13 .cse30 .cse22 .cse14 .cse23 .cse24 .cse25 (and .cse6 .cse29 .cse8 .cse9 .cse10 .cse35) .cse15 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse15 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse35) .cse31 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse32 .cse16 .cse28 .cse3 .cse4 .cse5 .cse17 .cse18 .cse20 .cse12 .cse13 .cse21 .cse30 .cse22 .cse14 .cse23 .cse24 .cse25 .cse15 (and .cse34 .cse29 .cse8 .cse9 .cse10 .cse11))))) [2018-11-18 09:16:51,139 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-18 09:16:51,139 INFO L421 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse21 (= 1 ~m_pc~0)) (.cse11 (= 1 ~t2_pc~0))) (let ((.cse22 (< |old(~t2_st~0)| 2)) (.cse24 (not .cse11)) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse20 (< 0 |old(~t1_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse26 (not (= |old(~t1_pc~0)| 1))) (.cse3 (< |old(~token~0)| ~local~0)) (.cse23 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse25 (not .cse21)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< |old(~E_2~0)| 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse27 (= 1 ~t1_pc~0)) (.cse28 (<= 2 ~m_st~0)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse30 (= |old(~E_2~0)| ~E_2~0)) (.cse31 (= ~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) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse10 .cse12 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse22 .cse1 .cse2 .cse26 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse10 .cse12 (and .cse27 .cse28 .cse29 .cse30 .cse31 (<= 2 ~t2_st~0)) .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse27 .cse28 .cse29 .cse30 .cse31 (= 0 ~t2_st~0)))))) [2018-11-18 09:16:51,140 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-11-18 09:16:51,140 INFO L421 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse34 (= 1 ~m_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse24 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (<= 2 ~t1_st~0)) (.cse36 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse37 (<= 2 ~E_2~0)) (.cse35 (= 0 ~t2_st~0)) (.cse38 (<= (+ ~local~0 1) ~token~0))) (let ((.cse29 (<= 2 ~t2_st~0)) (.cse6 (< |old(~m_st~0)| 2)) (.cse1 (and .cse24 .cse25 .cse26 .cse36 .cse37 .cse35 .cse38)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse30 (not .cse13)) (.cse16 (not .cse34)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse14 (= 1 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse22 (= |old(~t1_st~0)| 0)) (.cse5 (< |old(~token~0)| ~local~0)) (.cse10 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse32 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse15 (not (= 0 |old(~t2_st~0)|))) (.cse17 (= 0 ~E_1~0)) (.cse19 (< |old(~E_2~0)| 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse33 (= ~m_st~0 0)) (.cse27 (= ~token~0 |old(~token~0)|)) (.cse28 (= |old(~E_2~0)| ~E_2~0)) (.cse31 (< 0 |old(~t1_pc~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 .cse2 .cse3 .cse5 .cse6 .cse7 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) .cse8 .cse9 .cse10 .cse30 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse31) (or .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse14 .cse18 .cse22 .cse23 .cse5 .cse10 .cse30 .cse11 .cse32 .cse12 (and .cse24 .cse33 .cse26 .cse27 .cse28 .cse29) .cse17 .cse19 .cse20 .cse21 .cse31 .cse34) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse35) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse31) (or .cse0 .cse2 .cse3 (and .cse24 .cse25 .cse26 .cse36 .cse37 .cse29 .cse38) .cse6 .cse7 .cse8 .cse9 .cse14 .cse1 .cse18 .cse22 .cse23 .cse4 .cse5 .cse10 .cse30 .cse11 .cse12 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse13 .cse14 .cse18 .cse22 .cse5 .cse10 .cse11 .cse32 .cse12 .cse15 .cse17 .cse19 .cse20 .cse21 (and .cse24 .cse33 .cse26 .cse27 .cse28 .cse35) .cse31 .cse34)))) [2018-11-18 09:16:51,140 INFO L421 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse29 (= 1 ~t2_pc~0))) (let ((.cse1 (< |old(~t2_st~0)| 2)) (.cse11 (not .cse29)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse31 (< 0 |old(~t1_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse5 (< |old(~token~0)| ~local~0)) (.cse6 (< |old(~m_st~0)| 2)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse21 (not .cse32)) (.cse22 (= 0 ~E_1~0)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (< |old(~E_2~0)| 2)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~m_st~0)) (.cse17 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse18 (not (= ~E_2~0 0))) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse20 (<= (+ ~local~0 1) ~token~0)) (.cse27 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 (<= 2 ~t2_st~0) .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse28 .cse13 .cse29 .cse14 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse31 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse31) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse29 .cse14 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse31 .cse32) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse29 .cse14 .cse30 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ~t2_st~0) .cse20) .cse27)))) [2018-11-18 09:16:51,140 INFO L425 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-11-18 09:16:51,140 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-11-18 09:16:51,141 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse34 (= 1 ~m_pc~0)) (.cse37 (+ ~local~0 1)) (.cse14 (= 1 ~t2_pc~0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse30 (not .cse24)) (.cse28 (= 0 ~t1_st~0)) (.cse33 (< 0 ~t1_pc~0)) (.cse7 (= 0 ~t2_st~0)) (.cse26 (< ~local~0 ~token~0)) (.cse27 (< ~token~0 ~local~0)) (.cse36 (< |old(~t1_st~0)| 2)) (.cse16 (not (= 0 |old(~t2_st~0)|))) (.cse32 (< ~E_2~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse25 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (< |old(~m_st~0)| 2)) (.cse4 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse31 (not .cse14)) (.cse11 (= ~T1_E~0 1)) (.cse12 (< ~token~0 .cse37)) (.cse13 (not (= ~m_i~0 1))) (.cse15 (= 1 ~E_1~0)) (.cse17 (not .cse34)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse29 (<= 2 ~t2_st~0)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (< .cse37 ~token~0)) (.cse22 (= 0 ~E_M~0)) (.cse23 (= 0 ~E_2~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 .cse25 .cse1 .cse26 .cse27 .cse4 (and .cse28 .cse29) .cse8 .cse9 .cse30 .cse10 .cse31 .cse11 .cse13 .cse18 .cse19 .cse32 .cse20 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse26 .cse27 .cse4 .cse8 .cse9 .cse30 .cse10 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse32 .cse20 .cse22 (and .cse28 .cse7) .cse33 .cse34) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse1 (< .cse35 ~token~0) .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse8 .cse9 .cse31 .cse36 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse22 (< ~token~0 .cse35))) (or .cse0 .cse25 .cse1 .cse26 .cse2 .cse27 .cse4 (and .cse6 .cse29) .cse8 .cse9 .cse10 .cse31 .cse36 .cse11 .cse13 .cse18 .cse19 .cse32 .cse20 .cse22) (or .cse0 .cse1 (and .cse6 .cse7) .cse26 .cse2 .cse27 .cse4 .cse8 .cse9 .cse10 .cse36 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse32 .cse20 .cse22 .cse34) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse15 .cse17 (and .cse5 .cse6 .cse29) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)))) [2018-11-18 09:16:51,141 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-11-18 09:16:51,141 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-11-18 09:16:51,141 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse31 (= |old(~t1_st~0)| 0)) (.cse22 (<= 2 ~m_st~0)) (.cse23 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (<= 2 ~t2_st~0)) (.cse36 (= 1 ~m_pc~0)) (.cse39 (+ ~local~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse40 (+ ~local~0 2))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse37 (< .cse40 ~token~0)) (.cse38 (< ~token~0 .cse40)) (.cse24 (= 0 ~t2_st~0)) (.cse12 (< |old(~t1_st~0)| 2)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (< |old(~m_st~0)| 2)) (.cse11 (not .cse27)) (.cse26 (< ~token~0 .cse39)) (.cse16 (not .cse36)) (.cse8 (and .cse22 .cse23 .cse33)) (.cse29 (< .cse39 ~token~0)) (.cse30 (= 0 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 ~token~0)) (.cse7 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse25 (= 1 ~M_E~0)) (.cse34 (not .cse31)) (.cse15 (= 1 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse5 (< ~token~0 ~local~0)) (.cse10 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse17 (= 0 ~E_1~0)) (.cse19 (< ~E_2~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse35 (< 0 ~t1_pc~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 .cse6 .cse7 (and .cse22 .cse23 .cse24) .cse9 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse21 .cse30 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (and .cse32 .cse33) .cse9 .cse25 .cse34 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse8 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (or .cse0 .cse1 .cse8 .cse2 .cse37 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse9 .cse25 .cse34 .cse10 .cse13 .cse14 .cse27 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse32 .cse24) .cse35 .cse36) (or .cse0 .cse2 .cse37 .cse4 .cse6 .cse7 (and .cse22 .cse23) .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse23 .cse33) .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 (and .cse23 .cse24) .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse27 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse13 .cse26 .cse14 .cse15 .cse16 .cse8 .cse17 .cse18 .cse20 .cse29 .cse21 .cse30 .cse31) (or .cse0 .cse2 .cse3 .cse7 .cse9 .cse25 .cse34 .cse27 .cse15 .cse18 (= ~m_st~0 0) .cse5 .cse10 .cse13 (not (= 0 |old(~m_st~0)|)) .cse14 .cse28 .cse17 .cse19 .cse20 .cse21 .cse35 .cse36)))) [2018-11-18 09:16:51,142 INFO L421 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse40 (<= 2 ~m_st~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (<= 2 ~t2_st~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse41 (+ ~local~0 2)) (.cse37 (= |old(~t1_st~0)| 0)) (.cse42 (+ ~local~0 1))) (let ((.cse27 (< ~token~0 .cse42)) (.cse30 (< .cse42 ~token~0)) (.cse36 (= 0 ~E_2~0)) (.cse32 (not .cse37)) (.cse25 (not (= 0 |old(~t2_st~0)|))) (.cse34 (< 0 ~t1_pc~0)) (.cse35 (= 0 ~t1_st~0)) (.cse19 (= activate_threads_~tmp~1 0)) (.cse23 (= 0 ~t2_st~0)) (.cse38 (< .cse41 ~token~0)) (.cse8 (= 1 ~M_E~0)) (.cse33 (= ~m_st~0 0)) (.cse39 (< ~token~0 .cse41)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 ~token~0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~token~0 ~local~0)) (.cse26 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not .cse24)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse28 (= 1 ~E_1~0)) (.cse31 (and .cse40 .cse21 .cse22)) (.cse29 (not .cse20)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse21 .cse22) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse21 .cse19 .cse23) .cse9 .cse11 .cse12 .cse13 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse26 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse31) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse8 .cse32 .cse24 .cse28 .cse15 .cse5 .cse9 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse33 .cse34 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse32 .cse9 .cse10 .cse12 (and .cse35 .cse19 .cse22) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse34 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse28 .cse31 .cse29 .cse14 .cse15 .cse17 .cse30 .cse18 .cse36 .cse37) (or .cse0 .cse1 .cse2 .cse38 .cse4 .cse26 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39) (or .cse0 (and .cse40 .cse21 .cse23) .cse2 .cse4 .cse26 .cse6 .cse7 .cse8 .cse9 .cse12 .cse27 .cse13 .cse24 .cse28 .cse25 .cse29 .cse14 .cse15 .cse17 .cse30 .cse18 .cse36 .cse37) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse32 .cse9 .cse12 .cse13 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse34 .cse20 (and .cse35 .cse19 .cse23)) (or .cse0 .cse2 .cse38 .cse4 .cse26 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (and .cse33 .cse21 .cse9) .cse13 .cse28 (and .cse21 .cse40) .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse31 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-11-18 09:16:51,142 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse31 (= |old(~t1_st~0)| 0)) (.cse22 (<= 2 ~m_st~0)) (.cse23 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (<= 2 ~t2_st~0)) (.cse36 (= 1 ~m_pc~0)) (.cse39 (+ ~local~0 1)) (.cse27 (= 1 ~t2_pc~0)) (.cse40 (+ ~local~0 2))) (let ((.cse32 (= 0 ~t1_st~0)) (.cse37 (< .cse40 ~token~0)) (.cse38 (< ~token~0 .cse40)) (.cse24 (= 0 ~t2_st~0)) (.cse12 (< |old(~t1_st~0)| 2)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (< |old(~m_st~0)| 2)) (.cse11 (not .cse27)) (.cse26 (< ~token~0 .cse39)) (.cse16 (not .cse36)) (.cse8 (and .cse22 .cse23 .cse33)) (.cse29 (< .cse39 ~token~0)) (.cse30 (= 0 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 ~token~0)) (.cse7 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse25 (= 1 ~M_E~0)) (.cse34 (not .cse31)) (.cse15 (= 1 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse5 (< ~token~0 ~local~0)) (.cse10 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse28 (not (= 0 |old(~t2_st~0)|))) (.cse17 (= 0 ~E_1~0)) (.cse19 (< ~E_2~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse35 (< 0 ~t1_pc~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 .cse6 .cse7 (and .cse22 .cse23 .cse24) .cse9 .cse25 .cse10 .cse13 .cse26 .cse14 .cse27 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse29 .cse21 .cse30 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (and .cse32 .cse33) .cse9 .cse25 .cse34 .cse10 .cse11 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse8 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) (or .cse0 .cse1 .cse8 .cse2 .cse37 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse9 .cse25 .cse34 .cse10 .cse13 .cse14 .cse27 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse32 .cse24) .cse35 .cse36) (or .cse0 .cse2 .cse37 .cse4 .cse6 .cse7 (and .cse22 .cse23) .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (and .cse23 .cse33) .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse2 (and .cse23 .cse24) .cse3 .cse4 .cse5 .cse7 .cse9 .cse25 .cse10 .cse12 .cse13 .cse14 .cse27 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse13 .cse26 .cse14 .cse15 .cse16 .cse8 .cse17 .cse18 .cse20 .cse29 .cse21 .cse30 .cse31) (or .cse0 .cse2 .cse3 .cse7 .cse9 .cse25 .cse34 .cse27 .cse15 .cse18 (= ~m_st~0 0) .cse5 .cse10 .cse13 (not (= 0 |old(~m_st~0)|)) .cse14 .cse28 .cse17 .cse19 .cse20 .cse21 .cse35 .cse36)))) [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-11-18 09:16:51,142 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-11-18 09:16:51,143 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-18 09:16:51,143 INFO L421 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse34 (= |old(~t1_st~0)| 0)) (.cse18 (= 1 ~t2_pc~0)) (.cse25 (= 1 ~m_pc~0)) (.cse42 (+ ~local~0 1)) (.cse35 (<= 2 ~m_st~0)) (.cse6 (= activate_threads_~tmp___0~0 0)) (.cse9 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse37 (<= 2 ~t2_st~0)) (.cse43 (+ ~local~0 2))) (let ((.cse33 (= 0 ~E_2~0)) (.cse39 (= ~m_st~0 0)) (.cse40 (< .cse43 ~token~0)) (.cse41 (< ~token~0 .cse43)) (.cse30 (and .cse35 .cse6 .cse9 .cse37)) (.cse27 (< |old(~m_st~0)| 2)) (.cse29 (< ~token~0 .cse42)) (.cse31 (not .cse25)) (.cse32 (< .cse42 ~token~0)) (.cse26 (< |old(~t2_st~0)| 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse28 (not .cse18)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse36 (not .cse34)) (.cse14 (= 1 ~E_M~0)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= ~m_i~0 1))) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse20 (= 0 ~E_1~0)) (.cse13 (= 0 ~t1_st~0)) (.cse7 (= activate_threads_~tmp~1 0)) (.cse8 (= 0 ~t2_st~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (< ~E_2~0 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse38 (< 0 ~t1_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (and .cse6 .cse7 .cse8) .cse9) .cse10 .cse11 (and .cse12 .cse13 .cse7 .cse8) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse26 .cse1 .cse3 .cse27 .cse5 .cse10 .cse11 .cse14 .cse28 .cse16 .cse29 .cse17 .cse12 .cse30 .cse31 .cse20 .cse21 .cse23 .cse32 .cse24 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse27 .cse5 .cse10 .cse11 .cse14 .cse16 .cse29 .cse17 .cse18 .cse12 .cse19 .cse31 (and .cse35 .cse6 .cse9 .cse8) .cse20 .cse21 .cse23 .cse32 .cse24 .cse33 .cse34) (or .cse0 .cse26 .cse1 .cse2 .cse4 .cse5 .cse10 .cse11 .cse36 .cse14 .cse28 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse6 .cse13 .cse7 .cse37) .cse38 .cse25) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse10 .cse14 .cse28 .cse15 .cse16 .cse17 .cse12 .cse30 .cse31 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse5 .cse10 .cse11 .cse36 .cse18 .cse12 .cse21 .cse4 .cse14 .cse16 (not (= 0 |old(~m_st~0)|)) .cse39 .cse17 .cse19 .cse20 .cse22 .cse23 .cse24 .cse38 .cse25) (or .cse0 .cse1 .cse40 .cse3 .cse27 .cse5 (and .cse39 .cse6 .cse9 .cse14) .cse10 .cse11 .cse28 .cse15 .cse16 .cse17 .cse12 .cse31 .cse20 .cse21 .cse22 (and (and .cse35 .cse6) .cse9) .cse23 .cse24 .cse41) (or .cse0 .cse26 .cse1 .cse40 .cse3 .cse27 .cse5 .cse10 .cse30 .cse14 .cse28 .cse15 .cse16 .cse17 .cse12 .cse31 .cse20 .cse21 .cse22 .cse23 .cse24 .cse41) (or .cse0 .cse26 .cse30 .cse1 .cse3 .cse27 .cse5 .cse10 .cse14 .cse28 .cse15 .cse16 .cse29 .cse17 .cse12 .cse31 .cse20 .cse21 .cse22 .cse23 .cse32 .cse24) (or .cse0 .cse26 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 .cse14 .cse28 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 (and .cse12 .cse13 .cse37) .cse14 .cse28 .cse15 .cse16 .cse17 .cse20 (and .cse37 .cse6 .cse9) .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse11 .cse36 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse6 .cse13 .cse7 .cse8) .cse21 .cse22 .cse23 .cse24 .cse38 .cse25)))) [2018-11-18 09:16:51,143 INFO L421 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0)) (.cse27 (+ ~local~0 1))) (let ((.cse20 (< 0 ~t1_pc~0)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse4 (< |old(~m_st~0)| 2)) (.cse23 (< |old(~token~0)| .cse27)) (.cse14 (not .cse26)) (.cse24 (< .cse27 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse21 (not (= ~t1_pc~0 1))) (.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)|)) (.cse22 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~t2_pc~0)|)) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< ~E_2~0 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~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 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 (and (<= 2 ~m_st~0) (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|)) .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse23 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26)))) [2018-11-18 09:16:51,144 INFO L421 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse40 (= 1 ~m_pc~0)) (.cse6 (<= 2 ~m_st~0)) (.cse37 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (= 1 ~t2_pc~0)) (.cse38 (= ~token~0 |old(~token~0)|)) (.cse39 (= 0 ~t1_st~0)) (.cse12 (<= 2 ~t2_st~0)) (.cse42 (+ ~local~0 1))) (let ((.cse35 (< 0 ~t1_pc~0)) (.cse20 (< |old(~token~0)| .cse42)) (.cse28 (< .cse42 |old(~token~0)|)) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse34 (and .cse6 .cse37 .cse10 .cse38 .cse39 .cse12)) (.cse3 (< |old(~m_st~0)| 2)) (.cse23 (not .cse40)) (.cse41 (and .cse6 .cse37 .cse10 .cse38 .cse11 .cse12)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse31 (< ~local~0 |old(~token~0)|)) (.cse2 (not (= ~t1_pc~0 1))) (.cse32 (< |old(~token~0)| ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse16 (= 1 |old(~E_M~0)|)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse19 (= ~T1_E~0 1)) (.cse36 (not (= 0 |old(~m_st~0)|))) (.cse21 (not (= ~m_i~0 1))) (.cse17 (= 1 |old(~t2_pc~0)|)) (.cse22 (= 1 ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse24 (= 0 ~E_1~0)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (< ~E_2~0 2)) (.cse27 (not (= 1 ~t2_i~0))) (.cse29 (= 0 |old(~E_M~0)|))) (and (let ((.cse30 (+ ~local~0 2))) (let ((.cse7 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_M~0 1))) (.cse9 (<= ~token~0 .cse30)) (.cse13 (<= .cse30 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 (and .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse16 (not .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) (or .cse0 .cse1 .cse31 .cse32 .cse3 .cse4 .cse5 .cse14 .cse33 .cse16 .cse19 .cse21 .cse17 .cse22 .cse23 .cse24 .cse34 .cse25 .cse26 .cse27 .cse29 .cse35) (or .cse0 .cse1 .cse31 .cse32 .cse4 .cse5 .cse14 .cse33 .cse16 .cse19 .cse36 .cse21 .cse17 .cse22 (and .cse15 .cse37 .cse10 .cse38 .cse39 .cse12) .cse24 .cse25 .cse26 .cse27 .cse29 .cse35 .cse40) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse17 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse41) (or .cse0 .cse1 .cse31 .cse2 .cse32 .cse3 .cse4 .cse5 .cse14 .cse33 .cse16 .cse19 .cse21 .cse17 .cse22 .cse34 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse31 .cse2 .cse32 .cse3 .cse4 .cse5 .cse14 .cse16 .cse18 .cse19 .cse21 .cse17 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse31 .cse2 .cse32 .cse4 .cse5 .cse14 .cse16 .cse18 .cse19 .cse36 .cse21 .cse17 .cse22 (and .cse15 .cse37 .cse10 .cse38 .cse11 .cse12) .cse24 .cse25 .cse26 .cse27 .cse29 .cse40)))) [2018-11-18 09:16:51,144 INFO L425 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-11-18 09:16:51,144 INFO L421 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0)) (.cse28 (+ ~local~0 1))) (let ((.cse20 (< 0 ~t1_pc~0)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse4 (< |old(~m_st~0)| 2)) (.cse26 (< |old(~token~0)| .cse28)) (.cse14 (not .cse24)) (.cse27 (< .cse28 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse21 (not (= ~t1_pc~0 1))) (.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)|)) (.cse22 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~t2_pc~0)|)) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< ~E_2~0 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~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 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 (let ((.cse25 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse25) (= 1 ~t2_pc~0) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse25 ~token~0))) .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse23 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse24)))) [2018-11-18 09:16:51,144 INFO L425 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-18 09:16:51,144 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-11-18 09:16:51,145 INFO L421 ceAbstractionStarter]: At program point L131-2(lines 119 150) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse40 (+ ~local~0 1)) (.cse30 (<= 2 ~m_st~0)) (.cse39 (= 0 ~t1_st~0)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse26 (and .cse30 .cse39 .cse4 .cse5 .cse6)) (.cse8 (not (= ~t1_pc~0 1))) (.cse27 (< |old(~m_st~0)| 2)) (.cse3 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse14 (< |old(~t1_st~0)| 2)) (.cse35 (< |old(~token~0)| .cse40)) (.cse29 (not .cse25)) (.cse36 (< .cse40 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse7 (< ~local~0 |old(~token~0)|)) (.cse9 (< |old(~token~0)| ~local~0)) (.cse10 (= ~T2_E~0 0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse28 (not (= |old(~t1_st~0)| 0))) (.cse13 (= 1 |old(~E_M~0)|)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse17 (not (= ~m_i~0 1))) (.cse18 (= 1 |old(~t2_pc~0)|)) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 0 ~E_1~0)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (< ~E_2~0 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 |old(~E_M~0)|)) (.cse2 (= ~m_st~0 0)) (.cse38 (< 0 ~t1_pc~0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse28 .cse13 .cse15 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse37 (+ ~local~0 2))) (let ((.cse31 (not (= ~E_M~0 0))) (.cse32 (<= .cse37 ~token~0)) (.cse33 (not (= ~E_M~0 1))) (.cse34 (<= ~token~0 .cse37))) (or .cse0 .cse1 .cse8 (and .cse30 .cse3 .cse31 .cse32 .cse33 .cse34) .cse27 .cse10 .cse11 .cse12 .cse13 (not .cse18) .cse14 .cse15 (and .cse3 (and .cse2 .cse31) .cse32 .cse33 .cse34) .cse35 .cse17 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse36 .cse24))) (or (and .cse30 .cse3 .cse4 .cse5 .cse6) .cse0 .cse1 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse7 .cse9 .cse27 .cse10 .cse26 .cse11 .cse12 .cse28 .cse13 .cse15 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24 .cse38) (or .cse0 .cse1 .cse8 .cse27 .cse10 (and (= ~token~0 |old(~token~0)|) .cse30 .cse3 .cse6) .cse11 .cse12 .cse13 .cse14 .cse15 .cse35 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse36 .cse24) (or .cse0 .cse1 .cse7 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and (and .cse2 .cse39) .cse4 .cse5 .cse6) .cse38 .cse25)))) [2018-11-18 09:16:51,145 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-11-18 09:16:51,145 INFO L421 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse36 (+ ~local~0 1)) (.cse35 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse26 (not (= ~t2_pc~0 1))) (.cse34 (<= 2 ~m_st~0)) (.cse28 (= |old(~E_M~0)| ~E_M~0)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse30 (= 0 ~t1_st~0))) (let ((.cse10 (and .cse26 .cse34 .cse28 .cse29 .cse30)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse24 (< 0 ~t1_pc~0)) (.cse22 (and .cse26 .cse34 .cse28 .cse29 .cse35)) (.cse5 (< |old(~m_st~0)| 2)) (.cse32 (< |old(~token~0)| .cse36)) (.cse16 (not .cse31)) (.cse33 (< .cse36 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< ~local~0 |old(~token~0)|)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (< |old(~token~0)| ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse23 (< |old(~t1_st~0)| 2)) (.cse12 (= ~T1_E~0 1)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~t2_pc~0)|)) (.cse15 (= 1 ~E_1~0)) (.cse27 (= ~m_st~0 0)) (.cse17 (= 0 ~E_1~0)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (< ~E_2~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 |old(~E_M~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 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse10 .cse24) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 (and .cse26 .cse27 .cse28 .cse29 .cse30) .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse31) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse23 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21 .cse22) (or .cse0 .cse1 (and .cse34 .cse28 (= 1 ~t2_pc~0) .cse29 .cse35) .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 (not .cse14) .cse23 .cse12 .cse32 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse11 .cse23 .cse12 .cse25 .cse13 .cse14 .cse15 (and .cse26 .cse27 .cse28 .cse29 .cse35) .cse17 .cse18 .cse19 .cse20 .cse21 .cse31)))) [2018-11-18 09:16:51,145 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-18 09:16:51,145 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-11-18 09:16:51,145 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-11-18 09:16:51,145 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-11-18 09:16:51,146 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-11-18 09:16:51,146 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-11-18 09:16:51,146 INFO L421 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse26 (= 1 ~t2_pc~0))) (let ((.cse9 (< ~t2_st~0 2)) (.cse13 (not .cse26)) (.cse25 (not (= ~t1_st~0 0))) (.cse15 (not (= 0 ~m_st~0))) (.cse29 (< 0 ~t1_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (< ~local~0 ~token~0)) (.cse11 (not (= ~t1_pc~0 1))) (.cse23 (< ~token~0 ~local~0)) (.cse24 (< ~m_st~0 2)) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse12 (= 1 ~E_M~0)) (.cse6 (< ~t1_st~0 2)) (.cse14 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse7 (= 1 ~E_1~0)) (.cse27 (not (= 0 ~t2_st~0))) (.cse17 (not .cse28)) (.cse18 (= 0 ~E_1~0)) (.cse8 (not (= 1 ~t1_i~0))) (.cse19 (< ~E_2~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse5 (= exists_runnable_thread_~__retres1~3 1))) (and (let ((.cse10 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse10))) (or .cse0 .cse5 .cse9 .cse1 .cse22 .cse11 .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse12 .cse13 .cse14 .cse16 .cse7 .cse17 .cse18 .cse8 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse2 .cse3 .cse4 .cse6 .cse26 .cse7 .cse8 .cse11 .cse23 .cse12 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21 .cse28) (or .cse0 .cse1 .cse22 .cse11 .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse12 .cse14 .cse5 .cse16 .cse26 .cse7 .cse27 .cse17 .cse18 .cse8 .cse19 .cse20 .cse21) (or .cse0 .cse9 .cse1 .cse22 .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse12 .cse13 .cse14 .cse16 .cse7 .cse5 .cse17 .cse18 .cse8 .cse19 .cse20 .cse21 .cse29) (or .cse0 .cse1 .cse22 .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse12 .cse14 .cse16 .cse26 .cse7 .cse27 .cse17 .cse18 .cse8 .cse19 .cse5 .cse20 .cse21 .cse29) (or .cse0 .cse5 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse28) (let ((.cse30 (+ ~local~0 1))) (or .cse0 .cse1 .cse11 .cse24 .cse2 .cse5 .cse3 .cse4 .cse12 .cse6 .cse14 (< ~token~0 .cse30) .cse16 .cse7 .cse27 .cse17 .cse18 .cse8 .cse19 .cse20 (< .cse30 ~token~0) .cse21)) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse25 .cse7 .cse8 .cse9 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse5 .cse19 .cse20 .cse21 .cse29 .cse28) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse25 .cse26 .cse7 .cse8 .cse5 .cse23 .cse12 .cse14 .cse15 .cse16 .cse27 .cse18 .cse19 .cse20 .cse21 .cse29 .cse28) (or .cse0 .cse1 .cse22 .cse11 .cse23 .cse24 .cse2 .cse3 .cse4 .cse12 .cse6 .cse14 .cse16 .cse26 .cse7 .cse27 .cse17 .cse18 .cse8 .cse19 .cse20 .cse21 .cse5)))) [2018-11-18 09:16:51,146 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-11-18 09:16:51,146 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L421 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse34 (+ ~local~0 2)) (.cse28 (= ~t1_st~0 0)) (.cse35 (+ ~local~0 1))) (let ((.cse12 (not (= 0 ~t2_st~0))) (.cse23 (< ~token~0 .cse35)) (.cse26 (< .cse35 ~token~0)) (.cse27 (= 0 ~E_2~0)) (.cse30 (< ~t2_st~0 2)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse7 (not .cse28)) (.cse19 (< 0 ~t1_pc~0)) (.cse22 (< ~m_st~0 2)) (.cse17 (= 0 ~E_M~0)) (.cse8 (= 1 ~E_M~0)) (.cse0 (= ~T1_E~0 0)) (.cse18 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse1 (= ~T2_E~0 1)) (.cse32 (< .cse34 ~token~0)) (.cse21 (not (= ~t1_pc~0 1))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse31 (not .cse11)) (.cse29 (< ~t1_st~0 2)) (.cse9 (= ~T1_E~0 1)) (.cse10 (not (= ~m_i~0 1))) (.cse24 (= 1 ~E_1~0)) (.cse25 (not .cse20)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (< ~E_2~0 2)) (.cse16 (not (= 1 ~t2_i~0))) (.cse33 (< ~token~0 .cse34))) (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 .cse1 .cse21 .cse18 .cse22 .cse4 .cse5 .cse6 .cse8 .cse9 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse14 .cse16 .cse26 .cse17 .cse27 .cse28) (or .cse18 .cse0 .cse1 .cse24 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20) (or .cse0 .cse30 .cse1 .cse21 .cse18 .cse22 .cse4 .cse5 .cse8 .cse31 .cse29 .cse9 .cse23 .cse10 .cse24 .cse25 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17) (or .cse0 .cse30 .cse1 .cse2 .cse21 .cse3 .cse22 .cse4 .cse5 .cse8 .cse31 .cse29 .cse9 .cse10 .cse24 .cse18 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse30 .cse1 .cse18 .cse32 .cse21 .cse22 .cse4 .cse5 .cse8 .cse31 .cse29 .cse9 .cse10 .cse24 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse33) (or .cse0 .cse30 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse31 .cse29 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24) (or .cse0 .cse30 .cse18 .cse1 .cse21 .cse22 .cse4 .cse5 .cse6 .cse8 .cse31 .cse9 .cse23 .cse10 .cse24 .cse25 .cse13 .cse14 .cse16 .cse26 .cse17 .cse27 .cse28) (or .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse31 .cse18 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (or .cse29 .cse18 (or .cse0 .cse1 .cse22 .cse4 .cse5 .cse6 .cse31 .cse9 .cse10 .cse24 .cse25 .cse13 .cse14 .cse16 .cse17) .cse32 .cse21 .cse15 .cse33) (or (not .cse8) .cse0 .cse18 .cse1 .cse32 .cse21 .cse4 .cse5 .cse6 .cse31 .cse29 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse24 .cse25 .cse13 .cse14 .cse15 .cse16 .cse33)))) [2018-11-18 09:16:51,147 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-11-18 09:16:51,147 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse18 (= 1 ~m_pc~0)) (.cse6 (= 1 ~t2_pc~0))) (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse9 (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))) (.cse19 (< ~t2_st~0 2)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (< ~local~0 ~token~0)) (.cse20 (not (= ~t1_pc~0 1))) (.cse10 (< ~token~0 ~local~0)) (.cse21 (< ~m_st~0 2)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse22 (not .cse6)) (.cse23 (< ~t1_st~0 2)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse13 (not (= ~m_i~0 1))) (.cse7 (= 1 |old(~E_1~0)|)) (.cse25 (not .cse18)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ~m_st~0)) .cse13 (not (= 0 ~t2_st~0)) .cse14 .cse15 .cse16 .cse17 (< 0 ~t1_pc~0) .cse18) (let ((.cse24 (+ ~local~0 1))) (or .cse0 .cse19 .cse1 .cse20 .cse9 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 (< ~token~0 .cse24) .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse16 (< .cse24 ~token~0) .cse17)) (let ((.cse26 (+ ~local~0 2))) (or .cse0 .cse19 .cse1 (< .cse26 ~token~0) .cse20 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17 (< ~token~0 .cse26))) (or .cse0 .cse9 .cse19 .cse1 .cse2 .cse20 .cse10 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse16 .cse17)))) [2018-11-18 09:16:51,147 INFO L425 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L421 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) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (not (= 1 ~t1_i~0)) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (< ~token~0 ~local~0) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (= 0 ~E_1~0) (< ~E_2~0 2) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (< 0 ~t1_pc~0) (= 1 ~m_pc~0)) [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-11-18 09:16:51,148 INFO L425 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-11-18 09:16:51,149 INFO L421 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (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)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~t2_i~0)|) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 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(~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)) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,149 INFO L421 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (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)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~t2_i~0)|) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 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(~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)) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,149 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (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)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~t2_i~0)|) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~t2_st~0)|)) (= 0 |old(~E_1~0)|) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 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(~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)) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,149 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-11-18 09:16:51,149 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-11-18 09:16:51,149 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 09:16:51,150 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 09:16:51,150 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 09:16:51,150 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 09:16:51,150 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-11-18 09:16:51,150 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-18 09:16:51,158 INFO L421 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse11 (= 1 ~t2_pc~0))) (let ((.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse21 (not (= ~t1_pc~0 1))) (.cse22 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse24 (not .cse11)) (.cse9 (= ~T1_E~0 1)) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (< 0 ~t1_pc~0)) (.cse20 (= 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 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse23 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse24 .cse22 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (let ((.cse25 (+ |old(~local~0)| 2))) (or .cse0 .cse23 .cse1 (< .cse25 |old(~token~0)|) .cse21 .cse4 .cse5 .cse6 .cse8 .cse24 (let ((.cse26 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse26) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse26 ~token~0))) .cse22 .cse9 .cse10 .cse12 (not .cse20) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse25))) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-18 09:16:51,158 INFO L421 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse21 (= 1 ~t2_pc~0)) (.cse6 (= ~T2_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse9 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse35 (<= 2 ~t2_st~0)) (.cse39 (not .cse0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse34 (= 0 ~t1_st~0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= 0 ~t2_st~0)) (.cse12 (= 1 ~m_pc~0)) (.cse13 (not (= ~E_1~0 0))) (.cse14 (<= ~local~0 ~token~0))) (let ((.cse5 (and .cse7 .cse8 .cse34 .cse10 .cse11 .cse12 .cse13 .cse14)) (.cse23 (not (= 0 |old(~t2_st~0)|))) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse31 (< 0 ~t1_pc~0)) (.cse32 (< |old(~t2_st~0)| 2)) (.cse36 (and .cse7 .cse8 .cse34 .cse10 .cse35 .cse39 .cse12 .cse13 .cse14)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (< |old(~token~0)| |old(~local~0)|)) (.cse38 (and (= 1 ~t1_pc~0) (not .cse6) (not .cse1) (not (= ~M_E~0 0)) .cse7 .cse8 .cse9 .cse10 .cse35 .cse39 .cse12 .cse13 .cse14)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse33 (not .cse21)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse22 (= 1 |old(~E_1~0)|)) (.cse24 (= 0 |old(~E_1~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (< ~E_2~0 2)) (.cse27 (not (= 1 ~t2_i~0))) (.cse28 (= 0 ~E_M~0)) (.cse29 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse15 .cse16 .cse30 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse31 .cse29) (or .cse0 .cse32 .cse1 .cse2 .cse4 .cse6 .cse15 .cse16 .cse30 .cse17 .cse33 .cse19 (and .cse7 .cse8 .cse34 .cse10 .cse35 .cse12 .cse13 .cse14) .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse31 .cse29) (let ((.cse37 (+ |old(~local~0)| 2))) (or .cse0 .cse32 .cse36 .cse1 (< .cse37 |old(~token~0)|) .cse3 .cse6 .cse15 .cse38 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse22 (not .cse29) .cse24 .cse25 .cse26 .cse27 .cse28 (< |old(~token~0)| .cse37))) (or .cse0 .cse32 .cse36 .cse1 .cse2 .cse3 .cse4 .cse6 .cse38 .cse15 .cse16 .cse17 .cse33 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))))) [2018-11-18 09:16:51,160 INFO L421 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse11 (= 1 ~t2_pc~0))) (let ((.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse21 (not (= ~t1_pc~0 1))) (.cse22 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse23 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse24 (not .cse11)) (.cse9 (= ~T1_E~0 1)) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (< 0 ~t1_pc~0)) (.cse20 (= 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 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse0 .cse23 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse8 .cse24 .cse22 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (let ((.cse25 (+ |old(~local~0)| 2))) (or .cse0 .cse23 .cse1 (< .cse25 |old(~token~0)|) .cse21 .cse4 .cse5 .cse6 .cse8 .cse24 .cse22 .cse9 .cse10 .cse12 (not .cse20) .cse14 .cse15 .cse16 .cse17 .cse18 (< |old(~token~0)| .cse25))) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-18 09:16:51,160 INFO L421 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse29 (= 1 ~t2_pc~0))) (let ((.cse28 (not (= |old(~t1_st~0)| 0))) (.cse32 (= 0 ~t1_st~0)) (.cse31 (< 0 ~t1_pc~0)) (.cse8 (< |old(~t2_st~0)| 2)) (.cse17 (not .cse29)) (.cse5 (<= 2 ~t2_st~0)) (.cse7 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 1)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse11 (not (= ~t1_pc~0 1))) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse16 (= 1 ~E_M~0)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse21 (= 1 |old(~E_1~0)|)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (< ~E_2~0 2)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse27 (= 1 |old(~m_pc~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) (or .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse19 .cse20 .cse29 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31 (and .cse0 .cse1 .cse2 .cse3 .cse32 .cse33 .cse6) .cse27) (or .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse0 .cse1 .cse2 .cse3 .cse32 .cse5 .cse6) .cse31 .cse27) (let ((.cse34 (+ |old(~local~0)| 2))) (or .cse7 .cse8 .cse9 (< .cse34 |old(~token~0)|) .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 (let ((.cse35 (+ ~local~0 2))) (and .cse0 (<= ~token~0 .cse35) .cse3 .cse4 .cse5 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) .cse18 .cse19 .cse20 .cse21 (not .cse27) .cse22 .cse23 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse34))) (or .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse29 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse33 .cse6) .cse27)))) [2018-11-18 09:16:51,162 INFO L421 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse17 (= 1 ~t2_pc~0))) (let ((.cse12 (= 0 ~t1_st~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse25 (< 0 ~t1_pc~0)) (.cse28 (< |old(~t2_st~0)| 2)) (.cse27 (<= 2 ~t2_st~0)) (.cse29 (not .cse17)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse31 (not (= ~t1_pc~0 1))) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse33 (< |old(~t1_st~0)| 2)) (.cse9 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse20 (= 0 |old(~E_1~0)|)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (< ~E_2~0 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (not (= ~E_1~0 0))) (.cse15 (<= ~local~0 ~token~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or (and .cse10 .cse11 .cse12 .cse27 .cse14 .cse15) .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse30 (+ |old(~local~0)| 2))) (or .cse0 .cse28 .cse1 (< .cse30 |old(~token~0)|) .cse31 (and .cse11 .cse32 .cse27 (= 1 ~m_pc~0) .cse14 .cse15) .cse4 .cse5 .cse6 .cse8 .cse29 .cse33 .cse9 .cse16 .cse18 (not .cse26) .cse20 .cse21 .cse22 .cse23 .cse24 (< |old(~token~0)| .cse30))) (or .cse0 .cse28 (and .cse10 .cse11 .cse32 .cse27 .cse14 .cse15) .cse1 .cse2 .cse31 .cse3 .cse4 .cse5 .cse6 .cse8 .cse29 .cse33 .cse9 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26) (or .cse0 .cse1 .cse2 .cse31 .cse3 .cse4 .cse5 .cse6 .cse8 .cse33 .cse9 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (and .cse10 .cse11 .cse32 .cse13 .cse14 .cse15) .cse26)))) [2018-11-18 09:16:51,163 INFO L425 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-18 09:16:51,163 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 72) no Hoare annotation was computed. [2018-11-18 09:16:51,163 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-18 09:16:51,164 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse29 (= 1 ~t2_pc~0))) (let ((.cse28 (not (= |old(~t1_st~0)| 0))) (.cse32 (= 0 ~t1_st~0)) (.cse31 (< 0 ~t1_pc~0)) (.cse8 (< |old(~t2_st~0)| 2)) (.cse17 (not .cse29)) (.cse5 (<= 2 ~t2_st~0)) (.cse7 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 1)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse11 (not (= ~t1_pc~0 1))) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse16 (= 1 ~E_M~0)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse21 (= 1 |old(~E_1~0)|)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (< ~E_2~0 2)) (.cse25 (not (= 1 ~t2_i~0))) (.cse26 (= 0 ~E_M~0)) (.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse4 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse33 (= 0 ~t2_st~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse27 (= 1 |old(~m_pc~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) (or .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse19 .cse20 .cse29 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31 (and .cse0 .cse1 .cse2 .cse3 .cse32 .cse33 .cse6) .cse27) (or .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse0 .cse1 .cse2 .cse3 .cse32 .cse5 .cse6) .cse31 .cse27) (let ((.cse34 (+ |old(~local~0)| 2))) (or .cse7 .cse8 .cse9 (< .cse34 |old(~token~0)|) .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 (let ((.cse35 (+ ~local~0 2))) (and .cse0 (<= ~token~0 .cse35) .cse3 .cse4 .cse5 (= 1 ~m_pc~0) (<= .cse35 ~token~0))) .cse18 .cse19 .cse20 .cse21 (not .cse27) .cse22 .cse23 .cse24 .cse25 .cse26 (< |old(~token~0)| .cse34))) (or .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse29 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse33 .cse6) .cse27)))) [2018-11-18 09:16:51,166 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-11-18 09:16:51,166 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse19 (= |old(~M_E~0)| ~M_E~0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= ~T2_E~0 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= 1 ~t2_pc~0))) (.cse11 (< ~t1_st~0 2)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_1~0)) (.cse15 (not (= 1 ~m_pc~0))) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (< ~E_2~0 2)) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0))) (and (let ((.cse3 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse3))) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse22) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (< .cse22 ~token~0) .cse21)) (or .cse0 .cse19 .cse1 .cse2 (< ~local~0 ~token~0) .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21))) [2018-11-18 09:16:51,166 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-11-18 09:16:51,166 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:16:51,166 INFO L421 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)|) (= ~t1_st~0 |old(~t1_st~0)|) (= |old(~M_E~0)| ~M_E~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~E_M~0)| ~E_M~0)) [2018-11-18 09:16:51,169 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:16:51,169 INFO L428 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-11-18 09:16:51,169 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-11-18 09:16:51,169 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-18 09:16:51,170 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-11-18 09:16:51,170 INFO L428 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-11-18 09:16:51,170 INFO L425 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-11-18 09:16:51,170 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-11-18 09:16:51,170 INFO L421 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse35 (= 1 |old(~m_pc~0)|)) (.cse22 (= 1 |old(~t2_pc~0)|))) (let ((.cse17 (< |old(~local~0)| |old(~token~0)|)) (.cse25 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= ~T1_E~0 0)) (.cse36 (< |old(~t2_st~0)| 2)) (.cse7 (= ~T2_E~0 1)) (.cse37 (not (= |old(~t1_pc~0)| 1))) (.cse38 (< |old(~m_st~0)| 2)) (.cse18 (= ~T2_E~0 0)) (.cse19 (= 0 ~M_E~0)) (.cse21 (= 1 ~M_E~0)) (.cse28 (= 1 |old(~E_M~0)|)) (.cse39 (not .cse22)) (.cse40 (< |old(~t1_st~0)| 2)) (.cse29 (= ~T1_E~0 1)) (.cse30 (not (= ~m_i~0 1))) (.cse23 (= 1 |old(~E_1~0)|)) (.cse41 (not .cse35)) (.cse31 (= 0 |old(~E_1~0)|)) (.cse24 (not (= 1 ~t1_i~0))) (.cse32 (< |old(~E_2~0)| 2)) (.cse33 (not (= 1 ~t2_i~0))) (.cse34 (= 0 |old(~E_M~0)|))) (and (let ((.cse1 (= 1 ~t2_pc~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse20 (= ~E_2~0 |old(~E_2~0)|)) (.cse0 (= 1 ~t1_pc~0)) (.cse26 (not (= ~t2_pc~0 1))) (.cse8 (= |old(~E_1~0)| ~E_1~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (= |old(~E_M~0)| ~E_M~0)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse14 (= |old(~E_2~0)| ~E_2~0)) (.cse15 (= 0 ~t1_st~0)) (.cse27 (= 0 ~t2_st~0)) (.cse5 (= eval_~tmp~0 1)) (.cse16 (<= ~local~0 ~token~0))) (or (let ((.cse4 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 (not (= ~E_1~0 1)) .cse3 (<= 2 ~E_2~0) (and (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (= 1 ~m_pc~0) (<= .cse4 ~token~0) .cse5 (not (= ~E_M~0 1)) (<= ~token~0 .cse4))) .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse3 .cse5 .cse16) .cse17 .cse18 .cse19 (and (and .cse0 .cse1 .cse8 .cse10 .cse3 .cse5 .cse12) .cse13 .cse11 .cse2 .cse20 .cse16) .cse21 (not (= |old(~t1_st~0)| 0)) .cse22 .cse23 .cse24 .cse25 (and .cse13 .cse11 .cse2 .cse20 .cse16 (and .cse26 .cse0 .cse8 .cse10 .cse27 .cse5 .cse12)) .cse28 .cse29 (not (= 0 |old(~m_st~0)|)) .cse30 (not (= 0 |old(~t2_st~0)|)) .cse31 .cse32 .cse33 .cse34 (< 0 |old(~t1_pc~0)|) (and .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse5 .cse16) .cse35)) (or .cse6 .cse36 .cse7 .cse17 .cse37 .cse25 .cse38 .cse18 .cse19 .cse21 .cse28 .cse39 .cse40 .cse29 .cse30 .cse23 .cse41 .cse31 .cse24 .cse32 .cse33 .cse34) (let ((.cse42 (+ |old(~local~0)| 1))) (or .cse6 .cse36 .cse7 .cse37 .cse38 .cse18 .cse19 .cse21 .cse28 .cse39 .cse40 .cse29 (< |old(~token~0)| .cse42) .cse30 .cse23 .cse41 .cse31 .cse24 .cse32 .cse33 (< .cse42 |old(~token~0)|) .cse34)) (let ((.cse43 (+ |old(~local~0)| 2))) (or .cse6 .cse36 .cse7 (< .cse43 |old(~token~0)|) .cse37 .cse38 .cse18 .cse19 .cse21 .cse28 .cse39 .cse40 .cse29 .cse30 .cse23 .cse41 .cse31 .cse24 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse43)))))) [2018-11-18 09:16:51,171 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-11-18 09:16:51,171 INFO L425 ceAbstractionStarter]: For program point L271-1(lines 271 323) no Hoare annotation was computed. [2018-11-18 09:16:51,171 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-11-18 09:16:51,172 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-11-18 09:16:51,172 INFO L421 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse57 (= 1 |old(~m_pc~0)|)) (.cse61 (= ~m_i~0 1)) (.cse52 (= 1 |old(~t2_pc~0)|)) (.cse62 (+ ~local~0 1)) (.cse63 (+ ~local~0 2))) (let ((.cse35 (<= .cse63 ~token~0)) (.cse34 (<= ~token~0 .cse63)) (.cse17 (<= ~token~0 .cse62)) (.cse26 (<= .cse62 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse16 (= 1 ~t1_pc~0)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse19 (<= 2 ~m_st~0)) (.cse38 (<= ~token~0 ~local~0)) (.cse20 (= |old(~E_M~0)| ~E_M~0)) (.cse21 (= 1 ~t2_pc~0)) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse23 (= |old(~E_2~0)| ~E_2~0)) (.cse24 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse25 (<= 2 ~t2_st~0)) (.cse27 (= 1 ~m_pc~0)) (.cse44 (<= ~local~0 ~token~0)) (.cse2 (= ~T2_E~0 1)) (.cse47 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse56 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not .cse52)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not .cse61)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (not .cse57)) (.cse28 (= 0 |old(~E_1~0)|)) (.cse29 (not (= 1 ~t1_i~0))) (.cse30 (< |old(~E_2~0)| 2)) (.cse31 (not (= 1 ~t2_i~0))) (.cse32 (= 0 |old(~E_M~0)|))) (and (let ((.cse12 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< |old(~token~0)| .cse12) .cse13 .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse29 .cse30 .cse31 (< .cse12 |old(~token~0)|) .cse32)) (let ((.cse33 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse33 |old(~token~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 (and .cse16 .cse18 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse35) .cse31 .cse32 (< |old(~token~0)| .cse33))) (let ((.cse53 (not (= 0 eval_~tmp~0))) (.cse54 (not (= ~E_M~0 1))) (.cse36 (not (= ~t2_pc~0 1))) (.cse58 (not .cse2)) (.cse59 (= ~t1_i~0 1)) (.cse40 (not (= ~E_1~0 1))) (.cse41 (= 0 ~t2_st~0)) (.cse42 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) .cse61 (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse60 (not (= ~M_E~0 1))) (.cse43 (= eval_~tmp~0 1))) (let ((.cse50 (and .cse36 .cse16 .cse58 .cse19 .cse59 .cse40 .cse41 .cse42 .cse60 .cse27 .cse43 .cse20)) (.cse37 (<= ~t1_pc~0 0)) (.cse45 (= ~m_st~0 0)) (.cse46 (not (= ~m_pc~0 1))) (.cse39 (= 0 ~t1_st~0)) (.cse49 (= ~E_2~0 |old(~E_2~0)|)) (.cse55 (and .cse16 (not .cse11) .cse21 .cse58 .cse19 .cse59 .cse40 .cse25 .cse42 .cse60 .cse27 .cse53 .cse54)) (.cse51 (<= 2 ~E_2~0)) (.cse48 (<= 2 ~t1_st~0))) (or (and .cse36 .cse37 .cse19 .cse38 .cse20 .cse23 .cse39 .cse40 .cse41 .cse42 .cse27 .cse43 .cse44) .cse0 (and .cse18 .cse37 .cse45 .cse46 .cse38 .cse20 .cse21 .cse22 .cse23 .cse39 .cse25 .cse43 .cse44) .cse2 .cse47 (and (and .cse16 .cse21 .cse18 .cse45 .cse46 .cse25 .cse43 .cse20) .cse22 .cse38 .cse48 .cse49 .cse44) .cse5 (and .cse37 .cse22 (and .cse36 .cse18 .cse45 .cse46 .cse41 .cse20) .cse38 .cse24 .cse49 .cse44) .cse6 (and .cse17 .cse50 .cse51 .cse26 .cse48) .cse7 (not (= |old(~t1_st~0)| 0)) .cse52 .cse14 (and .cse16 .cse51 .cse48 .cse35 (and .cse21 .cse45 .cse40 .cse25 .cse42 .cse27 .cse53 .cse54) .cse34) .cse29 (and .cse55 .cse51 .cse48 .cse35 .cse34) (and .cse50 .cse38 .cse48 .cse49 .cse44) .cse56 (and .cse55 .cse51 .cse38 .cse48 .cse44) (and .cse37 .cse19 .cse38 .cse20 .cse21 .cse23 .cse39 .cse40 .cse25 .cse42 .cse27 .cse43 .cse44) (and (and .cse36 .cse16 .cse18 .cse45 .cse46 .cse41 .cse43 .cse20) .cse22 .cse38 .cse48 .cse49 .cse44) .cse8 .cse11 (not (= 0 |old(~m_st~0)|)) (and (and .cse25 (and .cse16 .cse21 .cse40 .cse42 .cse27 .cse54) .cse19 .cse53) .cse51 .cse38 .cse39 .cse44) .cse13 (not (= 0 |old(~t2_st~0)|)) .cse28 (and (and .cse36 .cse16 .cse39 .cse40 .cse41 .cse42 .cse27 .cse20) .cse38 .cse19 .cse43 .cse49 .cse44) .cse30 (and .cse16 .cse17 .cse51 .cse26 (and .cse19 (and .cse21 .cse42 .cse27 .cse41 .cse54) .cse40 .cse53) .cse48) (and .cse55 .cse17 .cse51 .cse26 .cse48) .cse31 .cse32 (< 0 |old(~t1_pc~0)|) .cse57))) (or .cse0 .cse1 (and .cse16 .cse18 .cse19 .cse38 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse44) .cse2 .cse47 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse31 .cse32)))) [2018-11-18 09:16:51,173 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-18 09:16:51,175 INFO L425 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-11-18 09:16:51,175 INFO L421 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse57 (= 1 |old(~m_pc~0)|)) (.cse61 (= ~m_i~0 1)) (.cse52 (= 1 |old(~t2_pc~0)|)) (.cse62 (+ ~local~0 1)) (.cse63 (+ ~local~0 2))) (let ((.cse35 (<= .cse63 ~token~0)) (.cse34 (<= ~token~0 .cse63)) (.cse17 (<= ~token~0 .cse62)) (.cse26 (<= .cse62 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse16 (= 1 ~t1_pc~0)) (.cse18 (= |old(~E_1~0)| ~E_1~0)) (.cse19 (<= 2 ~m_st~0)) (.cse38 (<= ~token~0 ~local~0)) (.cse20 (= |old(~E_M~0)| ~E_M~0)) (.cse21 (= 1 ~t2_pc~0)) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse23 (= |old(~E_2~0)| ~E_2~0)) (.cse24 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse25 (<= 2 ~t2_st~0)) (.cse27 (= 1 ~m_pc~0)) (.cse44 (<= ~local~0 ~token~0)) (.cse2 (= ~T2_E~0 1)) (.cse47 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse56 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not .cse52)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not .cse61)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (not .cse57)) (.cse28 (= 0 |old(~E_1~0)|)) (.cse29 (not (= 1 ~t1_i~0))) (.cse30 (< |old(~E_2~0)| 2)) (.cse31 (not (= 1 ~t2_i~0))) (.cse32 (= 0 |old(~E_M~0)|))) (and (let ((.cse12 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< |old(~token~0)| .cse12) .cse13 .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse29 .cse30 .cse31 (< .cse12 |old(~token~0)|) .cse32)) (let ((.cse33 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (< .cse33 |old(~token~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 (and .cse16 .cse18 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse35) .cse31 .cse32 (< |old(~token~0)| .cse33))) (let ((.cse53 (not (= 0 eval_~tmp~0))) (.cse54 (not (= ~E_M~0 1))) (.cse36 (not (= ~t2_pc~0 1))) (.cse58 (not .cse2)) (.cse59 (= ~t1_i~0 1)) (.cse40 (not (= ~E_1~0 1))) (.cse41 (= 0 ~t2_st~0)) (.cse42 (and (not .cse0) (not .cse5) (not (= ~M_E~0 0)) .cse61 (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse60 (not (= ~M_E~0 1))) (.cse43 (= eval_~tmp~0 1))) (let ((.cse50 (and .cse36 .cse16 .cse58 .cse19 .cse59 .cse40 .cse41 .cse42 .cse60 .cse27 .cse43 .cse20)) (.cse37 (<= ~t1_pc~0 0)) (.cse45 (= ~m_st~0 0)) (.cse46 (not (= ~m_pc~0 1))) (.cse39 (= 0 ~t1_st~0)) (.cse49 (= ~E_2~0 |old(~E_2~0)|)) (.cse55 (and .cse16 (not .cse11) .cse21 .cse58 .cse19 .cse59 .cse40 .cse25 .cse42 .cse60 .cse27 .cse53 .cse54)) (.cse51 (<= 2 ~E_2~0)) (.cse48 (<= 2 ~t1_st~0))) (or (and .cse36 .cse37 .cse19 .cse38 .cse20 .cse23 .cse39 .cse40 .cse41 .cse42 .cse27 .cse43 .cse44) .cse0 (and .cse18 .cse37 .cse45 .cse46 .cse38 .cse20 .cse21 .cse22 .cse23 .cse39 .cse25 .cse43 .cse44) .cse2 .cse47 (and (and .cse16 .cse21 .cse18 .cse45 .cse46 .cse25 .cse43 .cse20) .cse22 .cse38 .cse48 .cse49 .cse44) .cse5 (and .cse37 .cse22 (and .cse36 .cse18 .cse45 .cse46 .cse41 .cse20) .cse38 .cse24 .cse49 .cse44) .cse6 (and .cse17 .cse50 .cse51 .cse26 .cse48) .cse7 (not (= |old(~t1_st~0)| 0)) .cse52 .cse14 (and .cse16 .cse51 .cse48 .cse35 (and .cse21 .cse45 .cse40 .cse25 .cse42 .cse27 .cse53 .cse54) .cse34) .cse29 (and .cse55 .cse51 .cse48 .cse35 .cse34) (and .cse50 .cse38 .cse48 .cse49 .cse44) .cse56 (and .cse55 .cse51 .cse38 .cse48 .cse44) (and .cse37 .cse19 .cse38 .cse20 .cse21 .cse23 .cse39 .cse40 .cse25 .cse42 .cse27 .cse43 .cse44) (and (and .cse36 .cse16 .cse18 .cse45 .cse46 .cse41 .cse43 .cse20) .cse22 .cse38 .cse48 .cse49 .cse44) .cse8 .cse11 (not (= 0 |old(~m_st~0)|)) (and (and .cse25 (and .cse16 .cse21 .cse40 .cse42 .cse27 .cse54) .cse19 .cse53) .cse51 .cse38 .cse39 .cse44) .cse13 (not (= 0 |old(~t2_st~0)|)) .cse28 (and (and .cse36 .cse16 .cse39 .cse40 .cse41 .cse42 .cse27 .cse20) .cse38 .cse19 .cse43 .cse49 .cse44) .cse30 (and .cse16 .cse17 .cse51 .cse26 (and .cse19 (and .cse21 .cse42 .cse27 .cse41 .cse54) .cse40 .cse53) .cse48) (and .cse55 .cse17 .cse51 .cse26 .cse48) .cse31 .cse32 (< 0 |old(~t1_pc~0)|) .cse57))) (or .cse0 .cse1 (and .cse16 .cse18 .cse19 .cse38 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse44) .cse2 .cse47 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse31 .cse32)))) [2018-11-18 09:16:51,177 INFO L421 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse38 (= 1 |old(~m_pc~0)|)) (.cse39 (= ~m_i~0 1)) (.cse27 (= 1 |old(~t2_pc~0)|))) (let ((.cse14 (< |old(~local~0)| |old(~token~0)|)) (.cse30 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse40 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse41 (not (= |old(~t1_pc~0)| 1))) (.cse42 (< |old(~m_st~0)| 2)) (.cse22 (= ~T2_E~0 0)) (.cse23 (= 0 ~M_E~0)) (.cse24 (= 1 ~M_E~0)) (.cse31 (= 1 |old(~E_M~0)|)) (.cse43 (not .cse27)) (.cse44 (< |old(~t1_st~0)| 2)) (.cse32 (= ~T1_E~0 1)) (.cse33 (not .cse39)) (.cse28 (= 1 |old(~E_1~0)|)) (.cse45 (not .cse38)) (.cse34 (= 0 |old(~E_1~0)|)) (.cse29 (not (= 1 ~t1_i~0))) (.cse35 (< |old(~E_2~0)| 2)) (.cse36 (not (= 1 ~t2_i~0))) (.cse37 (= 0 |old(~E_M~0)|))) (and (let ((.cse6 (not (= ~t2_pc~0 1))) (.cse9 (= 0 ~t2_st~0)) (.cse15 (= |old(~E_1~0)| ~E_1~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse17 (= ~m_st~0 0)) (.cse18 (not (= ~m_pc~0 1))) (.cse12 (= |old(~E_M~0)| ~E_M~0)) (.cse19 (= ~token~0 |old(~token~0)|)) (.cse20 (= |old(~E_2~0)| ~E_2~0)) (.cse4 (= eval_~tmp~0 1)) (.cse21 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse7 (= 1 ~t1_pc~0)) (.cse25 (= 1 ~t2_pc~0)) (.cse8 (not (= ~E_1~0 1))) (.cse10 (and (not .cse0) (not .cse22) (not (= ~M_E~0 0)) .cse39 (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse11 (= 1 ~m_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse13 (not (= ~t1_st~0 0)))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (= ~E_2~0 |old(~E_2~0)|) .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse14 (and .cse6 .cse15 .cse16 .cse17 .cse18 .cse2 .cse12 .cse13 .cse19 .cse20 .cse9 .cse4 .cse21 .cse5) .cse22 .cse23 .cse24 (not (= |old(~t1_st~0)| 0)) (and .cse6 .cse16 .cse3 .cse2 .cse12 .cse13 .cse20 .cse8 .cse9 .cse10 .cse11 .cse4 .cse21 .cse5) (and .cse16 .cse3 .cse2 .cse12 .cse13 .cse25 .cse20 .cse8 .cse26 .cse10 .cse11 .cse4 .cse21 .cse5) .cse27 .cse28 .cse29 .cse30 (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse12 .cse13 .cse25 .cse19 .cse20 .cse26 .cse4 .cse21 .cse5) .cse31 .cse32 (not (= 0 |old(~m_st~0)|)) .cse33 (not (= 0 |old(~t2_st~0)|)) (and (and .cse26 (and .cse7 .cse25 .cse8 .cse10 .cse11 (not (= ~E_M~0 1))) .cse3 (not (= 0 eval_~tmp~0))) (<= 2 ~E_2~0) .cse2 .cse5 .cse13) .cse34 .cse35 .cse36 .cse37 (< 0 |old(~t1_pc~0)|) .cse38)) (or .cse0 .cse40 .cse1 .cse14 .cse41 .cse30 .cse42 .cse22 .cse23 .cse24 .cse31 .cse43 .cse44 .cse32 .cse33 .cse28 .cse45 .cse34 .cse29 .cse35 .cse36 .cse37) (let ((.cse46 (+ |old(~local~0)| 1))) (or .cse0 .cse40 .cse1 .cse41 .cse42 .cse22 .cse23 .cse24 .cse31 .cse43 .cse44 .cse32 (< |old(~token~0)| .cse46) .cse33 .cse28 .cse45 .cse34 .cse29 .cse35 .cse36 (< .cse46 |old(~token~0)|) .cse37)) (let ((.cse47 (+ |old(~local~0)| 2))) (or .cse0 .cse40 .cse1 (< .cse47 |old(~token~0)|) .cse41 .cse42 .cse22 .cse23 .cse24 .cse31 .cse43 .cse44 .cse32 .cse33 .cse28 .cse45 .cse34 .cse29 .cse35 .cse36 .cse37 (< |old(~token~0)| .cse47)))))) [2018-11-18 09:16:51,179 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse23 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 |old(~t2_pc~0)|))) (let ((.cse10 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse15 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse26 (not (= |old(~t1_pc~0)| 1))) (.cse31 (= 1 ~t1_pc~0)) (.cse9 (= |old(~E_1~0)| ~E_1~0)) (.cse32 (<= 2 ~m_st~0)) (.cse11 (= |old(~E_M~0)| ~E_M~0)) (.cse34 (= 1 ~t2_pc~0)) (.cse12 (= ~token~0 |old(~token~0)|)) (.cse13 (= |old(~E_2~0)| ~E_2~0)) (.cse35 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse36 (<= 2 ~t2_st~0)) (.cse37 (= 1 ~m_pc~0)) (.cse27 (< |old(~m_st~0)| 2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse16 (= 1 |old(~E_M~0)|)) (.cse28 (not .cse6)) (.cse29 (< |old(~t1_st~0)| 2)) (.cse17 (= ~T1_E~0 1)) (.cse18 (not (= ~m_i~0 1))) (.cse7 (= 1 |old(~E_1~0)|)) (.cse30 (not .cse23)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse20 (< |old(~E_2~0)| 2)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse6 .cse7 .cse8 (and (not (= ~t2_pc~0 1)) .cse9 (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) .cse10 .cse11 .cse12 .cse13 (= 0 ~t1_st~0) (= 0 ~t2_st~0) .cse14) .cse15 .cse16 .cse17 (not (= 0 |old(~m_st~0)|)) .cse18 (not (= 0 |old(~t2_st~0)|)) .cse19 .cse20 .cse21 .cse22 (< 0 |old(~t1_pc~0)|) .cse23) (let ((.cse25 (+ |old(~local~0)| 2))) (or .cse0 .cse24 .cse1 (< .cse25 |old(~token~0)|) .cse26 .cse27 .cse3 .cse4 .cse5 .cse16 .cse28 .cse29 .cse17 .cse18 .cse7 .cse30 .cse19 .cse8 .cse20 (let ((.cse33 (+ ~local~0 2))) (and .cse31 .cse9 .cse32 .cse11 (<= ~token~0 .cse33) .cse34 .cse12 .cse13 .cse35 .cse36 .cse37 (<= .cse33 ~token~0))) .cse21 .cse22 (< |old(~token~0)| .cse25))) (or .cse0 (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse34 .cse12 .cse13 .cse35 .cse36 .cse37 .cse14) .cse24 .cse1 .cse2 .cse26 .cse15 .cse27 .cse3 .cse4 .cse5 .cse16 .cse28 .cse29 .cse17 .cse18 .cse7 .cse30 .cse19 .cse8 .cse20 .cse21 .cse22) (let ((.cse39 (+ |old(~local~0)| 1))) (or .cse0 .cse24 .cse1 .cse26 (let ((.cse38 (+ ~local~0 1))) (and .cse31 (<= ~token~0 .cse38) .cse9 .cse32 .cse11 .cse34 .cse12 .cse13 .cse35 .cse36 (<= .cse38 ~token~0) .cse37)) .cse27 .cse3 .cse4 .cse5 .cse16 .cse28 .cse29 .cse17 (< |old(~token~0)| .cse39) .cse18 .cse7 .cse30 .cse19 .cse8 .cse20 .cse21 (< .cse39 |old(~token~0)|) .cse22))))) [2018-11-18 09:16:51,182 INFO L425 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-11-18 09:16:51,182 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-11-18 09:16:51,183 INFO L421 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse39 (= 1 |old(~m_pc~0)|)) (.cse41 (= ~m_i~0 1)) (.cse6 (= 1 |old(~t2_pc~0)|))) (let ((.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse31 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse42 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse43 (not (= |old(~t1_pc~0)| 1))) (.cse44 (< |old(~m_st~0)| 2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse32 (= 1 |old(~E_M~0)|)) (.cse45 (not .cse6)) (.cse46 (< |old(~t1_st~0)| 2)) (.cse33 (= ~T1_E~0 1)) (.cse34 (not .cse41)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse47 (not .cse39)) (.cse35 (= 0 |old(~E_1~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse36 (< |old(~E_2~0)| 2)) (.cse37 (not (= 1 ~t2_i~0))) (.cse38 (= 0 |old(~E_M~0)|))) (and (let ((.cse15 (not (= ~t2_pc~0 1))) (.cse16 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~m_st~0)) (.cse25 (not (= ~E_1~0 1))) (.cse26 (and (not .cse0) (not .cse3) (not (= ~M_E~0 0)) .cse41 (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse27 (= 1 ~m_pc~0)) (.cse20 (= eval_~tmp~0 1)) (.cse21 (= |old(~E_M~0)| ~E_M~0)) (.cse40 (+ ~local~0 1))) (let ((.cse28 (<= ~token~0 .cse40)) (.cse29 (<= 2 ~E_2~0)) (.cse30 (<= .cse40 ~token~0)) (.cse9 (and .cse15 .cse16 (not .cse1) .cse23 (= ~t1_i~0 1) .cse25 (not (= ~E_2~0 1)) .cse26 (not (= ~M_E~0 1)) .cse27 .cse20 .cse21)) (.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~E_2~0 |old(~E_2~0)|)) (.cse17 (= |old(~E_1~0)| ~E_1~0)) (.cse22 (<= ~t1_pc~0 0)) (.cse18 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse8 (<= ~token~0 ~local~0)) (.cse14 (= ~token~0 |old(~token~0)|)) (.cse24 (= 0 ~t1_st~0)) (.cse12 (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 (and .cse14 .cse8 .cse10 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse12) (and .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse20 .cse11 .cse12 .cse21) (and .cse28 (and .cse23 (and .cse16 (= 1 ~t2_pc~0) .cse26 .cse27 (not (= ~E_M~0 1))) .cse25 (not (= 0 eval_~tmp~0))) .cse29 .cse30 .cse10) .cse31 (and .cse28 .cse29 .cse30 .cse9 .cse10) .cse32 .cse33 (not (= 0 |old(~m_st~0)|)) .cse34 (not (= 0 |old(~t2_st~0)|)) (and .cse8 .cse23 .cse24 .cse20 (and .cse15 .cse16 .cse25 .cse26 .cse27 .cse21) .cse11 .cse12) .cse35 .cse36 .cse37 .cse38 (and .cse15 .cse17 .cse22 .cse18 .cse19 .cse8 .cse21 .cse14 (= |old(~E_2~0)| ~E_2~0) .cse24 .cse20 .cse12) (< 0 |old(~t1_pc~0)|) .cse39))) (or .cse0 .cse42 .cse1 .cse2 .cse43 .cse31 .cse44 .cse3 .cse4 .cse5 .cse32 .cse45 .cse46 .cse33 .cse34 .cse7 .cse47 .cse35 .cse13 .cse36 .cse37 .cse38) (let ((.cse48 (+ |old(~local~0)| 1))) (or .cse0 .cse42 .cse1 .cse43 .cse44 .cse3 .cse4 .cse5 .cse32 .cse45 .cse46 .cse33 (< |old(~token~0)| .cse48) .cse34 .cse7 .cse47 .cse35 .cse13 .cse36 .cse37 (< .cse48 |old(~token~0)|) .cse38)) (let ((.cse49 (+ |old(~local~0)| 2))) (or .cse0 .cse42 .cse1 (< .cse49 |old(~token~0)|) .cse43 .cse44 .cse3 .cse4 .cse5 .cse32 .cse45 .cse46 .cse33 .cse34 .cse7 .cse47 .cse35 .cse13 .cse36 .cse37 .cse38 (< |old(~token~0)| .cse49)))))) [2018-11-18 09:16:51,184 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-18 09:16:51,184 INFO L425 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-11-18 09:16:51,184 INFO L421 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse47 (+ ~local~0 2)) (.cse33 (= 1 |old(~m_pc~0)|)) (.cse18 (= 1 |old(~t2_pc~0)|)) (.cse48 (+ ~local~0 1))) (let ((.cse24 (<= ~token~0 .cse48)) (.cse25 (<= .cse48 ~token~0)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (< |old(~token~0)| |old(~local~0)|)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse34 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 1)) (.cse35 (not (= |old(~t1_pc~0)| 1))) (.cse41 (< |old(~m_st~0)| 2)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse26 (= 1 |old(~E_M~0)|)) (.cse42 (not .cse18)) (.cse43 (< |old(~t1_st~0)| 2)) (.cse27 (= ~T1_E~0 1)) (.cse28 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~E_1~0)|)) (.cse45 (not .cse33)) (.cse29 (= 0 |old(~E_1~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse30 (< |old(~E_2~0)| 2)) (.cse31 (not (= 1 ~t2_i~0))) (.cse32 (= 0 |old(~E_M~0)|)) (.cse6 (= 1 ~t1_pc~0)) (.cse36 (= |old(~E_1~0)| ~E_1~0)) (.cse9 (<= 2 ~m_st~0)) (.cse37 (= |old(~E_M~0)| ~E_M~0)) (.cse17 (<= ~token~0 .cse47)) (.cse7 (= 1 ~t2_pc~0)) (.cse38 (= ~token~0 |old(~token~0)|)) (.cse39 (= |old(~E_2~0)| ~E_2~0)) (.cse40 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse12 (<= 2 ~t2_st~0)) (.cse14 (= 1 ~m_pc~0)) (.cse15 (<= .cse47 ~token~0))) (and (let ((.cse8 (and (not .cse0) (not .cse3) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse10 (<= 2 ~t1_st~0)) (.cse11 (not (= ~E_1~0 1))) (.cse13 (<= 2 ~E_2~0)) (.cse16 (not (= ~E_M~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse16) .cse23 (and .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse16) .cse26 .cse27 (not (= 0 |old(~m_st~0)|)) .cse28 (not (= 0 |old(~t2_st~0)|)) .cse29 .cse30 .cse31 .cse32 (< 0 |old(~t1_pc~0)|) .cse33)) (let ((.cse44 (+ |old(~local~0)| 1))) (or .cse0 .cse34 .cse1 .cse35 (and .cse6 .cse24 .cse36 .cse9 .cse37 .cse7 .cse38 .cse39 .cse40 .cse12 .cse25 .cse14) .cse41 .cse3 .cse4 .cse5 .cse26 .cse42 .cse43 .cse27 (< |old(~token~0)| .cse44) .cse28 .cse19 .cse45 .cse29 .cse20 .cse30 .cse31 (< .cse44 |old(~token~0)|) .cse32)) (or .cse0 .cse34 .cse1 .cse2 .cse35 .cse23 (and .cse6 .cse36 .cse9 .cse21 .cse37 .cse7 .cse38 .cse39 .cse40 .cse12 .cse14 .cse22) .cse41 .cse3 .cse4 .cse5 .cse26 .cse42 .cse43 .cse27 .cse28 .cse19 .cse45 .cse29 .cse20 .cse30 .cse31 .cse32) (let ((.cse46 (+ |old(~local~0)| 2))) (or .cse0 .cse34 .cse1 (< .cse46 |old(~token~0)|) .cse35 .cse41 .cse3 .cse4 .cse5 .cse26 .cse42 .cse43 .cse27 .cse28 .cse19 .cse45 .cse29 .cse20 .cse30 .cse31 .cse32 (< |old(~token~0)| .cse46) (and .cse6 .cse36 .cse9 .cse37 .cse17 .cse7 .cse38 .cse39 .cse40 .cse12 .cse14 .cse15)))))) [2018-11-18 09:16:51,187 INFO L425 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-11-18 09:16:51,187 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-11-18 09:16:51,187 INFO L421 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse35 (+ ~local~0 1)) (.cse23 (= 1 ~t2_pc~0)) (.cse36 (+ ~local~0 2)) (.cse10 (= 1 ~E_1~0)) (.cse27 (= ~t1_st~0 0))) (let ((.cse26 (= 0 ~E_2~0)) (.cse24 (not (= 0 ~t2_st~0))) (.cse33 (< 0 ~t1_pc~0)) (.cse32 (not .cse27)) (.cse34 (not .cse10)) (.cse29 (< ~local~0 ~token~0)) (.cse30 (< ~token~0 ~local~0)) (.cse16 (< .cse36 ~token~0)) (.cse6 (= 1 ~M_E~0)) (.cse20 (< ~token~0 .cse36)) (.cse1 (= ~T1_E~0 0)) (.cse28 (< ~t2_st~0 2)) (.cse2 (= ~T2_E~0 1)) (.cse17 (not (= ~t1_pc~0 1))) (.cse3 (< ~m_st~0 2)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse21 (= 1 ~E_M~0)) (.cse7 (not .cse23)) (.cse0 (< ~t1_st~0 2)) (.cse8 (= ~T1_E~0 1)) (.cse22 (< ~token~0 .cse35)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (not .cse31)) (.cse19 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse12 (= 0 ~E_1~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse18 (< ~E_2~0 2)) (.cse14 (not (= 1 ~t2_i~0))) (.cse25 (< .cse35 ~token~0)) (.cse15 (= 0 ~E_M~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse19 .cse17 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse22 .cse9 .cse23 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse26 .cse27) (or .cse1 .cse28 .cse2 .cse29 .cse17 .cse30 .cse3 .cse4 .cse5 .cse21 .cse7 .cse0 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (or .cse0 (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse21 .cse8 .cse9 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse31) .cse19 .cse29 .cse17 .cse30 .cse18) (or .cse1 .cse28 .cse2 .cse29 .cse30 .cse4 .cse19 .cse5 .cse6 .cse32 .cse21 .cse7 .cse8 .cse9 .cse12 .cse13 .cse18 .cse14 .cse15 .cse33 .cse31) (or .cse1 (= 1 ~E_2~0) .cse28 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse19 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse26 .cse27) (or .cse1 .cse2 .cse29 .cse19 .cse17 .cse30 .cse4 .cse5 .cse6 .cse32 .cse21 .cse8 .cse34 .cse9 .cse23 .cse24 .cse13 .cse18 .cse14 .cse15 .cse31) (or .cse1 .cse2 .cse19 .cse29 .cse30 .cse4 .cse5 .cse6 .cse32 .cse21 .cse8 .cse9 .cse23 .cse24 .cse12 .cse13 .cse18 .cse14 .cse15 .cse33 .cse31) (or .cse1 .cse28 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse21 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse19 .cse20) (or .cse1 .cse28 .cse2 .cse19 .cse29 .cse17 .cse30 .cse4 .cse5 .cse6 .cse32 .cse21 .cse7 .cse8 .cse34 .cse9 .cse13 .cse18 .cse14 .cse15) (or .cse0 .cse28 .cse29 .cse30 .cse18 (or .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15) .cse19) (or (not .cse21) .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse0 .cse8 (not (= 0 ~m_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse20 .cse19) (or .cse1 .cse28 .cse2 .cse17 .cse3 .cse4 .cse5 .cse21 .cse7 .cse0 .cse8 .cse22 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse18 .cse14 .cse25 .cse15)))) [2018-11-18 09:16:51,191 INFO L428 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-11-18 09:16:51,192 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-11-18 09:16:51,192 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-11-18 09:16:51,192 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-11-18 09:16:51,192 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse18 (= 1 ~m_pc~0)) (.cse6 (= 1 ~t2_pc~0))) (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse9 (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))) (.cse19 (< ~t2_st~0 2)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (< ~local~0 ~token~0)) (.cse20 (not (= ~t1_pc~0 1))) (.cse10 (< ~token~0 ~local~0)) (.cse21 (< ~m_st~0 2)) (.cse3 (= |old(~T2_E~0)| 0)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (= 1 |old(~M_E~0)|)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse22 (not .cse6)) (.cse23 (< ~t1_st~0 2)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse13 (not (= ~m_i~0 1))) (.cse7 (= 1 |old(~E_1~0)|)) (.cse25 (not .cse18)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse8 (not (= 1 ~t1_i~0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ~m_st~0)) .cse13 (not (= 0 ~t2_st~0)) .cse14 .cse15 .cse16 .cse17 (< 0 ~t1_pc~0) .cse18) (let ((.cse24 (+ ~local~0 1))) (or .cse0 .cse19 .cse1 .cse20 .cse9 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 (< ~token~0 .cse24) .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse16 (< .cse24 ~token~0) .cse17)) (let ((.cse26 (+ ~local~0 2))) (or .cse0 .cse19 .cse1 (< .cse26 ~token~0) .cse20 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17 (< ~token~0 .cse26))) (or .cse0 .cse9 .cse19 .cse1 .cse2 .cse20 .cse10 .cse21 .cse3 .cse4 .cse5 .cse11 .cse22 .cse23 .cse12 .cse13 .cse7 .cse25 .cse14 .cse8 .cse15 .cse16 .cse17)))) [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-11-18 09:16:51,196 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-11-18 09:16:51,196 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 580) no Hoare annotation was computed. [2018-11-18 09:16:51,197 INFO L421 ceAbstractionStarter]: At program point L543-2(lines 540 580) the Hoare annotation is: (let ((.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)))))))) (let ((.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and .cse5 .cse6 (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) .cse7 (= 1 ~m_pc~0) (= ~t1_i~0 1) .cse8) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 .cse3 .cse2 .cse4) (< |old(~token~0)| |old(~local~0)|) (and (<= ~t1_pc~0 0) (and .cse5 (= |old(~E_1~0)| ~E_1~0) .cse6 (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) .cse7 (= 0 ~t1_st~0) .cse8 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= |old(~E_M~0)| ~E_M~0)) (= ~token~0 |old(~token~0)|) .cse3 (= ~E_2~0 |old(~E_2~0)|) .cse4) (let ((.cse9 (+ ~local~0 2))) (and .cse1 (<= .cse9 ~token~0) .cse2 (<= ~token~0 .cse9))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-18 09:16:51,197 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,197 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-11-18 09:16:51,198 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,198 INFO L421 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_2~0)) (.cse1 (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (= 1 ~m_pc~0) (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_M~0 1))) (not (= ~E_1~0 1)))))) (or (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (and .cse0 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 0) (let ((.cse3 (+ ~local~0 1))) (and (<= ~token~0 .cse3) .cse0 (<= .cse3 ~token~0) .cse1)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,199 INFO L425 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-11-18 09:16:51,199 INFO L421 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,200 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-18 09:16:51,200 INFO L421 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,200 INFO L428 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: true [2018-11-18 09:16:51,200 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,200 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-18 09:16:51,200 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-18 09:16:51,201 INFO L425 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-11-18 09:16:51,201 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,201 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,202 INFO L421 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(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~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)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 09:16:51,202 INFO L421 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,202 INFO L421 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_2~0)) (.cse1 (and (<= 2 ~t2_st~0) (<= 2 ~m_st~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (= 1 ~m_pc~0) (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_M~0 1))) (not (= ~E_1~0 1)))))) (or (let ((.cse2 (+ ~local~0 2))) (and .cse0 .cse1 (<= .cse2 ~token~0) (<= ~token~0 .cse2))) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (and .cse0 (<= ~token~0 ~local~0) .cse1 (<= ~local~0 ~token~0)) (= |old(~T2_E~0)| 0) (let ((.cse3 (+ ~local~0 1))) (and (<= ~token~0 .cse3) .cse0 (<= .cse3 ~token~0) .cse1)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (< |old(~token~0)| |old(~local~0)|) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,205 INFO L421 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,205 INFO L421 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,205 INFO L421 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,207 INFO L421 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) (not (= ~M_E~0 1)) (= 1 ~m_pc~0) (= ~t1_i~0 1) (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0))))))) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0)) (< |old(~token~0)| |old(~local~0)|) (let ((.cse3 (+ ~local~0 2))) (and .cse1 (<= .cse3 ~token~0) .cse2 (<= ~token~0 .cse3))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 09:16:51,207 INFO L425 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-11-18 09:16:51,207 INFO L421 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (and (not (= ~E_1~0 0)) (and (not (= ~E_M~0 0)) (and (not (= ~T2_E~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)))))))) (let ((.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (and (not (= ~E_2~0 1)) (not (= ~E_1~0 1)) (and .cse5 .cse6 (not (= ~T2_E~0 1)) (and (= 1 ~t1_pc~0) (= 1 ~t2_pc~0) .cse7 (= 1 ~m_pc~0) (= ~t1_i~0 1) .cse8) (not (= ~E_M~0 1)))) (<= 2 ~m_st~0) (<= 2 ~t1_st~0)))) (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)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (and .cse1 .cse3 .cse2 .cse4) (< |old(~token~0)| |old(~local~0)|) (and (<= ~t1_pc~0 0) (and .cse5 (= |old(~E_1~0)| ~E_1~0) .cse6 (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) .cse7 (= 0 ~t1_st~0) .cse8 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= |old(~E_M~0)| ~E_M~0)) (= ~token~0 |old(~token~0)|) .cse3 (= ~E_2~0 |old(~E_2~0)|) .cse4) (let ((.cse9 (+ ~local~0 2))) (and .cse1 (<= .cse9 ~token~0) .cse2 (<= ~token~0 .cse9))) (= 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)|) (< |old(~E_2~0)| 2) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)))) [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-11-18 09:16:51,210 INFO L421 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse34 (+ ~local~0 2)) (.cse33 (= ~t1_st~0 0)) (.cse35 (+ ~local~0 1))) (let ((.cse28 (< ~token~0 .cse35)) (.cse29 (< .cse35 ~token~0)) (.cse32 (= 0 ~E_2~0)) (.cse21 (< ~t2_st~0 2)) (.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse30 (not .cse33)) (.cse14 (not (= 0 ~t2_st~0))) (.cse31 (< 0 ~t1_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse22 (< .cse34 ~token~0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse23 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse24 (not .cse13)) (.cse10 (< ~t1_st~0 2)) (.cse11 (= ~T1_E~0 1)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse12 (not (= ~m_i~0 1))) (.cse25 (= 1 ~E_1~0)) (.cse9 (= 1 ~E_M~0)) (.cse26 (not .cse20)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< ~E_2~0 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse27 (< ~token~0 .cse34))) (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 .cse21 .cse2 .cse22 .cse4 .cse23 .cse6 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12 .cse25 .cse26 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse27) (or .cse1 .cse0 .cse21 .cse2 .cse4 .cse23 .cse6 .cse7 .cse9 .cse24 .cse10 .cse11 .cse28 .cse12 .cse25 .cse26 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19) (or .cse0 .cse21 .cse2 .cse3 .cse5 .cse6 .cse7 .cse1 .cse8 .cse30 .cse9 .cse24 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20) (or .cse0 .cse2 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse28 .cse12 .cse13 .cse25 .cse14 .cse26 .cse1 .cse15 .cse16 .cse18 .cse29 .cse19 .cse32 .cse33) (or .cse0 .cse21 .cse2 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse24 .cse11 .cse28 .cse12 .cse25 .cse26 .cse15 .cse16 .cse18 .cse29 .cse19 .cse32 .cse33 .cse1) (or .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse1 .cse23 .cse6 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12 .cse25 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20) (or .cse0 .cse2 .cse22 .cse4 .cse23 .cse6 .cse7 .cse8 .cse24 .cse10 .cse11 .cse1 .cse12 .cse25 .cse9 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27)))) [2018-11-18 09:16:51,211 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-11-18 09:16:51,211 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t2_pc~0 1)) (not (= ~T1_E~0 1)) (<= ~t1_pc~0 0) (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 (= ~T1_E~0 0)) (not (= ~m_i~0 1)) (<= 2 ~E_2~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_M~0 1))) [2018-11-18 09:16:51,212 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (< ~t2_st~0 2)) (.cse2 (= |old(~T2_E~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (< ~m_st~0 2)) (.cse5 (= |old(~T2_E~0)| 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (< ~t1_st~0 2)) (.cse11 (= |old(~T1_E~0)| 1)) (.cse6 (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))) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse14 (not (= 1 ~m_pc~0))) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (< ~local~0 ~token~0) .cse3 (< ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (+ ~local~0 2))) (or .cse0 .cse1 .cse6 .cse2 (< .cse20 ~token~0) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse20))) (let ((.cse21 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 (< ~token~0 .cse21) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse21 ~token~0) .cse19)))) [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-11-18 09:16:51,212 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-11-18 09:16:51,213 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 |old(~t2_i~0)|) (< ~token~0 ~local~0) (= 1 |old(~t1_i~0)|) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (not (= 0 ~t2_st~0)) (= 0 ~E_1~0) (< ~E_2~0 2) (= 0 ~E_M~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (< 0 ~t1_pc~0) (= 1 ~m_pc~0)) [2018-11-18 09:16:51,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:16:51 BoogieIcfgContainer [2018-11-18 09:16:51,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:16:51,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:16:51,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:16:51,286 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:16:51,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:59" (3/4) ... [2018-11-18 09:16:51,290 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 09:16:51,296 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 09:16:51,297 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 09:16:51,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-18 09:16:51,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-18 09:16:51,298 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 09:16:51,304 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-18 09:16:51,305 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 09:16:51,329 WARN L220 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)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((2 <= E_2 && token <= local) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st) && local <= token)) || \old(token) < \old(local)) || (((((t1_pc <= 0 && (((\old(T2_E) == T2_E && \old(E_1) == E_1) && \old(T1_E) == T1_E) && (((((!(t2_pc == 1) && m_st == 0) && !(M_E == 1)) && 0 == t1_st) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && E_2 == \old(E_2)) && local <= token)) || (((2 <= E_2 && local + 2 <= token) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st) && token <= local + 2)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc) [2018-11-18 09:16:51,329 WARN L220 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) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || (((((((((((1 == t1_pc && token <= local + 1) && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(\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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((((((((((((((((((((((!(t2_pc == 1) && t1_pc <= 0) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && tmp == 1) && local <= token) || T1_E == 0) || ((((((((((((\old(E_1) == E_1 && t1_pc <= 0) && m_st == 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && tmp == 1) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 2 <= t2_st) && tmp == 1) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || T2_E == 0) || ((((((t1_pc <= 0 && token == \old(token)) && ((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || 0 == M_E) || ((((token <= local + 1 && ((((((((((!(t2_pc == 1) && 1 == t1_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && tmp == 1) && \old(E_M) == E_M) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || (((((1 == t1_pc && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && ((((((1 == t2_pc && m_st == 0) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && token <= local + 2)) || !(1 == t1_i)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((((((((((((!(t2_pc == 1) && 1 == t1_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && tmp == 1) && \old(E_M) == E_M) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || \old(token) < \old(local)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && 2 <= E_2) && token <= local) && 2 <= t1_st) && local <= token)) || ((((((((((((t1_pc <= 0 && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && tmp == 1) && local <= token)) || ((((((((((((!(t2_pc == 1) && 1 == t1_pc) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 0 == t2_st) && tmp == 1) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((2 <= t2_st && ((((1 == t1_pc && 1 == t2_pc) && !(E_1 == 1)) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && !(E_M == 1)) && 2 <= m_st) && !(0 == tmp)) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || ((((((((((((!(t2_pc == 1) && 1 == t1_pc) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && \old(E_M) == E_M) && token <= local) && 2 <= m_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || \old(E_2) < 2) || (((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && ((2 <= m_st && (((1 == t2_pc && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && 2 <= t1_st)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-18 09:16:51,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((((((1 == t1_pc && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((((((((((1 == t1_pc && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && token <= local) && local <= token) && !(E_M == 1))) || \old(token) < \old(local)) || (((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || (((((((((((1 == t1_pc && token <= local + 1) && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || \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) || \old(token) < \old(local) + 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || \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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(\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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) [2018-11-18 09:16:51,330 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st) && local <= token)) || 0 < t1_pc) || 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(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 1 == \old(m_pc)) [2018-11-18 09:16:51,331 WARN L220 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)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || T2_E == 0) || (((((((2 <= m_st && token <= local) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(m_i == 1)) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || ((((((((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)) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= m_st) && token <= local) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || ((((((((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)) || 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)) && !(M_E == 0)) && 2 <= m_st) && token <= local) && t1_st == \old(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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 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(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc)) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == t1_pc && 2 <= m_st) && token <= \old(token) + 1) && 2 <= E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local + 1 <= token)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) && ((((((((((((((((((((((T1_E == 0 || ((((((t1_pc <= 0 && 2 <= m_st) && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && E_2 == \old(E_2)) && local <= token)) || 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) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == E_1) || (((((t1_pc <= 0 && m_st == 0) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || ((((((t1_pc <= 0 && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && E_2 == \old(E_2)) && local <= token))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(token) < local) || (((((t1_pc <= 0 && m_st == 0) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((((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 == t1_i)) || \old(t1_st) == 0) || ((((((1 == t1_pc && 2 <= m_st) && t1_st == \old(t1_st)) && 0 == t2_st) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token)) || \old(t2_st) < 2) || ((((((1 == t1_pc && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && local + 1 <= token)) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 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) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 2 <= t2_st) && local + 1 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && local + 1 <= token)) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 < \old(t1_pc)) || 1 == m_pc) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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))) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \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 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((((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) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((m_st == 0 && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || ((((2 <= m_st && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || \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) || ((((t1_st == \old(t1_st) && m_st == 0 && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((2 <= m_st && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M) || 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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || (((token == \old(token) && 2 <= m_st) && t1_st == \old(t1_st)) && \old(E_M) == E_M)) || 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 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((m_st == 0 && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 < t1_pc) || 1 == m_pc) [2018-11-18 09:16:51,331 WARN L220 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) || (((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 1 == M_E) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((((((((((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 == m_pc)) || 0 == E_1) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 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) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st))) && (((((((((((((((((((((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) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((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) || 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 == m_pc)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((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) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) [2018-11-18 09:16:51,331 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) && ((((((((((((((((((((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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || !(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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((((((((((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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((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) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) [2018-11-18 09:16:51,384 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9628e12-f909-4a4b-9958-aeb8101c6abd/bin-2019/uautomizer/witness.graphml [2018-11-18 09:16:51,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:16:51,385 INFO L168 Benchmark]: Toolchain (without parser) took 52667.82 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 953.8 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 09:16:51,385 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:16:51,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:16:51,386 INFO L168 Benchmark]: Boogie Preprocessor took 65.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:16:51,386 INFO L168 Benchmark]: RCFGBuilder took 388.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:16:51,386 INFO L168 Benchmark]: TraceAbstraction took 51890.06 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-11-18 09:16:51,386 INFO L168 Benchmark]: Witness Printer took 97.88 ms. Allocated memory is still 3.5 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:16:51,388 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.10 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51890.06 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 97.88 ms. Allocated memory is still 3.5 GB. Free memory is still 2.2 GB. There was no memory consumed. 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: 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)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || (((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((2 <= E_2 && token <= local) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st) && local <= token)) || \old(token) < \old(local)) || (((((t1_pc <= 0 && (((\old(T2_E) == T2_E && \old(E_1) == E_1) && \old(T1_E) == T1_E) && (((((!(t2_pc == 1) && m_st == 0) && !(M_E == 1)) && 0 == t1_st) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && E_2 == \old(E_2)) && local <= token)) || (((2 <= E_2 && local + 2 <= token) && ((2 <= t2_st && (!(E_2 == 1) && !(E_1 == 1)) && (((\old(T2_E) == T2_E && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t1_pc && 1 == t2_pc) && !(M_E == 1)) && 1 == m_pc) && t1_i == 1) && !(E_1 == 0) && !(E_M == 0) && !(T2_E == 0) && !(T1_E == 0) && !(M_E == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st) && token <= local + 2)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_st < 2 || (((((((((((((T1_E == 0 || T2_E == 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local + 2 < token) || !(t1_pc == 1)) || E_2 < 2) || 0 == __retres1) || token < local + 2) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || token < local + 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)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 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) || 0 == __retres1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((t1_st < 2 || (((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || T2_E == 0) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((((T1_E == 0 || 1 == E_2) || 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) || 0 == __retres1) || 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_E == 1) || local < token) || 0 == __retres1) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || local < token) || token < local) || 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)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || token < local + 2)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((t1_st < 2 || t2_st < 2) || local < token) || token < local) || E_2 < 2) || ((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1)) && ((((((((((((((((((((!(1 == E_M) || T1_E == 0) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 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 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && local + 1 <= token)) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 2 <= t2_st)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 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) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 2 <= t2_st) && local + 1 <= token)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || ((((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && local + 1 <= token)) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || !(\old(t1_pc) == 1)) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(token) < local) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token == \old(token)) && \old(E_2) == E_2) && 0 == t2_st)) || 0 < \old(t1_pc)) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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))) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \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 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && (((((((((((((((((((((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) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || (((((1 == t1_pc && 2 <= m_st) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 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(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((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)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(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 == m_pc)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 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 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || token < local) || 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)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 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_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == __retres1) || 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)) || 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) || 0 == __retres1)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((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) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || 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) || 0 == __retres1) || !(m_i == 1)) || 1 == E_1) || 1 == E_M) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && local <= token) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 0 == t2_st) && local <= token)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st) && local <= token)) || 0 < t1_pc) || 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(E_1) == E_1 && token <= local + 2) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || (((((((((((1 == t1_pc && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || !(1 == t1_i)) || (((((((((((1 == t1_pc && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && 1 == m_pc) && token <= local) && local <= token) && !(E_M == 1))) || \old(token) < \old(local)) || (((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && !(E_M == 1))) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || (((((((((((1 == t1_pc && token <= local + 1) && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || \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) || \old(token) < \old(local) + 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || \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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(\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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((m_st == 0 && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || ((((2 <= m_st && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || \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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || \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) || ((((t1_st == \old(t1_st) && m_st == 0 && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || \old(token) < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((((((2 <= m_st && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M) || 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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || ((((2 <= m_st && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || (((token == \old(token) && 2 <= m_st) && t1_st == \old(t1_st)) && \old(E_M) == E_M)) || 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 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((m_st == 0 && 0 == t1_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 < t1_pc) || 1 == 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)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || T2_E == 0) || (((((((2 <= m_st && token <= local) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 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))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || (((((((2 <= m_st && token <= local) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || !(m_i == 1)) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || ((((((((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)) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((1 == t1_pc && !(T2_E == 0)) && !(T2_E == 1)) && !(M_E == 0)) && 2 <= m_st) && token <= local) && t1_st == \old(t1_st)) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token)) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || ((((((((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)) || 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)) && !(M_E == 0)) && 2 <= m_st) && token <= local) && t1_st == \old(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)) || 0 == \old(E_1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((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) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || 0 < t1_pc) || 1 == m_pc) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || token < local + 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)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((((((((0 == __retres1 || T1_E == 0) || T2_E == 1) || 1 == 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)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 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) || 0 == __retres1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((T1_E == 0 || t2_st < 2) || T2_E == 1) || 0 == __retres1) || local + 2 < token) || !(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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 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) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 == __retres1) || 1 == E_1)) && ((((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || 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) || local < token) || token < local) || 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)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && ((((((t1_st < 2 || 0 == __retres1) || (((((((((((((T1_E == 0 || T2_E == 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local + 2 < token) || !(t1_pc == 1)) || E_2 < 2) || token < local + 2)) && ((((((((((((((((((((!(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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || token < local + 2) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || __retres1 == 1) || t1_st < 2) || 1 == E_1) || !(1 == t1_i)) || t2_st < 2) || local + 2 < token) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) && ((((((((((((((((((((((T1_E == 0 || __retres1 == 1) || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || !(t1_pc == 1)) || token < local) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || __retres1 == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((((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) || __retres1 == 1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || 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) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || __retres1 == 1) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc)) && ((((((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || local < token) || T2_E == 0) || 0 == M_E) || 1 == M_E) || t1_st < 2) || 1 == E_1) || !(1 == t1_i)) || t2_st < 2) || !(t1_pc == 1)) || token < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 0 == E_1) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || __retres1 == 1) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_1) || !(1 == t1_i)) || t2_st < 2) || token < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 0 == E_1) || __retres1 == 1) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || __retres1 == 1) || token < local) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(0 == t2_st)) || 0 == E_1) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \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 == t1_pc && 2 <= m_st) && token <= \old(token) + 1) && 2 <= E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && local + 1 <= token)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) && ((((((((((((((((((((((T1_E == 0 || ((((((t1_pc <= 0 && 2 <= m_st) && t1_st == \old(t1_st)) && 0 == t2_st) && token <= local) && E_2 == \old(E_2)) && local <= token)) || 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) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(0 == \old(t2_st))) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(t2_st) < 2) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == E_1) || (((((t1_pc <= 0 && m_st == 0) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || ((((((t1_pc <= 0 && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= local) && E_2 == \old(E_2)) && local <= token))) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == t2_pc) || 1 == E_1) || !(1 == t1_i)) || \old(t1_st) == 0) || \old(token) < local) || (((((t1_pc <= 0 && m_st == 0) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st)) || 1 == E_M) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((((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 == t1_i)) || \old(t1_st) == 0) || ((((((1 == t1_pc && 2 <= m_st) && t1_st == \old(t1_st)) && 0 == t2_st) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token)) || \old(t2_st) < 2) || ((((((1 == t1_pc && 2 <= m_st) && t1_st == \old(t1_st)) && 2 <= t2_st) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || 0 == E_1) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || (((((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 2 <= token)) || 1 == M_E) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && t1_st == \old(t1_st)) && 2 <= t2_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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) && (((((((((((((((((((((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 == m_pc)) || 0 == E_1) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 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) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st))) && (((((((((((((((((((((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) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((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) || 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 == m_pc)) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((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) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) && ((((((((((((((((((((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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st))) || !(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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < \old(token)) || \old(token) < local) || 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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc)) && ((((((((((((((((((((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) || 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 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((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) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((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) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((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) || \old(token) < \old(local) + 1) || !(m_i == 1)) || 1 == \old(E_1)) || !(1 == \old(m_pc))) || (((((((((((1 == t1_pc && token <= local + 1) && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || T2_E == 1) || \old(local) + 2 < \old(token)) || !(\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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((((((((((((((((((((((!(t2_pc == 1) && t1_pc <= 0) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && tmp == 1) && local <= token) || T1_E == 0) || ((((((((((((\old(E_1) == E_1 && t1_pc <= 0) && m_st == 0) && !(m_pc == 1)) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && 0 == t1_st) && 2 <= t2_st) && tmp == 1) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 2 <= t2_st) && tmp == 1) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || T2_E == 0) || ((((((t1_pc <= 0 && token == \old(token)) && ((((!(t2_pc == 1) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || 0 == M_E) || ((((token <= local + 1 && ((((((((((!(t2_pc == 1) && 1 == t1_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && tmp == 1) && \old(E_M) == E_M) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || (((((1 == t1_pc && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && ((((((1 == t2_pc && m_st == 0) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && token <= local + 2)) || !(1 == t1_i)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || (((((((((((((((!(t2_pc == 1) && 1 == t1_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && tmp == 1) && \old(E_M) == E_M) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || \old(token) < \old(local)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && 2 <= E_2) && token <= local) && 2 <= t1_st) && local <= token)) || ((((((((((((t1_pc <= 0 && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && \old(E_2) == E_2) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && tmp == 1) && local <= token)) || ((((((((((((!(t2_pc == 1) && 1 == t1_pc) && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && 0 == t2_st) && tmp == 1) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_2 == \old(E_2)) && local <= token)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((((2 <= t2_st && ((((1 == t1_pc && 1 == t2_pc) && !(E_1 == 1)) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && !(E_M == 1)) && 2 <= m_st) && !(0 == tmp)) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || 0 == \old(E_1)) || ((((((((((((!(t2_pc == 1) && 1 == t1_pc) && 0 == t1_st) && !(E_1 == 1)) && 0 == t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && \old(E_M) == E_M) && token <= local) && 2 <= m_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || \old(E_2) < 2) || (((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && ((2 <= m_st && (((1 == t2_pc && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 1 == m_pc) && 0 == t2_st) && !(E_M == 1)) && !(E_1 == 1)) && !(0 == tmp)) && 2 <= t1_st)) || ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && 1 == t2_pc) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && ((((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 1 == m_pc) && !(0 == tmp)) && !(E_M == 1)) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc))) && ((((((((((((((((((((((T1_E == 0 || \old(t2_st) < 2) || (((((((((((1 == t1_pc && \old(E_1) == E_1) && 2 <= m_st) && token <= local) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \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(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 179 locations, 1 error locations. SAFE Result, 51.7s OverallTime, 26 OverallIterations, 6 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 32.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 7157 SDtfs, 9076 SDslu, 9749 SDs, 0 SdLazy, 6142 SolverSat, 2293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2348 GetRequests, 2170 SyntacticMatches, 39 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7175occurred in iteration=19, 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: 4.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 2830 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 23663 PreInvPairs, 23963 NumberOfFragments, 29357 HoareAnnotationTreeSize, 23663 FomulaSimplifications, 138939 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 71 FomulaSimplificationsInter, 281133 FormulaSimplificationTreeSizeReductionInter, 29.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6475 NumberOfCodeBlocks, 6475 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1832358 SizeOfPredicates, 7 NumberOfNonLiveVariables, 8820 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 35 InterpolantComputations, 25 PerfectInterpolantSequences, 3757/3911 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...